Papex

Open problem · Mathematics · Open

Erdős Problem 382 (bad intervals of consecutive integers, Erdős and Graham)

Let u <= v be such that the largest prime dividing the product u(u+1)...v appears in it with exponent at least 2. Can v - u be arbitrarily large?

Summary

Erdős and Graham called an interval of consecutive integers bad when its product is divisible by the square of its largest prime factor (OEIS A388654). Problem 382 asks, for such intervals [u, v], whether v - u = v^{o(1)}, and whether v - u can be arbitrarily large. Both parts are open in google-deepmind/formal-conjectures, where a heuristic of Cambie suggests the second answer is yes.

Source

Open, as listed by Erdős problem database (github.com/teorth/erdosproblems), problem 382, status "open" · Erdős problem database (GitHub). Checked 20 Nov 2026.

The status is the source’s. Papex does not decide whether a problem is solved.

Records on this problem

No public record addresses this problem yet.

More in Mathematics