ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let p1,…,pkp_{1},\ldots,p_{k} denote the first kk odd primes in succession, and let nn be an even integer such that n>pkn>p_{k}. Williamson's prime-factor conjecture. If, for all 1≤i≤k1\leq i\leq k, n−pin-p_{i} is not prime, then there is an integer ii with 1≤i≤k1\leq i\leq k such that n−pin-p_{i} has a prime factor pp satisfying p≥pkp\geq p_{k}. The conjecture is presented as an elementary statement whose truth would imply Goldbach's conjecture; the supplied text gives no resolution.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.