Think of multiplictavie group of finite field F[p,n], where p is a prime number and n is a positive integer.
The whole elements of F[p,n] can be represented as
p^n-p^(n-1) positive integers in the following list :
One can define addition,subtraction,multiplication easily :
(addition and subtraction are not closed.. if they are divisible by p)
For Inverse a^-1 and division a/b, currently I am using
For example 7/3 (mod 11) is 6, since 7 = 3*6 (mod 11)
In Mod[7*ExtendedGCD[3,11][[2,1]],11] Out 6
What do you use for inverse or division ?