# Re: PROOF THAT THERE ARE AN INFINITY OF PRIMES!!!!!!!!!!!!!!

*From*: "Proginoskes" <CCHeckman@xxxxxxxxx>*Date*: 16 Feb 2006 23:04:39 -0800

Álvaro Begué wrote:

Rouben Rostamian wrote:

In article <pcXIf.45051$d5.201459@xxxxxxxxxxxxxxx>,[...]

NILS BÖRJESSON <borje@xxxxxxxxxxxx> wrote:

PROOF THAT THERE ARE AN INFINITY OF PRIMES!!!!!!!!!!!!!!

I WILL NOW CONSTRUCT TWO NEW PRIMES:

11 2 1:S

11111 5 1:S

Your CAPS-LOCK key works real well but your math doesn't:

11111

However, I wonder how he proves that this procedure will always

generate numbers that are not divisible by the existing primes in the

list. It was already pointed out that if you start with 2 and 3, this

doesn't work on the first step. What makes it work with 2 and 5?

Well, it doesn't. 11111 is divisible by 41. But how would you show that

it always DOES if you start with two primes p and q?

--- Christopher Heckman

.

**Follow-Ups**:**Re: PROOF THAT THERE ARE AN INFINITY OF PRIMES!!!!!!!!!!!!!!***From:*Geoff Tims

**References**:**PROOF THAT THERE ARE AN INFINITY OF PRIMES!!!!!!!!!!!!!!***From:*NILS BÖRJESSON

**Re: PROOF THAT THERE ARE AN INFINITY OF PRIMES!!!!!!!!!!!!!!***From:*Rouben Rostamian

**Re: PROOF THAT THERE ARE AN INFINITY OF PRIMES!!!!!!!!!!!!!!***From:*Álvaro Begué

- Prev by Date:
**Siliconindia Job Fair** - Next by Date:
**Re: Why do they teach Riemannian sums?** - Previous by thread:
**Re: PROOF THAT THERE ARE AN INFINITY OF PRIMES!!!!!!!!!!!!!!** - Next by thread:
**Re: PROOF THAT THERE ARE AN INFINITY OF PRIMES!!!!!!!!!!!!!!** - Index(es):