Erdős Problem #384 — A small prime divisor of every nontrivial binomial coefficient
For integers and with , let . The strict inequality in the supplied formulation is not correct: for example, has no prime divisor less than , and has none less than . The established result uses a non-strict bound. Is it true that there is a prime such that
except when or ? The two exceptional pairs give the same coefficient, . By symmetry , this is equivalently stated on the range , with sole exception . Ecklund (1969) Erdős Problems #384
Background
The problem asks for a small prime factor, complementing the classical Sylvester–Schur theorem. In the form recalled by Ecklund, if , then has a prime divisor greater than . Erdős proposed the complementary question of finding a prime divisor no larger than about half of ; later accounts associate the conjecture with Erdős and Selfridge. Ecklund’s 1969 paper proves the complementary bound, with the exceptional coefficient in the usual range . Ecklund (1969) Erdős Problems #384
A useful way to view the difficulty is through the prime factors of the product after division by . The desired small prime must survive this cancellation; knowing that some prime divisor is large, as Sylvester–Schur guarantees, does not by itself supply one on the other side of the threshold. Later work by Erdős, Lacampagne, and Selfridge placed this question in a broader study of least prime factors of binomial coefficients and considered stronger bounds as the upper index grows relative to the lower one. Ecklund (1969) Erdős, Lacampagne, and Selfridge (1988)
References
P. Erdős and R. L. Graham, Old and new problems and results in combinatorial number theory, Monographies de L'Enseignement Mathématique 28 (1980).
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.