An Identity Involving the Least Common Multiple of Binomial Coefficients and Its Application
From MaRDI portal
Publication:3107113
DOI10.4169/000298909X474909zbMath1228.05022arXiv0906.2295OpenAlexW2963177936WikidataQ58309197 ScholiaQ58309197MaRDI QIDQ3107113
Publication date: 1 January 2012
Published in: American Mathematical Monthly (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0906.2295
Binomial coefficients; factorials; (q)-identities (11B65) Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05) Combinatorics (educational aspects) (97K20)
Related Items (13)
The least common multiple of consecutive terms in a cubic progression ⋮ Probabilistic existence of regular combinatorial structures ⋮ Abbott-and-Costello Numbers ⋮ An optimal tester for \(k\)-Linear ⋮ Unnamed Item ⋮ Unnamed Item ⋮ New lower bounds for the least common multiples of arithmetic progressions ⋮ Proof pearl: Bounding least common multiples with triangles ⋮ Free Heyting algebra endomorphisms: Ruitenburg’s Theorem and beyond ⋮ New lower bounds for the least common multiple of polynomial sequences ⋮ An efficiently generated family of binary de Bruijn sequences ⋮ Proof Pearl: Bounding Least Common Multiples with Triangles ⋮ Identities and estimations involving the least common multiple of strong divisibility sequences
This page was built for publication: An Identity Involving the Least Common Multiple of Binomial Coefficients and Its Application
