The conjecture was posed by Émile Lemoine in 1895, but was erroneously attributed by MathWorld to Hyman Levy who pondered it in the 1960s.[1]
A similar conjecture by Sun in 2008 states that all odd integers greater than 3 can be represented as the sum of a prime number and the product of two consecutive positive integers ( p+x(x+1) ).[2]
Formal definition
To put it algebraically, 2n + 1 = p + 2q always has a solution in primes p and q (not necessarily distinct) for n > 2. The Lemoine conjecture is similar to but stronger than Goldbach's weak conjecture.
Example
For example, the odd integer 47 can be expressed as the sum of a prime and a semiprime in four different ways:
According to MathWorld, the conjecture has been verified by Corbitt up to 109.[1] A blog post in June of 2019 additionally claimed to have verified the conjecture up to 1010.[3]
A proof was claimed in 2017 by Agama and Gensel, but this was later found to be flawed.[4]
John O. Kiltinen and Peter B. Young, "Goldbach, Lemoine, and a Know/Don't Know Problem", Mathematics Magazine, 58(4) (Sep., 1985), pp. 195–203. doi:10.2307/2689513. JSTOR2689513
Richard K. Guy, Unsolved Problems in Number Theory New York: Springer-Verlag 2004: C1