Skip to content

Erdős problem 246

Start work

Let (a,b)=1(a,b)=1. The set {akbl:k,l≥0}\{a^kb^l: k,l\geq 0\} is complete - that is, every large integer is the sum of distinct integers of the form akbla^kb^l with k,l≥0k,l\geq 0.

No current result

No reviewed Result is current in Vela Mathematics Program. Retained source material is shown below.

Retained declaration

FormalConjectures/ErdosProblems/246.lean

Formal Conjectures

FormalConjectures/ErdosProblems/246.leanErdos246.erdos_2461 lineExact file
∀ (a b : ℕ), 2 ≤ a → 2 ≤ b → a.Coprime b → IsAddComplete (Erdos246.Gamma a b)
SolvedProof has a holelean4external proof

The proof uses `sorry`: part of the argument is written but not proved. Lean accepts the file; it does not accept the theorem.

Proof manifests naming this Problem

  • Jayyhk Erdős Leanjayyhk:erdos:246
  • PLBY Lean proofsErdosProblems.Erdos246

Reported activity

Reported by these sources. Not reviewed here.

Continue

Start a contributionBrowse the source filesOpen the collection entry