Erdős Problem #1094 — Least prime factors of binomial coefficients
For an integer , let denote its least prime divisor. Is the set of integer pairs satisfying and for which
finite? Equivalently, does
hold for all but finitely many such pairs? Bloom, Erdős Problem #1094
Background
Erdős, Lacampagne, and Selfridge presented this as a stronger form of an earlier problem and conjectured that the inequality holds for every , apart from fourteen listed binomial coefficients: . Bloom, Erdős Problem #1094 Erdős, Lacampagne, and Selfridge (1988)
An earlier conjecture attributed to Selfridge asserts the stronger bound when , with as the exception. Erdős also observed that this bound holds when is sufficiently large as a function of . These statements concern restricted ranges or a different bound; neither alone gives the finite-exception assertion posed here. Bloom, Erdős Problem #1094 Selfridge (1977)
References
UnsolvedMath, Erdős Problems set, ULAM AI, licensed CC BY 4.0.
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.