In between Primes

Number Theory Level pending

Let the exist some prime number p > 3 p>3 and set S S where all elements in S S are every prime number from 1 1 to p p , inclusive. The product of all elements in S S is n n . Does there always exist some prime number q q such that p < q < n p<q<n

Yes No

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

1 solution

Carlos Rodriguez
Apr 16, 2020

Since we know n n is the product of all the prime numbers from 1 1 to p p , so we can say that the prime factorization of n n is 1 2 3 5... p 1\cdot2\cdot3\cdot5...p . If n 1 = m n-1=m we can say that m m is relatively prime to all prime numbers from 1 1 to p p , and if m m is relatively prime to all potential prime factorization, then m m must be prime itself, and we know n 1 = m n-1=m satisfies the condition p < m < n p<m<n , thus showing it is always possible .

while the idea is correct, m m is not necessarily prime. For example for p = 7 p = 7 , m = 2 3 5 7 1 = 209 = 11 19 m = 2*3*5*7 - 1= 209 = 11*19 .

Nick Kent - 1 year, 1 month ago

1 pending report

Vote up reports you agree with

×

Problem Loading...

Note Loading...

Set Loading...