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 m≥n+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).

Erdős Problems records this as proved (Lean).

No Repository has ruled on it here.

How far the record reaches4 of 6 stages
  1. Sourceerdos-problems
  2. StatementRetained
  3. Formal7 retained
  4. Resolutionproved (Lean)
  5. WorkNone recorded
  6. DecisionNone here
  7. The questionNot reached
What this record is missingWork

Nothing here has checked that finding.

Reproducing it here turns a report into evidence.

Where the source files it575 share a topic
Erdős problem 321accepted
Carrying a Standing. Browse the topic.