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

6

closes 2029

Euclid's Proof

47%

Erdős's Proof

10%

Saidak's proof by construction

8%

Furstenburg's Topological Proof

8%

Euler's Proof

7%

Proof via inclusion–exclusion

7%

Proof using de Polignac's formula

7%

The incompressibility method / Information-theoretic

7%

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 Ṁ500 play money

## Related questions

Sort by:

I expect something that human mathematicians would consider horribly inelegant that makes sense to the alien machine.

## Related questions

Will anyone post an interesting math/algorithms koan/problem/exercise in the comments of this that I'll spend 1h+on?

jackson polack

70% chance

Will anyone post an interesting math/algorithms koan/problem/exercise in the comments of this that I'll spend 30+min on?

jackson polack

59% chance

Will the #1 system on the November 2023 Top 500 supercomputers list exceed 1.5 exaflop/s?

Aaron Lehmann

45% chance

In 2025, will I teach people that Projective Geometric Algebra (PGA)'s "dual" is similar to the Fourier transform?

Hamish Todd

58% chance

Will *any* remaining Millenium Prize problem be solved entirely or mostly by humans?

Vincent Luczkow

71% chance

Will it be possible to get a correct solution for the quadratic equation from the text-to-image model this year?

Mikhail Doroshenko

39% chance

Will Lean have proved the most theorems on Freek's list by beginning of 2024?

Bolton Bailey

37% chance

How will a blank-slate AI first prove the infinitude of primes?, 8k, beautiful, illustration, trending on art station, picture of the day, epic composition