Dismiss Notice
Join Physics Forums Today!
The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

Prime numbers hypothesis

  1. Jun 11, 2013 #1
    How do you prove/disprove the following: For any integer n higher then 1, there exists at least one prime number in interval [n+1, n^2]?
  2. jcsd
  3. Jun 11, 2013 #2
    Show that n^2-n-1>n for n>2 and apply Bertrand's postulate that there is a prime in [n,2n] for all n>2.
  4. Jun 11, 2013 #3
    Thank you
Know someone interested in this topic? Share this thread via Reddit, Google+, Twitter, or Facebook

Similar Discussions: Prime numbers hypothesis
  1. Prime Numbers (Replies: 6)

  2. Prime Number (Replies: 15)

  3. Prime numbers (Replies: 12)

  4. Prime numbers (Replies: 8)