Arrangements and Combinations · Lucas Theorem and the Sierpiński Triangle (Optional)
Lesson 1
In this section, we look at Pascal's triangle from a different angle: instead of asking how large the binomial coefficients are, we ask what remainders they give modulo a prime number. Already modulo \(2\), this produces an unexpectedly structured picture.