How will a blank-slate AI first prove the infinitude of primes?
6
460Ṁ362029
47%
Euclid's Proof
10%
Erdős's Proof
8%
Saidak's proof by construction
8%
Furstenburg's Topological Proof
7%
Euler's Proof
7%
Proof via inclusion–exclusion
7%
Proof using de Polignac's formula
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,000 to start trading!
1,000
People are also trading
Related questions
Will a blank-slate AI prove the infinitude of primes by 2025-11-03?
25% chance
Would an AI be capable of constructing a non-brute, ultraweak proof of chess for this board state by 2030?
49% chance
Will Artificial Intelligence solve a Millennium Prize Problem before 2030?
31% chance
Are there infinitely many Sophie Germain primes?
87% chance
Will an AI System Solve One of the Remaining Millennium Prize Problems by June 2025?
1% 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?
3% chance
Are there infinitely many balanced primes?
95% chance
Are there infinitely many Fermat primes?
4% chance
Are there infinitely many twin primes?
95% chance