Claims

../

2026_03_30_tao: Proves the asymptotic Erdős and Graham asked for, with a relative error of a power of the logarithm, and shows that the integers in very bad intervals are asymptotically the powerful numbers; recorded by the site's curator.

2026_08_26_alexeev: A Lean 4 development in the lean-proofs repository proves that the count of integers in bad intervals is asymptotic to the count of n with P(n) squared dividing n, without an error term and by a route of its own; unreviewed.

---