Solved cryptogram
The prime numbers never run out. Euclid proved it with an argument you can follow in a minute.
Mathematics Facts, sourced to Wolfram MathWorld.
Or go to the puzzle’s own page first.
What it means
Suppose you had a complete list of primes. Multiply them all together and add one. The result leaves a remainder of one when divided by every prime on your list, so either it is prime itself or it has a prime factor you missed. Either way the list was incomplete. The proof is over two thousand years old and has never needed patching.
The claim comes from Wolfram MathWorld.
- SourceWolfram MathWorld
- CollectionMathematics Facts
- Difficultyhard
- Length75 letters, 21 unique
Nearby in the collection
The facts either side of this one.
- Wolfram MathWorldmedium, 76 letters
- Wolfram MathWorldmedium, 77 letters
- Wolfram MathWorldmedium, 72 letters
- Wolfram MathWorldhard, 65 letters
About as hard as this one
Scored closest to it by the model behind our guide to solving cryptograms.
- Wolfram MathWorldhard, 74 letters
- Wolfram MathWorldhard, 75 letters
- Wolfram MathWorldhard, 70 letters
- MacTutorhard, 74 letters