Number Theory Algorithms3.0.8.0 - Google Play
You'll be able to see results in few seconds.
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 soft112.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 soft112.com contact us.
Publisher Description
Number Theory Algorithms -
Perform Number Theory algorithms & arithmetic operations for very big numbers
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
Module of two big integer numbers
Module Inverse of two big integer numbers
Module Power
Check if a big integer is prime
Euler's phi-function
Factorial
Next prime to a big integer number
Next twin prime pair to a big integer number
Algorithms:
Simple Quadratic Form. Solve for x,y such that 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 that ax + by = gcd(a, b).
Linear Diophantine Equation In Two Variables. Solve for x,y such that 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 modulus. 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.
