Theorem · version 3

A prime strictly above every bound

Statement

For every natural number n, there exists a prime p with n < p.

Assumptions

  • Natural numbers
  • Ordinary primality

Scope

Natural-number bounds and ordinary primality.

Evidence

Source reports

Connections

In this problem · publication v8 · Selected context

Why are there infinitely many primes? →

Primary formulation · Proved

The strict witness formulation states the canonical question.

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

Work

These tasks target this exact statement version. Each execution retains its own inputs, proof-policy checks, statement-match assessments and reproduction status.

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-prime-strictly-above
Statement version
3
SHA-256
e1c0e255171a94f0c1518a057cc066b35f6c2f0340a64f8b2e1661016c964567

Publication records