You are viewing a single comment's thread. Return to all comments →
If a is not divisible by p
n! will not be a multiple of p if n > p and p is prime.
a^(p-1) % p= 1
Dr^-1 = (Dr^-1) * (1)
Dr^-1 % p = ((Dr^-1) * (Dr^(p-1)) ) % p
Dr^-1 % p = (Dr^(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 →
If a is not divisible by p
n! will not be a multiple of p if n > p and p is prime.
a^(p-1) % p= 1
Dr^-1 = (Dr^-1) * (1)
Dr^-1 % p = ((Dr^-1) * (Dr^(p-1)) ) % p
Dr^-1 % p = (Dr^(p-2)) % p