The Legendre conjecture states that for every integer n there is a prime number between n^2 and (n+1)^2. The generalized Legendre conjecture (GLC) is that there is a prime number between n^K and (n+1)^K; a further conjecture is that the smallest K possible is log(1151)/log(95).
Write a function that takes a value of K, which you can assume to be less than log(1151)/log(95), and determines the first value of n for which the GLC fails as well as the interval [n^K (n+1)^K].
Solve

Solution Stats

118 Solutions

33 Solvers

Last Solution submitted on Oct 25, 2026

Last 200 Solutions

Problem Comments

Solution Comments

Show comments

Problem Recent Solvers33

GeeTwo Ha Le Lorenzo

Suggested Problems

More from this Author330

Problem Tags

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!