Concepts2
∑MathIntermediate
Lucas' Theorem
Lucas' Theorem lets you compute C(n, k) modulo a prime p by working digit-by-digit in base p.
#lucas theorem#binomial coefficient modulo p#prime power modulus+12
∑MathIntermediate
Permutations and Combinations
Permutations count ordered selections, while combinations count unordered selections.
#permutations#combinations#binomial coefficient+12