Modular Root Calculator

A modular root calculator helps you find all integers x that satisfy the equation x^k ≡ a (mod n), where k is a positive integer. This tool is essential for number theory, cryptography, and computer science applications.

What is a Modular Root?

A modular root is a solution to the congruence equation x^k ≡ a (mod n). In simpler terms, it's a number x such that when raised to the power k, it leaves a remainder of a when divided by n.

Modular roots are fundamental in number theory and have applications in cryptography, particularly in the RSA algorithm. They help determine if a number has roots modulo n and how many distinct roots exist.

Key Formula

x^k ≡ a (mod n)

Where:

x = the modular root we're solving for
k = exponent (positive integer)
a = remainder
n = modulus (positive integer)

Important Notes

Not all numbers have modular roots for every modulus and exponent
The number of distinct roots depends on the greatest common divisor (GCD) of k and φ(n)
For prime moduli, solutions always exist when a ≡ 0 (mod n)

How to Find Modular Roots

Finding modular roots involves several steps depending on the values of k, a, and n. Here's a general approach:

First, check if a solution exists by verifying that gcd(a, n) divides n
If solutions exist, determine the number of distinct roots using Euler's theorem
For small values of n, you can check all possible values of x from 0 to n-1
For larger n, use advanced algorithms like the Tonelli-Shanks algorithm for specific cases

Step-by-Step Example

Let's find all x such that x² ≡ 5 (mod 11):

Check if solutions exist: gcd(5, 11) = 1, which divides 11 - solutions exist
Calculate φ(11) = 10 (since 11 is prime)
Number of distinct roots = gcd(2, 10) = 2
Check possible values: 4² = 16 ≡ 5 (mod 11) and 7² = 49 ≡ 5 (mod 11)

Thus, the modular roots are 4 and 7.

Examples

Equation	Modular Roots	Explanation
x² ≡ 1 (mod 5)	1, 4	Two distinct roots exist
x³ ≡ 2 (mod 7)	2, 4, 6	Three distinct roots exist
x⁴ ≡ 3 (mod 13)	None	No solutions exist for this equation

These examples demonstrate how the number of solutions varies based on the equation parameters.

FAQ

What is the difference between modular roots and regular roots?

Regular roots solve equations like x^k = a, while modular roots solve x^k ≡ a (mod n). The latter considers remainders when divided by n, which is crucial in number theory and cryptography.

How do I know if a modular root exists for my equation?

A solution exists if gcd(a, n) divides n. If this condition isn't met, there are no solutions to the equation.

Can I find modular roots for any exponent k?

Yes, but the number of solutions depends on the greatest common divisor of k and φ(n). For prime moduli, solutions always exist when a ≡ 0 (mod n).