Calculator theory of numbers APK

Add: The multiplicative inverse of a modulo n.
Purchase: Least common multiple(a, b), Bezout's lemma gcd(a, b) = a * u + b * v, Chinese theorem for a system of 3 or 4 equations

CalInverseFree is calculator with modular arithmetic and theory of numbers.
Functions include:
*Greatest common divisor (GCD) (Euclidean algorithm);
*Chinese theorem for a system of 2 equations;
*The multiplicative inverse of a modulo n.
Purchase:
*Chinese theorem for a system of 3 or 4 equations;
*Least common multiple(a, b);
*Bezout's lemma.
The program shows the methodology solutions.
The program contains a restriction of input value:
*The values are from 0 to 46340.
The program does not require access to the internet.