May 24th, 2019, 11:30 PM  #1 
Senior Member Joined: Dec 2015 From: somewhere Posts: 547 Thanks: 83  Prime number problem
Prove that there is always a prime number in interval $\displaystyle [N,2N]$, for $N$  positive integer. $\displaystyle \exists p \; $ such that $\displaystyle N\leq p \leq 2N$. Last edited by skipjack; May 25th, 2019 at 05:31 AM. 
May 25th, 2019, 05:47 AM  #2 
Global Moderator Joined: Dec 2006 Posts: 20,819 Thanks: 2158 
See this article.


Tags 
number, prime, problem 
Thread Tools  
Display Modes  

Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
The number of a number in the prime factorization of a factorial  CSandMathsGuy  Number Theory  3  August 16th, 2018 12:14 PM 
The relationships between Prime number and Fibonacci number (Part 2)  thinhnghiem  Math  0  May 15th, 2018 08:07 AM 
The relationships between Prime number and Fibonacci number  thinhnghiem  Number Theory  15  December 18th, 2016 01:31 PM 
Prime number problem  dha1973  Number Theory  3  December 22nd, 2009 06:04 AM 
A prime number problem  hellfire1708  Number Theory  6  May 28th, 2007 09:51 AM 