Work

Seventeen three-colour Rado numbers for ax + by = cz with three distinct coefficients

Year: 2026
Type: preprint
Abstract: For positive integers a, b, c, the 3-colour Rado number R₃(ax+by=cz) is the least n such that every 3-colouring of {1, …, n} contains a monochromatic solution of ax+by=cz, where x, y, z need not be distinct. This note gives the exact value of R₃ for 17 equations in which a, b and c are pairwise distinct and at least one of them exceeds 6. The values range from 126 to 770. Each lower bound is certified by a 3-colouring of {1, …, R₃−1}, checked by an independent program. Each upper bound is certified by LRAT unsatisfiability proofs from two independently written SAT encodings, all 34 of them accepted by the formally verified checker cake_lpr. We found no published value for any of these equations, although our literature search is not exhaustive. All 17 equations are non-regular in Rado’s sense, so each result also shows that the equation’s degree of regularity is finite and at least 3. The note prints all 17 colourings and the SHA-256 hash of every proof in its appendices. The evidence package (CNF files, solver and checker logs, scripts) and the proofs (about 12 GiB) are available from the author on request. This work was done with substantial help from Anthropic’s Claude models, which wrote the encoders and pipeline, ran the computations, did part of the literature search and drafted the note. The author directed the project and reviewed and approved the code and text. The note includes a full declaration of AI assistance.
Language: English
Open Access status: green
OpenAlex ID: W7225983334
Cites:
Cited by:
Related to: 10