1. Determine if number is prime, or find the smallest prime factor if it is not prime. This can be used repeatedly to find all the prime factors of a number.
2. Find the gcd(m,n) (greatest common divisor) and lcm (least common multiple) of two integers, i.e. the largest integer that divides both numbers.
3. Compute a number mod n, (modular arithmetic), or a number raised to a power mod n, i.e. modular exponentiation a^b mod n. For example 2^50 mod 15.
4. Compute the modular inverse of a number, i.e. solve a*x = 1 mod n, for integer x, given a and n.
5. Find integer solutions x, y to Diophantine equations, i.e. equations of the form ax + by = c, where a, b, c are all integers.
This app does not display any ads.
Please submit your comments/suggestions to improve this app for future versions.
We do not host Number Theory Solver on our servers. We did not scan it for viruses, adware, spyware or other type of malware. This app is hosted by Google and passed their terms and conditions to be listed there. We recommend caution when installing it.
The Google Play link for Number Theory Solver is provided to you by apps112.com without any warranties, representations or guarantees of any kind, so access it at your own risk.
If you have questions regarding this particular app contact the publisher directly. For questions about the functionalities of apps112.com contact us.
|
| ||||
| Downloads: 10 | ||||
| Updated At: 2024-04-03 18:26:33 | ||||
| Publisher: Shane Mulligan | ||||
| Operating System: Android | ||||
| License Type: Free Trial |