Erdős Problem #1201 — Large Prime Divisors in Products of Consecutive Integers
For an integer , let be its greatest prime divisor. The question is whether, for every pair of real numbers and , there exists a fixed positive integer such that the set of positive integers for which the product of the consecutive integers from through has a prime divisor greater than has lower asymptotic density at least . Equivalently, is there such a , depending on and but not on or , for which
Restricting to avoids needing a convention for and does not change the lower density. The formulation asks for a strict inequality and permits the block length to depend on both parameters. Erdős Problem #1201 (Er80, p. 107)
Background
The problem is listed as Erdős [Er80, p. 107]. Its entry reports that Erdős said he could prove the assertion for ; this is a report of his claim, not by itself a published proof of the full two-parameter statement. The question asks whether a sufficiently long but fixed block almost always contains a factor nearly as large as its starting point, on a power scale. Erdős Problem #1201 (Er80, p. 107)
A neighboring theme is how the greatest prime divisors of adjacent integers compare. Erdős and Pomerance observed that a natural independence heuristic for these prime factors is difficult to establish; Erdős later likewise noted that even proving density for the inequality was beyond the results he described. These ordering questions are related in subject, but are not the fixed-block assertion above. Erdős, Problems and Results on Consecutive Integers and Prime Factors of Binomial Coefficients (1985) Erdős and Pomerance, On the Largest Prime Factors of n and n + 1 (1978)
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.