
Re: prove no largest prime
Posted:
Jul 8, 2012 4:42 PM


On Jul 9, 2:19 am, Barry Schwarz <schwa...@dqel.com> wrote: > On Sun, 8 Jul 2012 12:59:17 +1000, "Peter Webb" > > <r.peter.webb...@gmail.com> wrote: > >It may be a proof by contradiction, but it is a constructive proof  the > >proof algorithm generates an infinite number of primes. In my mind, this > >puts it in a different category to those proofs which show nothing meets the > >stated requirement. > > How do you figure p(1) * p(2) * ... * p(n) + 1 generates a prime? >
it's not divisible by p(1) or p(2) or .. p(n)
PROOF:
prime=true let x=1 START p(n)+1 / p(x) has remainder (1/p(x)) OTHERWISE prime=false inc x IF x<=n GOTO START PRINT primme
OUTPUT: true
Loop Invariant prime=true IFF p(n)+1 has no divisor < p(n)+1
Herc

