Wiki
Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claims
2026_02_07_belachhab: Belachhab claims that the {2,3}-part of n(n+1) is at most (3/log 2) n log n for every n at least 2, a negative answer; the thread refutes the bound with n = 3^14 * 311, where the ratio is about 4.99.
Linked from (1)
Graph