Isaac M. Bavaresco email (remove spam text)
Today I woke up with a silly idea about prime numbers in my head:
What is the proof that there are infinitely many prime numbers? One of
such proofs was in my mind.
Then I Googled and found Euclid's Proof. It is much similar to mine but
not exactly the same.
Consider a finite list of consecutive prime numbers starting in 3: 3, 5,
7, 11, ..., Pn.
Let P be the product of all the prime numbers in the list.
Let Q = P + 2. Let's prove that Q is prime:
P + 1 is even (not prime)
P + 3 is multiple of 3 (not prime)
P + 5 is multiple of 5 (not prime)
P + Pn is multiple of Pn (not prime)
So Q cannot be multiple of any of the numbers in the list, thus Q is prime.
that the largest known prime number is 2^74,207,281 âˆ’ 1 which has
I found also a list of the first fifty million primes
<https://primes.utm.edu/lists/small/millions/>. If we multiply all the
numbers in this list, it will yield a number that has much more than 50
million digits and thus ought be much larger than the currently known
largest prime number.
Please help!!! Where is the catch? It cannot be that simple!
Este email foi escaneado pelo Avast antivÃrus.
http://www.piclist.com/techref/piclist PIC/SX FAQ & list archive
View/change your membership options at
See also: www.piclist.com/techref/index.htm?key=prime+numbers
You must be a member of the
piclist mailing list
(not only a www.piclist.com member) to post to the