加载中…
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 $0\le i\le j$. This note gives a concise proof of a tidy generalization of these facts.

生成讲解博客的中文版本

生成AI智能校验的中文版本