How will a blank-slate AI first prove the infinitude of primes?
Basic
6
Ṁ36
2029
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
and
S3.00
Sort by:

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

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

© Manifold Markets, Inc.Terms + Mana-only TermsPrivacyRules