Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Problem 382
Statement. Let be such that the largest prime dividing appears with exponent at least . Is it true that ? Can be arbitrarily large?
Status. Open, the site's label (OPEN).
Source. erdosproblems.com/382, accessed 2026-09-04. Cite as: T. F. Bloom, Erdős Problem #382, https://www.erdosproblems.com/382.
Formalization. None recorded.
Current assessment
Open; the first question is answered only under a hypothesis. The site's formulation (its revision of 20 October 2025) asks, for intervals whose product has its largest prime factor to an exponent at least , whether and whether can be arbitrarily large; the site labels the problem OPEN. Erdős and Graham report that results of Ramachandra give , and Remark 6.2 of Tao's preprint Tao 2026 says that Ramachandra's Selberg-sieve argument gives for an absolute , records both questions as conjectures of Erdős and Graham and makes no progress on them. The site's commentary credits Stijn Cambie with the observation that a consequence of Cramér's conjecture, that every interval with large contains a prime, answers the first question yes, since an interval that contains a prime has its largest prime factor to the first power only. That answer rests on an unproved hypothesis and is a remark in the site's commentary, not a dated manuscript, so it gets no claim page. Cambie's heuristic for the second question is not a proof; a positive answer to Problem 383 would answer that question yes. A comment of 11 August 2025 in the problem's forum thread gives an interval with whose largest prime factor appears squared and one with whose largest prime factor appears cubed.
Linked library material
These entries are derived from explicit links on library pages. They are navigation only and do not by themselves record mathematical progress.