Take the 2-minute tour ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

I am looking for some help with this problem:

Let p1, p2, ... , pn+1 be the first n+1 primes in order. Prove that every number between p1 * p2 * p3 ... pn + 1 and p1 * p2 * p3 * ... * pn+1 -1 is composite (inclusive of the second term). How does this show that there are gaps of arbitrary length in the sequence of primes?

I know that if p1 * p2 * p3 ... pn + 1 is not prime, it must have a prime factor larger than pn, and I am guessing this can be leveraged to prove the above problem, but I am not sure where to start or how to put this in mathematical terms. Any help/hints would be great.

EDIT: Sorry I transcribed the problem wrong. This is the correct problem:

Let p1, p2, ... , pn+1 be the first n+1 primes in order. Prove that every number between p1 * p2 * p3 ... pn + 1 and p1 * p2 * ... * pn + pn+1 -1 is composite (inclusive of the second term). How does this show that there are gaps of arbitrary length in the sequence of primes?

share|improve this question
    
Thank you for noticing this. I had transcribed the problem wrong. Please see the edits. –  Alex Oct 28 '13 at 2:51
add comment

1 Answer

The usual way that the final result is proved is by considering the interval $[n!+2, n!+n]$, the terms of which are divisible by $2,3,\ldots, n$, respectively and therefore composite.

share|improve this answer
    
Thank you for the advice. A comment made me notice I had transcribed the problem wrong. Am I right in thinking your advice works for the edited problem too? –  Alex Oct 28 '13 at 2:52
1  
Check divisibility by $p_1, p_2,\ldots, p_n$ and see! –  vadim123 Oct 28 '13 at 3:03
add comment

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.