How will a blank-slate AI first prove the infinitude of primes?

Mini

6

Ṁ362029

1D

1W

1M

ALL

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

Get Ṁ1,000 play money

## Related questions

## Related questions

Will a blank-slate AI prove the infinitude of primes by 2025-11-03?

34% chance

Will an AI solve any important mathematical conjecture before January 1st, 2030?

76% 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)

50% chance

Will AI create philosophy before 2030?

79% chance

Before 2030, will an AI complete the Turing Test in the Kurzweil/Kapor Longbet?

55% chance

Will AIs be widely recognized as having developed a new, innovative, foundational mathematical theory before 2030?

23% chance

Will AIs be widely recognized as having developed a new, innovative, foundational mathematical theory before 2035?

41% chance

Will any AI be able to explain formal language proofs to >=50% of IMO problems by the start of 2025?

48% chance

Will AI resolve P vs NP by 2050?

25% chance

Would an AI be capable of constructing a non-brute, ultraweak proof of chess for this board state by 2030?

50% chance