← All problems

Erdős Problem #1093 — Smooth shifts in good binomial coefficients

40 years old · traced to

Let n,kn,k be integers with k≥1k\geq 1 and n≥2kn\geq 2k. Call the pair (n,k)(n,k) good if no prime p≤kp\leq k divides (nk)\binom{n}{k}. If (n,k)(n,k) is not good, its deficiency is undefined. Otherwise define

d(n,k)=#{i∈Z:0≤i<k, n−i is k-smooth},d(n,k)=\#\{i\in\mathbb Z:0\leq i<k,\ n-i\text{ is }k\text{-smooth}\},

where a positive integer is kk-smooth if each of its prime factors is at most kk. The questions are: are there infinitely many good pairs (n,k)(n,k) with d(n,k)=1d(n,k)=1, and are there only finitely many good pairs with d(n,k)>1d(n,k)>1? 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 kk-smooth integers in the final interval (n−k,n](n-k,n]. Erdős Problem #1093; ELS88; ELS93

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.