Yes, that's called Bertrand's postulate, first proven in 1850 by Chebyshev. For any integer n > 3, there's at least one prime strictly between n and 2n-2. http

Yes, that's called Bertrand's postulate, first proven in 1850 by Chebyshev. For any integer n > 3, there's at least one prime strictly between n and 2n-2. http://en.wikipedia.org/wiki/Bertrand's_postulate http://en.wikipedia.org/wiki/Bertrand's_postulate