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).

Result history

Published changes, performers, checks, and later corrections.

No result history yet
No proposed change is retained for this Problem, so there is nothing to show a decision on.

Correction history

No correction history

Technical detailsExact roots, source, and retained record identifiers

Exact provenance

Problem row
sha256:2d5fedb58018284155ad8e4f3c072931688c7094870b89dea9e3379345c7850b
Metadata
sha256:e8913f617054adcd90d0cd02ee87c73b38d0d1fee9434e30a2b95881e3d9ea24
Observation
sha256:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content
sha256:62928f890169b6bf61030351118253a2177e005a4db7381adbd845d8adc574ae
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
Source commit
2415f78e850aeee50afdca525c6f2e0ea606f207

Search problems.science

Find a Problem, Result, source, or page