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 Edit this on Wikidata


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 p if n=pi for some i>0 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 p such that 2n=pi+pj for some 0leilej. 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



Cites Work


Cited In (12)





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)