Number Theory Algorithms Solve

This useful app contains an helper calculator and instant algorithm solver with following functions:

Number Theory Algorithms Solver:

- Prime factorization

- Greatest Common Divisor (GCD) of two integers

- Least Common Multiple (LCM) of two integers

- Nth roots of integers

- Exponentiation

- Modular Exponentiation

- Logarithms for a number to base 2, e, 10 or arbitrary base

- Prime Test

- Euler's Totient Function

- Chinese Remainder Theorem for a system of 2,3,4,5,6,7 or 8 equations

- Extended Euclidean Algorithm finding x, y such that ax + by = gcd(a, b) for given a,b

and more is comming soon... You can mention other algorithms as comments and we will try to add them.

- You can also copy the outputs of algorithms to clipboard and use for other purposes.