Modular multiplikative inverses
modulus p:
number a:
eventually number t:
calculate inverse a^-1 mod p
calculate inverse t/a mod p
euclids algoritme
binær version af euclid
(if p is prime)
Fermat a^-1 = a^p-2 mod p
(if p is prime)