Category
Level
Lucas' Theorem lets you compute C(n, k) modulo a prime p by working digit-by-digit in base p.