← All problems

Erdős Problem #1201 — Large Prime Divisors in Products of Consecutive Integers

1 year old · traced to

For an integer m≥2m\ge 2, let P(m)P(m) be its greatest prime divisor. The question is whether, for every pair of real numbers ϵ>0\epsilon>0 and η>0\eta>0, there exists a fixed positive integer kk such that the set of positive integers n≥2n\ge 2 for which the product of the k+1k+1 consecutive integers from nn through n+kn+k has a prime divisor greater than n1−ϵn^{1-\epsilon} has lower asymptotic density at least 1−η1-\eta. Equivalently, is there such a kk, depending on ϵ\epsilon and η\eta but not on nn or xx, for which

lim inf⁡x→∞1x#{n∈N:2≤n<x, P(∏j=0k(n+j))>n1−ϵ}≥1−η?\liminf_{x\to\infty}\frac{1}{x}\#\left\{n\in\mathbb N:2\le n<x,\ P\left(\prod_{j=0}^{k}(n+j)\right)>n^{1-\epsilon}\right\}\ge 1-\eta?

Restricting to n≥2n\ge2 avoids needing a convention for P(1)P(1) 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 ϵ=1/2\epsilon=1/2; 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 1/21/2 for the inequality P(m)>P(m+1)P(m)>P(m+1) 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)

References

Progress summary

Never refreshed

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.