ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For a constant cc, the 4-colour Rado number R(c)R(c) is the least NN such that every colouring of {1,…,N}\{1,\ldots,N\} in four colours contains a monochromatic solution to x+y+c=zx + y + c = z. Myers (Rutgers thesis, 2015, Conjecture 4.9) and Ahmed, Boza, Emamy-Khansary, Marin, Revuelta and Sanz (Math. Comp. 85, 2016, §5.5) conjectured R(c)=40c+41R(c) = 40c + 41 for all sufficiently large cc, with the small values R(0)=45R(0) = 45 and R(1)=83R(1) = 83 as exceptions. Previous methods reached individual values but not the general case.

This claims the conjecture for every c≥2c \ge 2, by reducing it to three finite facts: the single base value R(2)=121R(2) = 121 and the unsatisfiability of two "spoke" templates. The reduction is formalised in Lean 4 and holds for every D≥1D \ge 1; the two templates are settled by SAT with DRAT certificates.

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.