How will a blank-slate AI first prove the infinitude of primes?
Basic
6
Ṁ362029
47%
Euclid's Proof
7%
Euler's Proof
10%
Erdős's Proof
8%
Furstenburg's Topological Proof
7%
Proof via inclusion–exclusion
7%
Proof using de Polignac's formula
8%
Saidak's proof by construction
7%
The incompressibility method / Information-theoretic
See this market for a description of the kind of AI I am talking about.
There are several proofs of Euclid's theorem - the fact that there are infinitely many primes. This question resolves to whichever proof described on the Wikipedia page (at time of market creation) best captures the approach of the AI when it eventually does this.
Close date updated to 2029-12-31 5:59 pm
This question is managed and resolved by Manifold.
Get
1,000and
3.00
1,0003.00
Related questions
Related questions
Will AI solve any of Hilbert's unsolved problems before April of 2025?
2% chance
Will AI resolve P vs NP by 2050?
37% chance
Will a blank-slate AI prove the infinitude of primes by 2025-11-03?
25% chance
Will Artificial Intelligence solve a Millennium Prize Problem before 2030?
38% chance
OpenAI discovers the first proof of the collatz conjecture before 2026
4% chance
Will an AI solve any important mathematical conjecture before January 1st, 2030?
76% chance
Will an AI model write the proof to the Riemann Hypothesis by the end of 2025?
5% chance
Are there infinitely many balanced primes?
95% chance
Are there infinitely many Fermat primes?
4% chance
In 2029, will any AI be able to take an arbitrary proof in the mathematical literature and translate it into a form suitable for symbolic verification? (Gary Marcus benchmark #5)
82% chance