About Number Theory Algorithms
Calculator: Add two big integer numbers Subtract two big integer numbers Multiply two big integer numbers Divide two big integer numbers Power of a big integer number Root of a big integer number Greatest Common Div
Calculator:
Add two big integer numbers
Subtract two big integer numbers
Multiply two big integer numbers
Divide two big integer numbers
Power of a big integer number
Root of a big integer number
Greatest Common Divisor (GCD) of two big integer numbers
Lowest Common Multiple (LCM) of two big integer numbers
Modulo of two big integer numbers
Modulo Inverse of two big integer numbers
Check if a big integer is probable prime
Euler's phi-function
Factorial
Next probable prime to a big integer number
Next twin prime pair to a big integer number
Algorithms:
Simple Quadratic Form. Solve for x,y such as bxy+dx+ey=f where b,d,e,f,x,y in Z.
Euclidean Algorithm. Compute the Greatest Common Divisor (GCD) of two numbers a and b.
Extended Euclidean Algorithm. Solve for x, y such as ax + by = gcd(a, b).
Linear Diophantine Equation In Two Variables. Solve for x,y such as ax+by=c.
Linear Congruence In One Variable. Solve for x a congruence of the form ax ≡ b (mod m).
Linear Congruence In Two Variables. Solve for x,y a congruence of the form ax+by ≡ c (mod m).
Tonelli-Shanks Algorithm. Calculate the Quadratic Residue Modulo. Solve for x, a congruence of the form x² ≡ a (mod p) where p is prime.
Mod Factors. Calculate modular possible factors for a given number and a modulo. Find n ≡ bc (mod a) where (ax + c)(ay + b) = a(axy + bx + cy) + bc = n.
Primes List. List of primes ordered in columns.
Note: Performance is based on the device.
Previous Versions
Here you can find the changelog of Number Theory Algorithms since it was posted on our website on 2016-10-13 15:24:02.
The latest version is 3.0.6.1 and it was updated on 2024-04-01 22:59:06. See below the changes in each version.
Number Theory Algorithms version 3.0.6.1
Updated At: 2023-03-31
Changes: Some improvements in Quadratic Form Algorithm.
Number Theory Algorithms version 2.0.1.0
Updated At: 2018-04-13
Changes: Calculator:
Added, is probable prime checker
Added, next probable prime to a number
Algorithms:
Added, Extended Euclidean Algorithm module
Added, Linear Congruence module
Added, Mod factors/Count module
Added, Primes List module
Other changes:
Added, documentation
New UI
Some bug fixes
Minor improvements here & there
Number Theory Algorithms version 2.0
Updated At: 2016-05-30
Disclaimer
Official Google Play Link
We do not host Number Theory Algorithms 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 Algorithms 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.
