X

Number Theory Algorithms for Android

By ERVIN GEGPRIFTI Free

Developer's Description

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

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 (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

Algorithms:

- 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 2.0.1.0

General

Release January 8, 2020
Date Added January 8, 2020
Version 2.0.1.0

Operating Systems

Operating Systems Android
Additional Requirements Requires Android 4.1 and up

Popularity

Total Downloads 0
Downloads Last Week 0
Report Software

Related Apps

TED

Free
TED

Star Chart

Free
Star Chart

Bible for Kids

Free
Bible for Kids

CES 6.0.0 Answers

Free
CES 6.0.0 Answers

Get the best price on everything

Shop your favorite products and we’ll find the best deal with a single click. Designed to make shopping easier.