Computing Binomial Coefficients

DOI10.2307/2323099zbMath0617.05004OpenAlexW2060998417WikidataQ56039642 ScholiaQ56039642MaRDI QIDQ4726257

Pierre Goetgheluck

Publication date: 1987

Published in: The American Mathematical Monthly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2323099

zbMATH Keywords

binomial coefficients

Mathematics Subject Classification ID

Factorials, binomial coefficients, combinatorial functions (05A10) Binomial coefficients; factorials; (q)-identities (11B65)

Related Items

Algorithms for polynomials in Bernstein form, Fractals related to Pascal's triangle, Computing the roots of sparse high-degree polynomials that arise from the study of random simplicial complexes, Gamma and Factorial in the Monthly, The Bernstein polynomial basis: a centennial retrospective, A combinatorial approach to the power of 2 in the number of involutions, Fast computation of binomial coefficients, The geometry of the binomial array modulo \(p^ 2\) and \(p^ 3\), Conjugation of rational functions to power functions and applications to iteration, Combinatorial congruences from \(p\)-subgroups of the symmetric group, Infinite families of solutions of the equation \binom{𝑛}𝑘=2\binom{𝑎}𝑏, Bisecting binomial coefficients