Goldbach's Conjecture
Prove Goldbach's conjecture by showing that every even integer greater than 2 can be expressed as the sum of two prime numbers, thereby establishing the strong (binary) form of the conjecture.
References
If AI can help us realize the Langlands program, prove Goldbach's conjecture, and resolve the $P \ne NP$ problem, will that be all that bad?
— Mathematicians in the age of AI
(2603.03684 - Avigad, 4 Mar 2026) in Section 4 (Recommendations)