It says that there is always one prime number between any two consecutive natural number’s(n = 1, 2, 3, 4, 5, …) square. This is called Legendre’s Conjecture.
Conjecture: A conjecture is a proposition or conclusion based upon incompleate information to which no proof has been found i.e it has not been proved or disproved.
there is always one prime p in the range to where n is any natural number.
2 and 3 are the primes in the range to .
5 and 7 are the primes in the range to .
11 and 13 are the primes in the range to .
17 and 19 are the primes in the range to .
Input : 4 output: Primes in the range 16 and 25 are: 17 19 23
Explanation: Here 42 = 16 and 52 = 25
Hence, prime numbers between 16 and 25 are 17, 19 and 23.
Input : 10 Output: Primes in the range 100 and 121 are: 101 103 107 109 113
Output : Primes in the range 2500 and 2601 are: 2503 2521 2531 2539 2543 2549 2551 2557 2579 2591 2593
Don’t stop now and take your learning to the next level. Learn all the important concepts of Data Structures and Algorithms with the help of the most trusted course: DSA Self Paced. Become industry ready at a student-friendly price.
- Lemoine's Conjecture
- Ramanujan–Nagell Conjecture
- Goldbach's Weak Conjecture for Odd numbers
- Program for Goldbach’s Conjecture (Two Primes with given Sum)
- Program to implement Collatz Conjecture
- Maximum Sequence Length | Collatz Conjecture
- Triangle of numbers arising from Gilbreath's conjecture
- Create matrix whose sum of diagonals in each sub matrix is even
- Min operations to reduce N to 1 by multiplying by A or dividing by B
- Min operations to reduce N by multiplying by any number or taking square root
- Least root of given quadratic equation for value greater than equal to K
- Median of sliding window in an array | Set 2
- Kth diagonal from the top left of a given matrix
- Construct a sequence from given frequencies of N consecutive integers with unit adjacent difference
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to email@example.com. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.