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
-
Create a cell array out of a struct
1746 Solvers
-
Set the array elements whose value is 13 to 0
1351 Solvers
-
How many monitors are connected ?
151 Solvers
-
Circular Primes (based on Project Euler, problem 35)
479 Solvers
-
510 Solvers
More from this Author269
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!