Table of Contents
Enter Modular Exponentiation
Solve 51 mod 23 using:
Modular exponentiation
Build an algorithm:
n is our exponent = 1
y = 1 and u ≡ 5 mod 23 = 5
See here
n = 1 is odd
Since 1 is odd, calculate (y)(u) mod p
(y)(u) mod p = (1)(5) mod 23
(y)(u) mod p = 5 mod 23
5 mod 23 = 5Reset y to this value
Determine u2 mod p
u2 mod p = 52 mod 23
u2 mod p = 25 mod 23
25 mod 23 = 2Reset u to this value
Cut n in half and take the integer
1 ÷ 2 = 0
Because n = 0, we stop
We have our answer
Final Answer
51 mod 23 ≡ 5
You have 1 free calculations remaining
What is the Answer?
51 mod 23 ≡ 5
How does the Modular Exponentiation and Successive Squaring Calculator work?
Free Modular Exponentiation and Successive Squaring Calculator - Solves xn mod p using the following methods: * Modular Exponentiation * Successive SquaringThis calculator has 1 input.
What 1 formula is used for the Modular Exponentiation and Successive Squaring Calculator?
Successive Squaring I = number of digits in binary form of n. Run this many loops of a2 mod p
For more math formulas, check out our Formula Dossier
What 6 concepts are covered in the Modular Exponentiation and Successive Squaring Calculator?
- exponent
- The power to raise a number
- integer
- a whole number; a number that is not a fraction...,-5,-4,-3,-2,-1,0,1,2,3,4,5,...
- modular exponentiation
- the remainder when an integer b (the base) is raised to the power e (the exponent), and divided by a positive integer m (the modulus)
- modulus
- the remainder of a division, after one number is divided by another.a mod b
- remainder
- The portion of a division operation leftover after dividing two integers
- successive squaring
- an algorithm to compute in a finite field
