p is prime.
(1) Give a combinatorial proof that C(pa, pb) = C(a,b) mod p (This is easy, I had a proof in a few minutes)
(2) Give a combinatorial proof that C(pa,pb) = C(a,b) mod p^2. (Still working on this)
(3) p >= 5. Give a combinatorial proof that C(pa, pb) = C(a,b) mod p^3. (I think this is open)