On the divisibility of binomial coefficients

From MaRDI portal



Abstract: In Pacific J. Math. 292 (2018), 223-238, Shareshian and Woodroofe asked if for every positive integer n there exist primes p and q such that, for all integers k with 1leqkleqn−1, the binomial coefficient is divisible by at least one of p or q. We give conditions under which a number n has this property and discuss a variant of this problem involving more than two primes. We prove that every positive integer n has infinitely many multiples with this property.






Describes a project that uses

Uses Software






This page was built for publication: On the divisibility of binomial coefficients

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4993963)