Join or Sign In

Sign in to add and modify your software

Continue with email

By joining, you agree to our Terms of Use and acknowledge the data practices in our Privacy Policy.

Number Theory Algorithms for Android


Developer's Description

Created for personal use this application can handle the following operations:


- 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 (performance is based on the device)

- root of a big integer number (performance is based on the device)

- GCD of two big integer numbers

- LCM of two big integer numbers

- modulo of two big integer numbers

- modulo inverse of two big integer numbers

- check a big integer if is probable prime

- next probable prime to a big integer


- 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 Congruence, Solve for x, a congruence of the form ax b (mod m).

- Tonelli-Shanks Algorithm, calculate 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.

Full Specifications

What's new in version


Release January 8, 2020
Date Added January 8, 2020

Operating Systems

Operating Systems Android
Additional Requirements Requires Android 4.1 and up


Total Downloads 0
Downloads Last Week 0
Report Software

Related Apps



Star Chart

Star Chart

Bible for Kids

Bible for Kids

CES 6.0.0 Answers

CES 6.0.0 Answers

Best VPN Services for 2021

Best for privacy

3 months free with 1-year plan

Best for customer support

$39.99 for the first 12 months

Best for zero logs

$4.87.99/months for a 1-year plan

Best money-back guarantee

$2.99/months for a 3-year plan