Wiki
Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claims
2026_01_29_feng: Aletheia's construction, reported by Feng and coauthors: Pell solutions give n with n and n+1 powerful and n+2 divisible by p^2 for each prime p = 5 mod 8, so the powerful part of n(n+1)...(n+l) over n^2 is unbounded for l >= 2.
Linked from (1)
Graph