Number Theory Algorithms
Perform Number Theory algorithms & arithmetic operations for very big numbers
ERVIN GEGPRIFTI · com.gegprifti.android.numbertheoryalgorithms
UpdatedAug 21, 2024
PublishedDec 25, 2022
Packagecom.gegprifti.android.numbertheoryalgorithms
MD5ad7b23c8aec9ada56b6a99ec951bbe24
SHA1 (signer)93:23:8B:B4:53:96:CA:76:36:5E:56:82:4F:1E:09:0C:CD:34:21:52
Signed byCN=Ervin Gegprifti, OU=Number Theory, O=Gegprifti, L=Tirana, ST=Albania, C=AL
Architecturesx86, x86-64, armeabi-v7a, arm64-v8a
Malware scanTRUSTED
Contact[email protected]
Privacy policyView
What's new
Update to the latest target SDK version.
Description
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.
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.
Required features
- Faketouch android.hardware.faketouch
Permissions (9)
Number Theory Algorithms requests the following Android permissions:
- Access Network State android.permission.ACCESS_NETWORK_STATE
- Foreground Service android.permission.FOREGROUND_SERVICE
- Internet android.permission.INTERNET
- Read External Storage android.permission.READ_EXTERNAL_STORAGE
- Vibrate android.permission.VIBRATE
- Wake Lock android.permission.WAKE_LOCK
- Com Gegprifti Android Numbertheoryalgorithms Dynamic Receiver Not Exported Permission com.gegprifti.android.numbertheoryalgorithms.DYNAMIC_RECEIVER_NOT_EXPORTED_PERMISSION
- Finsky Permission Bind Get Install Referrer Service com.google.android.finsky.permission.BIND_GET_INSTALL_REFERRER_SERVICE
- Gms Permission Ad Id com.google.android.gms.permission.AD_ID
