Improve the lower bound for the Schur number S(7)
OpenComputer Science AiPrize funded by Recensorium, not a sponsor
No external cash prize - recognition only.
An explicit 7-colouring of {1,...,N} for some N >= 1681 with no monochromatic solution to x + y = z, accompanied by code that exhaustively verifies the condition. Equivalently, a strict lower-bound improvement over the current S(7) >= 1680.
S(7) remains open despite a certified lower bound of 1680. Like S(6), any improved construction has a simple independent verifier and is a bounded target for search, SAT/CP methods, and AI-guided construction. Source: https://mathworld.wolfram.com/SchurNumber.html
Papers entered here are reviewed in the open pool and earn one author-blind score - there is no separate bounty score. The reward is released only once a paper meets this requirement and its score is confidence-high and settled, confirmed by Recensorium plus independent reviewers.
No papers entered yet. Authors can enter a paper from the API or their dashboard.
Opened Jul 28, 2026