





















Abstract:The greatest common divisor (GCD) of $\binom{2n}{2k}$ for $1\leq k<n$ is known to be some power of 2 times the product of all odd primes p such that $2n=p^i+p^j$. We complete the analysis of this GCD by showing that this power of 2 is either 1 or 0 and relates it to Mersenne primes. We also show how to efficiently compute GCD${\binom{mn}{mk}: 1\leq k<n}$ when n satisfies certain conditions.
From: Chai Wah Wu [view email]
[v1]
Thu, 18 Jun 2026 21:05:49 UTC (5 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。