Wiki
Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claims
2025_10_13_beker: Beker (arXiv, 2025) proved that the largest of the counts f_k(n) is asymptotic to (n-1)! and that, for all sufficiently large n, it is attained exactly at the least k divisible by every integer up to n - k.
Linked from (1)
Graph