Download There Is No Largest Prime Number

Survey
yes no Was this document useful for you?
   Thank you for your participation!

* Your assessment is very important for improving the workof artificial intelligence, which forms the content of this project

Document related concepts

Wiles's proof of Fermat's Last Theorem wikipedia , lookup

Theorem wikipedia , lookup

List of prime numbers wikipedia , lookup

Mathematical proof wikipedia , lookup

Proofs of Fermat's little theorem wikipedia , lookup

Transcript
There Is No
Largest Prime
Number
Euklid
There Is No Largest Prime Number
With an introduction to a new proof technique
Euklid of Alexandria
Department of Mathematics
University of Alexandria
27th International Symposium on Prime Numbers, –280
There Is No
Largest Prime
Number
Euklid
There Is No Largest Prime Number
The proof uses reductio ad absurdum.
Theorem
There is no largest prime number.
Proof.
1. Suppose p were the largest prime number.
2. Let q be the product of the first p numbers.
3. Then q + 1 is not divisible by any of them.
4. Thus q + 1 is also prime and greater than p.