Computing Binomial Coefficients

DOI10.2307/2323099MaRDI QIDQ4726257zbMATH OpenOpenAlexWikidataFDO

Authors 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)

Recommendations

• Strategies on the evaluation of binomial coefficients for all integers
• Publication:3472110
• scientific article; zbMATH DE number 1114507
• Computation of Clebsch-Gordan and Gaunt coefficients using binomial coefficients
• Fast computation of multinomial coefficients

Cited in

(16)

• Fast computation of binomial coefficients
• The Bernstein polynomial basis: a centennial retrospective
• Explicit estimates for the number of distinct prime divisors of binomial coefficients
• Gamma and factorial in the Monthly
• The geometry of the binomial array modulo \(p^ 2\) and \(p^ 3\)
• Negation of binomial coefficients
• Combinatorial congruences from \(p\)-subgroups of the symmetric group
• Infinite families of solutions of the equation \binom{𝑛}𝑘=2\binom{𝑎}𝑏
• Bisecting binomial coefficients
• Computing the roots of sparse high-degree polynomials that arise from the study of random simplicial complexes
• Fractals related to Pascal's triangle
• Conjugation of rational functions to power functions and applications to iteration
• A combinatorial approach to the power of 2 in the number of involutions
• Algorithms for polynomials in Bernstein form
• Strategies on the evaluation of binomial coefficients for all integers
• An Optimization Problem Involving Binomial Coefficients

This page was built for publication: Computing Binomial Coefficients

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4726257)