Arrangements and Combinations · Lucas Theorem and the Sierpiński Triangle (Optional)
Lesson 8
Problem. How many integers \(k\) with \(0\le k\le n\) satisfy \[\binom{n}{k}\equiv 2\pmod 3, \qquad n=(220120212001221002010221000112)_{3}?\]
3 points
Arrangements and Combinations · Lucas Theorem and the Sierpiński Triangle (Optional)
Problem. How many integers \(k\) with \(0\le k\le n\) satisfy \[\binom{n}{k}\equiv 2\pmod 3, \qquad n=(220120212001221002010221000112)_{3}?\]