I am not able to get how to compute binomial coefficients under modulo 142857 (3^3 * 11 * 13 * 37) . I know that it’s something to do with Lucas and Chinese Remainder Theorem but how to exactly compute modulo some composite number (not square free) or what is the logic behind it .
Hope this helps you
This video deals only with the case when N (in N choose R % P) is always greater than P and P is always a prime number.
Whereas, I am asking about how to compute binomial coefficients modulo some composite number (which might consists of prime powers).
Thanks for the video though.