Skip to content

Erdős problem 1110

Let p>q2p>q\geq 2 be two coprime integers. We call nn representable if it is the sum of integers of the form pkqlp^kq^l, 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.lean

Formal Conjectures

FormalConjectures/ErdosProblems/1110.leanErdos1110.erdos_11103 linesExact file
True  ∀ (p q : ℕ),    q < p → 2 ≤ qp.Coprime q → ¬(p = 3 ∧ q = 2) → {n | n.Coprime (p * q) ∧ ¬Erdos1110.Representable p q n}.Infinite
OpenStatement only, no proof

Continue

Search problems.science

Find a Problem, Result, source, or page