Theorem · version 2

The set of primes is unbounded

Earlier version 2. View current version 3 →

Statement

The natural-number primes have no upper bound.

Assumptions

  • Natural numbers
  • Ordinary primality

Scope

Natural-number primes with their usual order.

Evidence

Source reports

Connections

In this problem · publication v3 · Selected context

Why are there infinitely many primes? →

Equivalent formulation · Proved

Unboundedness means that every natural-number bound has a larger prime. This is exactly the strict witness formulation.

Relationship not independently reviewed. This concerns its use in this problem.

Formalize a prime strictly above every bound → · Related problem work; no execution evidence for this statement is asserted.

Sources

History

Statement versions

Statement versions and problem publication versions are separate. A new publication can update context or sources while retaining the same statement.

Assessment history · 2

Assessments retained in these publication records. Earlier statement versions retain their own source histories.

Record details
Claim ID
claim-primes-unbounded
Statement version
2
SHA-256
a0db45b4a97e3e53291089d1d42a23989a2a2ddbc4f7c13bfddca3dc7361b09c

Publication records