Contains ads

3.9*star*

119 reviews

10K+

Downloads

Everyone*info*

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.

Updated on

Safety starts with understanding how developers collect and share your data. Data privacy and security practices may vary based on your use, region, and age. The developer provided this information and may update it over time.

This app may share these data types with third parties

Location, App activity and 2 others

No data collected

Learn more about how developers declare collection

Data is encrypted in transit

Data can’t be deleted

3.9

112 reviews

A Google user

- Flag inappropriate

February 24, 2019

Overall, a good app for primality and mod calculations. Would be nice to have an option to disable the tactile vibration, which is a bit annoying as it's there on pressing any button.

7 people found this review helpful

ERVIN GEGPRIFTI

March 9, 2023

Thank you for your kind feedback. As of (3.0.4.5) the vibration on clipboard buttons is disabled by default. Please use the app Settings to see more options fitting your preferences.

SOURASHIS MONDAL

- Flag inappropriate

June 13, 2020

Very good app for college students to solve number theoretical problems.... With having a look at the method to solve that

6 people found this review helpful

ERVIN GEGPRIFTI

March 9, 2023

Thank you for your kind feedback. Please check the (3.0.4.5) version, for more new algorithms and UI improvements.

Tanmay Tyagi