Erdős Problem #1093 — Smooth shifts in good binomial coefficients
Let be integers with and . Call the pair good if no prime divides . If is not good, its deficiency is undefined. Otherwise define
where a positive integer is -smooth if each of its prime factors is at most . The questions are: are there infinitely many good pairs with , and are there only finitely many good pairs with ? Erdős Problem #1093
Background
Erdős, Lacampagne, and Selfridge introduced the deficiency in work cited as 1988 and 1993; the problem was also asked at the 1986 West Coast Number Theory problem session. It sits among questions about how the prime factors of a binomial coefficient relate to its parameters: goodness excludes every prime up to the lower index, while deficiency counts the -smooth integers in the final interval . Erdős Problem #1093; ELS88; ELS93
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.