The following pages link to Computing Binomial Coefficients (Q4726257):
Displaying 14 items.
- The Bernstein polynomial basis: a centennial retrospective (Q448993) (← links)
- Combinatorial congruences from \(p\)-subgroups of the symmetric group (Q687729) (← links)
- Algorithms for polynomials in Bernstein form (Q1105314) (← links)
- The geometry of the binomial array modulo \(p^ 2\) and \(p^ 3\) (Q1182957) (← links)
- Conjugation of rational functions to power functions and applications to iteration (Q1743243) (← links)
- Fractals related to Pascal's triangle (Q1906802) (← links)
- A combinatorial approach to the power of 2 in the number of involutions (Q1957962) (← links)
- Computing the roots of sparse high-degree polynomials that arise from the study of random simplicial complexes (Q2173347) (← links)
- Fast computation of binomial coefficients (Q2220750) (← links)
- Bisecting binomial coefficients (Q2357134) (← links)
- Negation of binomial coefficients (Q2519823) (← links)
- Infinite families of solutions of the equation \binom{𝑛}𝑘=2\binom{𝑎}𝑏 (Q4210968) (← links)
- Gamma and Factorial in the Monthly (Q4577050) (← links)
- Explicit estimates for the number of distinct prime divisors of binomial coefficients (Q6656347) (← links)
