Computing Binomial Coefficients
From MaRDI portal
Publication:4726257
Recommendations
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)