Re: PROOF THAT THERE ARE AN INFINITY OF PRIMES!!!!!!!!!!!!!!
- From: "Álvaro Begué" <alvaro.begue@xxxxxxxxx>
- Date: 16 Feb 2006 19:50:51 -0800
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
He should definitely describe his proof better, but what he said in
that part of the proof is not incorrect. Every number can be devided by
a prime number (lema that is also needed in Euclid's proof that there
are infinitely many numbers), and therefore, there is a prime that
divides 11 and a prime that divides 11111. Because 2, 5, 11 and 11111
are all coprimes, the prime A that divides 11 and the prime B that
divides 11111 are two new primes.
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?
--
Rouben Rostamian
.
- Follow-Ups:
- Re: PROOF THAT THERE ARE AN INFINITY OF PRIMES!!!!!!!!!!!!!!
- From: Proginoskes
- Re: PROOF THAT THERE ARE AN INFINITY OF PRIMES!!!!!!!!!!!!!!
- 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
- PROOF THAT THERE ARE AN INFINITY OF PRIMES!!!!!!!!!!!!!!
- Prev by Date: Re: Why do they teach Riemannian sums?
- Next by Date: Re: Origin and Explanation of the Laplace Transform
- 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):
Relevant Pages
|