Scribd
Upload
35 views3 pages

Theorem: 1. Suppose P Were The Largest Prime Number

The document proves there is no largest prime number using reductio ad absurdum. It assumes a largest prime number p exists, then lets q be the product of the first p numbers. However, q + 1 must also be divisible by some prime number, contradicting the assumption that p was the largest prime. Therefore, there cannot be a largest prime number.

Uploaded by

Diego Moreno
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
35 views3 pages

Theorem: 1. Suppose P Were The Largest Prime Number

The document proves there is no largest prime number using reductio ad absurdum. It assumes a largest prime number p exists, then lets q be the product of the first p numbers. However, q + 1 must also be divisible by some prime number, contradicting the assumption that p was the largest prime. Therefore, there cannot be a largest prime number.

Uploaded by

Diego Moreno
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

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.

4. But q + 1 is greater than 1, thus divisible by some prime number not in the rst p numbers.

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 rst p numbers. 4. But q + 1 is greater than 1, thus divisible by some prime number not in the rst p numbers.

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 rst p numbers. 3. Then q + 1 is not divisible by any of them. 4. But q + 1 is greater than 1, thus divisible by some prime number not in the rst p numbers.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy