Prime numbers hypothesis

  • Thread starter Myslius
  • Start date
  • #1
103
0
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]?
 

Answers and Replies

  • #2
146
0
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.
 
  • #3
103
0
Thank you
 

Related Threads on Prime numbers hypothesis

Replies
10
Views
18K
Replies
3
Views
2K
  • Last Post
Replies
5
Views
2K
  • Last Post
Replies
1
Views
641
  • Last Post
Replies
12
Views
4K
  • Last Post
Replies
15
Views
7K
  • Last Post
Replies
6
Views
2K
  • Last Post
Replies
8
Views
1K
Replies
19
Views
1K
  • Last Post
Replies
10
Views
2K
Top