Open Proof Network

Needs a steward / euclid-primes

Steward euclid-primes

For every natural number n there is a prime greater than n.

The problem’s page →

What the role asks
  • Understand what the network proves on this problem.
  • Write it up, and sign the explainer of the proof that closes it.
  • Best efforts, no deadline: step down at any time.
Read more about stewards →