# Interesting Question

Tags: interesting
 P: 23 Hey guys, u know how Euclid proved that primes r infinite. Now knowing that primes r infinite, if we take some primes p1, p2, p3,.....,pn then will p1*p2*.......*pn(+/-)1 always be prime?
 P: 697 No. 5 - 1 and 5 + 1 are not prime, for example.
PF Patron
Thanks
Emeritus
P: 38,424
 Quote by Muzza No. 5 - 1 and 5 + 1 are not prime, for example.
Since 5 is not a product of primes, I don't see how that is relevant.

The point was that Euclid showed that, if there exist only a finite number of primes, p1, p2, ..., pn, then their product plus 1 is not divisible by any of p1,..., pn and so is either prime itself or is divisible by a prime not in the original list- in either case a contradiction.
Aditya89's question was whether that must, in fact, always be a prime. I don't believe so but I don't see a proof offhand.

P: 697

## Interesting Question

 if we take some primes p1, p2, p3,.....,pn then will p1*p2*.......*pn(+/-)1 always be prime?
 Since 5 is not a product of primes, I don't see how that is relevant.
It's perfectly relevant. Let n = 1 and p_1 = 5.

But if you for some odd reason believe that n = 1 is forbidden, consider 2*3*5*7 - 1 and 2*3*5*7*11*13 + 1.
 HW Helper Sci Advisor P: 9,371 This brings up a point that comes up whenever you have to teach the prime factorization theorem. I have started saying something like " every integer greater than 1, is either prime or is a product of primes," because so many students fail to grok that a product of n factors can be prime if n = 1. this somewhat clunky statement can also help them when they have to use it, as sometimes the first case is to assume their number is prime, and the second case is to assume it is not, but is a product of primes.
 HW Helper Sci Advisor P: 1,996 If you want infinitely many counter examples, take any two odd primes (or actually any number of odd primes), p1, p2, then p1*p2+/-1 will be even and greater than 2, hence composite.
 P: 343 No, the thing meant is you can refer to this set {2,3,5,7,11,13,17,....} and by now I think you can predict the rest of the set. The thing to be proved is that if we find the product of some first n consecutive terms in this set, and add or subtract, the number we get NEED NOT BE A PRIME.
 P: 343 Sorry, add or subtract "1", the number we get need not be a prime. But anyway Aditya wants us to prove that they are always prime.
P: 697
 The thing to be proved is that if we find the product of some first n consecutive terms...
 ...if we take some primes p1, p2, p3,.....,pn then will p1*p2*.......*pn(+/-)1 always be prime?
In my world at least, "some primes" is not synonymous with "consecutive primes".

 But anyway Aditya wants us to prove that they are always prime.
Even that can't be done. See the first reply in this thread.
 HW Helper Sci Advisor P: 1,996 It's maybe worth pointing out that the Euclid proof does not need to say anything about the n primes you start with. They don't need to be consecutive. They don't need to be ordered. They don't need to be the first n. They don't even need to be unique. Take *any* n primes, multiply them, add 1, this new number must be divisible by a prime that you didn't start with, though it need not be prime itself. This guarantees that for any finite list of primes, you can always add one more. pi (really $$p_i$$) is often used to denote the nth prime in number theory, but not always, so you can usually expect an explicit statement to this effect. If someone writes "some primes p1, p2, ..., pn" there's no reason to assume any other meaning than some collection of n numbers that are all prime.
 P: 343 You don't read Aditya's post. Read my post and prove or disprove it if you can. Interpret whatever you want to it, Just as Shmoe showed its very easy if you neglect two, by getting even numbers you are again reaching a composite number. But I think proving what I mean is quite difficult. I want to see if you can and moreover I am also interested the way to see how such proofs are framed in number theory because I have just now passed tenth grade and has no much knowldege on how to frame differant types proofs in number theory.
P: 697
If anything, you haven't read MY post (if you had, you surely would have noticed that I even quoted from Aditya's post).

 Read my post and prove or disprove it if you can.
I did disprove it, in the third reply to this thread. I gave the counterexamples 2*3*5*7 - 1 and 2*3*5*7*11*13 + 1.
HW Helper
P: 1,996
He did. I'm in complete agreement with Muzza and how he interpreted the OP, I was just adding some more info. You should look again at what I said about the $$p_i$$ notation. Even if you wanted to make the assumption that $$p_i$$ is the ith prime, a single value of n where p1*p2*...*pn+1 is not prime would disprove this interpretation of the OP's question (likewise for the - case), which asked if it was *always* prime (Muzza did this).
 HW Helper P: 1,007 Here's how it goes: Theorem There are infinitely many primes. proof: Suppose there are only infinitely many primes. Let $p_1,p_2,\ldots , p_n$ be the list of all prime numbers. Put $m=p_1p_2\ldots p_n+1$. Since m is clearly larger than 1, so m is either prime, or a product of primes. If m is prime, then this gives a contradiction as m is clearly larger than any prime on the above list. If m is not prime, then it is a product of primes. Let q denote such a prime (this would be on the list.) Then m is divisible by q, but m is not divisible by any $p_i$ for m divided by $p_i$ gives a quotient of $\frac{p_1p_2\ldots p_n+1}{p_i}$ and a remainder of 1. I coppied this proof out of How to Prove It: A Structured Approach by Daniel J. Velleman.