Computing Binomial Coefficients
From MaRDI portal
Publication:4726257
DOI10.2307/2323099zbMATH Open0617.05004OpenAlexW2060998417WikidataQ56039642 ScholiaQ56039642MaRDI QIDQ4726257FDOQ4726257
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
Factorials, binomial coefficients, combinatorial functions (05A10) Binomial coefficients; factorials; (q)-identities (11B65)
Cited In (15)
- Combinatorial congruences from \(p\)-subgroups of the symmetric group
- Negation of binomial coefficients
- A combinatorial approach to the power of 2 in the number of involutions
- Conjugation of rational functions to power functions and applications to iteration
- Algorithms for polynomials in Bernstein form
- Fast computation of binomial coefficients
- Infinite families of solutions of the equation \binom{π}π=2\binom{π}π
- Fractals related to Pascal's triangle
- An Optimization Problem Involving Binomial Coefficients
- Gamma and Factorial in the Monthly
- Computing the roots of sparse high-degree polynomials that arise from the study of random simplicial complexes
- The geometry of the binomial array modulo \(p^ 2\) and \(p^ 3\)
- Explicit estimates for the number of distinct prime divisors of binomial coefficients
- The Bernstein polynomial basis: a centennial retrospective
- Bisecting binomial coefficients
Recommendations
- Strategies on the evaluation of binomial coefficients for all integers π π
- Title not available (Why is that?) π π
- Title not available (Why is that?) π π
- Computation of Clebsch-Gordan and Gaunt coefficients using binomial coefficients π π
- Fast computation of multinomial 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)
