##This is the main file to call the function invmodJac
##It can be used function randi to prove it with
## random matrices any size.
##Written by Abraham Jacques with copyrights.
##The invmodJac function does no use determinants 
##nor the adjoint matrix in the calculation.
##If modulo m is prime, invmodJac would find its modular inverse matrix.
##Or if GCD(A, m)=1, then invmodJac would also find its modular inverse matrix.
##Created by Abraham Jacques
##Copyright 2018 GNU General Public Licence v2 


A=randi(99, 4);
X=invmodJac(A, 131);
disp(X);
