On the greatest common divisor of binomial coefficients
From MaRDI portal
Publication:4575253
Abstract: Every binomial coefficient aficionado knows that the greatest common divisor of the binomial coefficients equals if for some and equals 1 otherwise. It is less well known that the greatest common divisor of the binomial coefficients equals (a certain power of 2 times) the product of all odd primes such that for some . This note gives a concise proof of a tidy generalization of these facts.
Recommendations
Cites work
Cited in
(12)- A variation on bisecting the binomial coefficients
- ON COMMON DIVISORS OF MULTINOMIAL COEFFICIENTS
- scientific article; zbMATH DE number 6286514 (Why is no real title available?)
- The greatest common divisor of certain sets of binomial coefficients
- On the greatest common divisor of binomial coefficients
- Note on a Binomial Coefficient Divisor
- scientific article; zbMATH DE number 17599 (Why is no real title available?)
- scientific article; zbMATH DE number 845717 (Why is no real title available?)
- scientific article; zbMATH DE number 3966170 (Why is no real title available?)
- scientific article; zbMATH DE number 2124086 (Why is no real title available?)
- On the Least Common Multiple of Q-Binomial Coefficients
- The greatest common divisor of certain binomial coefficients
This page was built for publication: On the greatest common divisor of binomial coefficients
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4575253)