Possible Duplicate:
Lucas Theorem but without prime numbers
This question mentions a strategy for computing C(n, k) modulo a composite number, but leaves out the details. The use of the Chinese Remainder Theorem is standard, but I don't follow the suggestion for how to use the extended version of Lucas' Theorem to compute C(n, k) mod p^q.