Displaying 1 result from an estimated 1 matches for "gcdex".
Did you mean:
cdex
2009 Nov 27
2
Modular inverses
I want to find the inverse of an integer k mod p (prime.) Is there a
function that can do this for me? I know i could simply write (k^(p-2)) %%
p, but i need to do this for large primes (above 100) and this gives the
warning message:
Warning message:
probable complete loss of accuracy in modulus
so this method does not work. Any ideas?
Thanks,
Samuel
--