You are viewing a single comment's thread. Return to all comments →
Sir, I am unable to understand how to slove this question. I have understood till the use of fermat's little theorem.
c=1; for(k=1;k<=n;k++) { c=((c%p)*(((n+m-k)%p)*(pow(k,p-2)%p)%p))%p; } //how do i compute pow(k,p-2)%p ?
Seems like cookies are disabled on this browser, please enable them to open this website
Sherlock and Permutations
You are viewing a single comment's thread. Return to all comments →
Sir, I am unable to understand how to slove this question. I have understood till the use of fermat's little theorem.