You are viewing a single comment's thread. Return to all comments →
Hint :
1- Factorize M . (( M = p1 * p2 * p3 * ... * pr ))
2 - Using Lucas theorem, compute NcR ( mod p_i ) .
3 - Now you have r congruent equations. Each in form x = a_i ( mod n_i )
4- Using CRT, solve them and find x. Actually x is NcR ( mod p1*p2*p3* ... * pr ) .
Seems like cookies are disabled on this browser, please enable them to open this website
Cheese and Random Toppings
You are viewing a single comment's thread. Return to all comments →
Hint :
1- Factorize M . (( M = p1 * p2 * p3 * ... * pr ))
2 - Using Lucas theorem, compute NcR ( mod p_i ) .
3 - Now you have r congruent equations. Each in form x = a_i ( mod n_i )
4- Using CRT, solve them and find x. Actually x is NcR ( mod p1*p2*p3* ... * pr ) .