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
-
39887 Solvers
-
3553 Solvers
-
990 Solvers
-
439 Solvers
-
Return elements unique to either input
757 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!