piclist 2017\09\06\192810a >
Thread: Prime numbers
www.piclist.com/techref/index.htm?key=prime+numbers
BY : Sean Breheny email (remove spam text)

Peter has a good point - if you also show that all integers have prime
factorizations (easy to do) then your method DOES prove that there are
infinitely many primes because it proves that there exists an integer Q,
larger than Pn, which is not divisible by any of the primes below (or equal
to) Pn - so either this number Q is itself prime, in which case you've
found a prime which is not in your original set, or if Q is not prime, it
must be divisible by at least one prime factor which is not contained in
your original set. Since Q is not even, this prime factor is not 2. Since
your set contains all primes between 2 and Pn, inclusive of Pn, you have
shown that there is at least one prime which is not in your set but is
larger than Pn.

On Wed, Sep 6, 2017 at 3:56 PM, peter green <plugwashp10link.net> wrote:

{Quote hidden}

-- http://www.piclist.com/techref/piclist PIC/SX FAQ & list archive
View/change your membership options at
mailman.mit.edu/mailman/listinfo/piclist
.

<CAE8uMMp-OnHuBdUDutG=43nuHJJVh0K7vqopOdESv0a_+e-UBw@mail.gmail.com> quoted-printable

In reply to: <622d8e4e-f9ed-1c7b-8beb-405fd68a87a5@p10link.net>
See also: www.piclist.com/techref/index.htm?key=prime+numbers
Reply You must be a member of the piclist mailing list (not only a www.piclist.com member) to post to the piclist. This form requires JavaScript and a browser/email client that can handle form mailto: posts.
Subject (change) Prime numbers

new search...