Erdős problem 1110
Let be two coprime integers. We call representable if it is the sum of integers of the form , none of which divide each other.
No current result
No reviewed Result is current in Vela Mathematics Program. Retained source material is shown below.
Retained declaration
FormalConjectures/ErdosProblems/1110.leanTrue ↔ ∀ (p q : ℕ), q < p → 2 ≤ q → p.Coprime q → ¬(p = 3 ∧ q = 2) → {n | n.Coprime (p * q) ∧ ¬Erdos1110.Representable p q n}.InfiniteOpenStatement only, no proof