Problem 47950. Test the generalized Legendre conjecture

• Created by ChrisR
• Appears in Cody Problems in Japanese

×

Like (0)

Difficulty:

(197)

Rate

• Solve Later   
• Add To GroupÂ

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 [ ].

Solve

Solution Stats

51.85% Correct | 48.15% Incorrect

• 27 Solutions
• 14 Solvers

Last Solution submitted on Sep 09, 2024

Last 200 Solutions

Solution Comments

Problem Recent Solvers14

Suggested Problems

• Reverse the vector

  14589 Solvers

• Swap the input arguments

  11699 Solvers

• Fermat's Last Theorem - Fermat's conjecture

  101 Solvers

• Chebyshev polynomials of the 1st Kind

  71 Solvers

• Solving Quadratic Equations (Version 1)

  491 Solvers

More from this Author291

• List the partitions of an integer

  5 Solvers

• Compute the critical depth of a channel

  5 Solvers

• Compute the nth Pythagorean prime

  32 Solvers

• Convert integers from base 10 to proper primary notation

  3 Solvers

• List the dihedral primes

  12 Solvers