factorial n!
n!
factorial(3) // => 3 * 2 * 1 = 6
count permutations P(n,k) n <= k
P(n,k) n <= k
permutations(3, 2) // => 3! / (3 - 2)! = 6
count combinations C(n,k) n <= k
C(n,k) n <= k
combinations(3, 2) // => 3! / (2! * (3 - 2)!) = 3
Generated using TypeDoc
factorial
n!factorial(3) // => 3 * 2 * 1 = 6