Enumerative Combinatorics
- Introduction
- Combinatorial Functions
Factorial(n): RngIntElt → RngIntEltNumberOfPermutations(n, k): RngIntElt, RngIntElt → RngIntEltBinomial(n, r): RngIntElt, RngIntElt → RngIntEltMultinomial(n, [r₁, ... rₙ]): RngIntElt, [RngIntElt] → RngIntEltFibonacci(n): RngIntElt → RngIntEltCatalan(n): RngIntElt → RngIntEltLucas(n): RngIntElt → RngIntEltGeneralizedFibonacciNumber(g0, g1, n): RngIntElt, RngIntElt, RngIntElt → RngIntEltStirlingFirst(n, k): RngIntElt, RngIntElt → RngIntEltStirlingSecond(n, k): RngIntElt, RngIntElt → RngIntEltBell(n): RngIntElt → RngIntEltEulerianNumber(n, r): RngIntElt, RngIntElt → RngIntEltHarmonicNumber(n): RngIntElt → FldRatEltBernoulliNumber(n): RngIntElt → FldRatEltBernoulliApproximation(n): RngIntElt → FldPrEltBernoulliPolynomial(n): RngIntElt → RngUPolElt
- Subsets of a Finite Set
