The Primes Are Infinite

Requires a Wolfram Notebook System

Interact on desktop, mobile and cloud with the free Wolfram CDF Player or other Wolfram Language products.

Requires a Wolfram Notebook System

Edit on desktop, mobile and cloud with any Wolfram Language product.

The prime numbers, 2, 3, 5, 7, 11, …, are integers divisible only by themselves and one. Euclid's Elements IX:20 proves the primes are infinite. "Consider any finite set of primes. Multiply all of them together and add one. The resulting number is not divisible by any of the primes in the finite set we considered, because dividing by any of these would give a remainder of one". This Demonstration allows you to study Euclid's method with various sets of primes.

Contributed by: Ed Pegg Jr (March 2011)
Open content licensed under CC BY-NC-SA


Snapshots


Details



Feedback (field required)
Email (field required) Name
Occupation Organization
Note: Your message & contact information may be shared with the author of any specific Demonstration for which you give feedback.
Send