Problem 47950. Test the generalized Legendre conjecture
The Legendre conjecture states that for every integer n there is a prime number between and . The generalized Legendre conjecture (GLC) is that there is a prime number between and ; a further conjecture is that the smallest K possible is .
Write a function that takes a value of K, which you can assume to be less than , and determines the first value of n for which the GLC fails as well as the interval [ ].
Solution Stats
Solution Comments
Show commentsProblem Recent Solvers13
Suggested Problems
-
Project Euler: Problem 7, Nth prime
1393 Solvers
-
"Low : High - Low : High - Turn around " -- Create a subindices vector
527 Solvers
-
343 Solvers
-
How many monitors are connected ?
151 Solvers
-
120 Solvers
More from this Author250
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!