Erdős problem 418
Are there infinitely many integers not of the form ?
Sources
FormalConjectures/ErdosProblems/
418.lean
Retained formal statement
It follows from a slight strengthening of the Goldbach conjecture that every odd number can be written as . In particular, we assume that every even number greater than 6 can be written as the sum of two *distinct* primes, in contrast to the usual Goldbach conjecture that every even number greater than 2 can be written as the sum of two primes.
(∀ (n : ℕ), 6 < n → Even n → ∃ p q, p ≠ q ∧ Nat.Prime p ∧ Nat.Prime q ∧ n = p + q) → ∀ (m : ℕ), Odd m → ∃ n, m + n.totient = nSolvedStatement only, no proof