On the greatest common divisor of binomial coefficients
From MaRDI portal
Publication:4575253
DOI10.4169/AMER.MATH.MONTHLY.124.4.353zbMATH Open1391.05019arXiv1510.06696OpenAlexW3101032279MaRDI QIDQ4575253FDOQ4575253
Authors: Carl S. McTague
Publication date: 13 July 2018
Published in: The American Mathematical Monthly (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1510.06696
Recommendations
Factorials, binomial coefficients, combinatorial functions (05A10) Binomial coefficients; factorials; (q)-identities (11B65)
Cites Work
Cited In (12)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The greatest common divisor of certain sets of binomial coefficients
- The greatest common divisor of certain binomial coefficients
- Title not available (Why is that?)
- On the Least Common Multiple of Q-Binomial Coefficients
- ON COMMON DIVISORS OF MULTINOMIAL COEFFICIENTS
- Title not available (Why is that?)
- Note on a Binomial Coefficient Divisor
- Title not available (Why is that?)
- A variation on bisecting the binomial coefficients
- On the greatest common divisor of 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)