Computing the Greatest Common Divisor of Binomial Coefficients C(mn, mk)
Communications on Number Theory and Combinatorial Theory · 2026
DOI: 10.70013/c792j2mn ↗Kurz gefasst
Fachartikel in der Zeitschrift Communications on Number Theory and Combinatorial Theory, 2026. Verfasst von Chai Wah Wu.
Abstract (Originalsprache)
The greatest common divisor (GCD) of C(2n,2k) for 1 ≤ k < n is known to be some power of 2 times the product of all odd primes p such that 2n = pi + pj. We complete the analysis of this GCD by showing that its 2-adic valuation is at most 1 and relates it to Mersenne primes. We also show how to efficiently compute GCD {C(mn,mk) : 1 ≤ k < n} when n and m satisfy certain conditions.
Zitieren
APA
Wu, C. W. (2026). Computing the Greatest Common Divisor of Binomial Coefficients C(mn, mk). Communications on Number Theory and Combinatorial Theory. https://doi.org/10.70013/c792j2mn
Vancouver
Wu CW. Computing the Greatest Common Divisor of Binomial Coefficients C(mn, mk). Communications on Number Theory and Combinatorial Theory. 2026. doi:10.70013/c792j2mn
BibTeX
@article{Wu2026,
author = {Wu, Chai Wah},
title = {Computing the Greatest Common Divisor of Binomial Coefficients C(mn, mk)},
journal = {Communications on Number Theory and Combinatorial Theory},
year = {2026},
doi = {10.70013/c792j2mn}
}
EUVIMED