Documentation

FormalConjectures.Wikipedia.Lemoine

Lemoine's conjectures #

References:

Equations
Instances For
    theorem Lemoine.lemoine_conjecture (n : ) (hn : 6 < n) (odd : Odd n) :
    ∃ (p : ) (q : ), Nat.Prime p Nat.Prime q p + 2 * q = n

    For all odd integers $n ≥ 7$ there are prime numbers $p,q$ such that $n = p+2q$.

    theorem Lemoine.lemoine_conjecture_extension (n : ) (hn : 8 < n) (odd : Odd n) :
    ∃ (p : ) (q : ) (r : ) (s : ) (a : ) (b : ), OddPrime p OddPrime q OddPrime r OddPrime s p + 2 * q = n 2 + p * q = 2 ^ a + r 2 * p + q = 2 ^ b + s

    For all odd integers $n ≥ 9$ there are odd prime numbers $p,q,r,s$ and natural numbers $a,b$ such that $p+2q = n$, $2+pq = 2^a+r$, $2p+q = 2^b+s$