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 CommentsShow comments
Problem Recent Solvers13