
Introducing the #justinsunprize. Rewarding Breakthroughs in Classic Mathematical Challenges Learn more 👇 hejustinsun.com/prize

Official X Account of the #JustinSunPrize

Introducing the #justinsunprize. Rewarding Breakthroughs in Classic Mathematical Challenges Learn more 👇 hejustinsun.com/prize

The register also now lists a Lean formalization of Erdős Problem #841, by Peilin Liu, covering the original density-zero question. The mathematics of that formalization is Bui, Pratt and Zaharescu (2024). Full post 👇
Erdős Problem #841 has a Lean formalization on the #justinsunprize award register. It covers the original density-zero question, not later distribution results. Lean formalization: Peilin Liu Mathematics: Bui, Pratt and Zaharescu (2024) Award record 👇 github.com/TheJustinSunPrize…

Erdős Problem #841 has a Lean formalization on the #justinsunprize award register. It covers the original density-zero question, not later distribution results. Lean formalization: Peilin Liu Mathematics: Bui, Pratt and Zaharescu (2024) Award record 👇 github.com/TheJustinSunPrize…

[BREAKING] #justinsunprize Recognizes New Work on Two Erdős Problems, Highlighting AI's Role in Mathematics Details of each recipient’s contribution, including Lean source code and verification records, are available in the prize’s public GitHub repository. More details on @TheBlockCo 👇 theblock.co/sponsored/2026-1…

Credit is recorded by role. On the #justinsunprize candidates board, the mathematical solver and the Lean formalizer each have their own entry and their own 14-day public review. MathDB pilot problems add a third category: Exposition. How it works 👇 github.com/TheJustinSunPrize…

Open problem of the week For every n > 2, can 4/n be written as 1/x + 1/y + 1/z with integers 0 < x < y < z? Checked by computer up to 10^18. Not yet proved. Erdős Problem #242, the Erdős-Straus conjecture. Open in the #justinsunprize problem bank 👇 github.com/TheJustinSunPrize…

Erdős Problem #97 has a negative answer. The #justinsunprize register credits solution and Lean separately. Solution: Liam Kruer, Jensen Kohlmeyer, Liam Price (equal coauthors) Lean formalization: Liam Kruer, Jensen Kohlmeyer, Liam Price Award record 👇 github.com/TheJustinSunPrize…

A Lean formalization of the Poincaré conjecture is now on the #justinsunprize candidates board. Formalized by Ziyang Qin, Yuan Liao, Ayush Khaitan and Bennett Chow. The mathematics is Perelman's. Public review runs to 25 November 👇 github.com/TheJustinSunPrize…

Are there infinitely many pairs of primes that differ by two? Open since Polignac (1849). Open in the #justinsunprize problem bank 👇 github.com/TheJustinSunPrize…

Two results are on the #justinsunprize candidates board right now. Before anything is awarded, each one sits in public for 14 days. Anyone can check the proof, the Lean formalization and the credits, and raise an objection. Review them 👇 github.com/TheJustinSunPrize…

A Lean build can succeed and still prove the wrong statement. In #justinsunprize review, statement fidelity and axiom use are checked separately from compilation. A passing kernel check is evidence, not an award. FAQ 👇 hejustinsun.com/prize/faq

Formalizing a known theorem shows the tools are ready. The next step is the open ones. The #justinsunprize problem bank is public. Pick a problem, prove it in Lean, and submit 👇 github.com/TheJustinSunPrize…
1,000 agents formalizing Fermat's Last Theorem in 30 hours is a real milestone for machine-checkable math. Open problems, real proofs, public verification. That is exactly what we want the Justin Sun Prize to reward.

Open problem of the week Take real numbers α and β. Multiply n by the distances from nα and nβ to the nearest integer. Can this product get as small as you like? Erdős Problem #495, the Littlewood conjecture. Open in the #justinsunprize problem bank 👇 github.com/TheJustinSunPrize…

Paul Erdős said a well-chosen problem might be one of two things. Marshmallow: "a tasty tidbit supplying a few moments of fleeting enjoyment." Acorn: "requiring deep and subtle new insights." Find your next one in the #justinsunprize problem bank 👇 github.com/TheJustinSunPrize…


How do you repair a proof when the main strategy works, but one special case still has a gap? Tang (@Vieta__jumping) breaks down Problem #650, including how the proof was repaired, formalized in Lean, and rewritten for human readers. Explore the official problem list and participation guidelines: hejustinsun.com/prize
The Justin Sun Prize @JustinSunPrize Oct 28 Article Winner Spotlight: Quanyu Tang Recognized for Mathematical Achievement The Justin Sun Prize recognizes Quanyu Tang for his contributions to mathematical problem-solving, highlighting a researcher whose work spans number theory, spectral theory, and mathematical analysis.
