Re: Is this proof of infinitely many primes flawed?
- From: David C. Ullrich <dullrich@xxxxxxxxxxx>
- Date: Thu, 29 Jan 2009 04:11:47 -0600
On Wed, 28 Jan 2009 05:20:05 -0800 (PST), "sttscitrans@xxxxxxxxx"
<sttscitrans@xxxxxxxxx> wrote:
On 28 Jan, 11:56, David C. Ullrich <dullr...@xxxxxxxxxxx> wrote:
On Wed, 28 Jan 2009 00:45:44 -0800 (PST), "sttscitr...@xxxxxxxxx"
<sttscitr...@xxxxxxxxx> wrote:
On 28 Jan, 03:15, W^3 <aderamey.a...@xxxxxxxxxxx> wrote:
In article
<192daabf-10e1-483f-bab3-df686a539...@xxxxxxxxxxxxxxxxxxxxxxxxxxxx>,
conrad <con...@xxxxxxxxxx> wrote:
Suppose p_1,p_2,...,p_n are all the primes
Let M = (p_1,p_2,...,p_n) + 1
Suppose p_k | M
Clearly p_k | (p_1,p_2,...,p_n)
then p_k | M - (p_1,p_2,...,p_n) = 1
But p_k > 1 (Contradiction)
Where I do not follow this proof is
if we suppose p_k divides evenly M
then how can we say p_k divides
evenly (p_1,p_2,...,p_n)?
It has nothing to do with assuming p_k | M. It is simply obvious, as
obvious as saying 5 | 3*5*7.
You are missing the point.
No, you are.
No, you haven't understood what the OP was
asking.
Obviously, if p is a prime, it divides the
product of all the primes that are assumed exist.
The OP was puzzled by the statement that
some prime divides M and yet this prime
divides the product of all primes.
He had simply forgotten that if pn
is the last prime, every number greater
than pn, e.g. M must be divisble by at least
one of the primes assumed to exist, say p_k.
If you say so. How you can know that this
is what puzzled him, when it's just the opposite
of what he actually asked, is beyond me.
p_k divides M and p_k divides the product of all
primes assumed to exist.
p_k must then divide the difference 1, which
is absurd.
Where I do not follow this proof is
if we suppose p_k divides evenly M
then how can we say p_k divides
evenly (p_1,p_2,...,p_n)?
No one is claiming it was.If 2,3,5 were the only primes
A= 2*3*5
B = 2*3*5+1
As B>1 some prime 2,3 or 5 must divide it
say, 3,
3 must divide A by definition
3 divides B
Right. And the fact that 3 divides B was not
deduced from the fact that 3 divides A;
David C. Ullrich
"Understanding Godel isn't about following his formal proof.
That would make a mockery of everything Godel was up to."
(John Jones, "My talk about Godel to the post-grads."
in sci.logic.)
.
- Follow-Ups:
- Re: Is this proof of infinitely many primes flawed?
- From: sttscitrans@xxxxxxxxx
- Re: Is this proof of infinitely many primes flawed?
- References:
- Is this proof of infinitely many primes flawed?
- From: conrad
- Re: Is this proof of infinitely many primes flawed?
- From: W^3
- Re: Is this proof of infinitely many primes flawed?
- From: sttscitrans@xxxxxxxxx
- Re: Is this proof of infinitely many primes flawed?
- From: David C . Ullrich
- Re: Is this proof of infinitely many primes flawed?
- From: sttscitrans@xxxxxxxxx
- Is this proof of infinitely many primes flawed?
- Prev by Date: Re: The modern mathematical concept of infinity is indefensible
- Next by Date: Re: The modern mathematical concept of infinity is indefensible
- Previous by thread: Re: Is this proof of infinitely many primes flawed?
- Next by thread: Re: Is this proof of infinitely many primes flawed?
- Index(es):
Relevant Pages
|