Wiki
Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claims
2026_09_18_kruer_kohlmeyer: A kernel-checked Lean proof, certified by the bounty site Conjectures.io, that the density of integers whose distinct divisors can sum to t exists for every t but is asymptotic to no constant times a power of log t.
Linked from (1)
Graph