Skip to content

Erdős problem 678

Write M(n,k)M(n, k) be the least common multiple of {n+1,,n+k}\{n+1, \dotsc, n+k\}. Let kk be sufficiently large. Are there infinitely many m,nm, n with mn+km \geq n + k such that M(n,k)>M(m,k+1) M(n, k) > M(m, k + 1) ? The answer is yes, as proved in a strong form by Cambie [Ca24]. [Ca24] S. Cambie, Resolution of an Erdős' problem on least common multiples. arXiv:2410.09138 (2024).

No current result

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

Retained declaration

FormalConjectures/ErdosProblems/678.lean

Formal Conjectures

FormalConjectures/ErdosProblems/678.leanErdos678.erdos_6781 lineExact file
True ↔ ∀ᶠ (k : ℕ) in Filter.atTop, {(m, n) | n + kmFinset.lcmInterval m (k + 1) < Finset.lcmInterval n k}.Nonempty
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:678
  • PLBY Lean proofsErdosProblems.Erdos678

Reported activity

Work these sources record against this Problem. Source-reported attribution, not reviewed here.

Continue

Search problems.science

Find a Problem, Result, source, or page