Bertrand's Postulate

Want to see the rest? Click here.
Waiting for input...

📘 What is "n"?

n is simply the number you choose to start with.

If you enter n = 10, the program checks:

👉 10 and 20 (which is 2 × 10)

📘 The theorem

For every number n > 1, there is always at least one prime number between n and 2n.

🔍 What is a prime?

A prime number is only divisible by 1 and itself.

⚙️ What this shows

The program highlights all primes between n and 2n.