Enter Modular Exponentiation
Solve 39 mod 17 using:
Modular exponentiation
Build an algorithm:
n is our exponent = 9
y = 1 and u ≡ 3 mod 17 = 3
See here
n = 9 is odd
Since 9 is odd, calculate (y)(u) mod p
(y)(u) mod p = (1)(3) mod 17
(y)(u) mod p = 3 mod 17
3 mod 17 = 3
Reset y to this value
Determine u2 mod p
u2 mod p = 32 mod 17
u2 mod p = 9 mod 17
9 mod 17 = 9
Reset u to this value
Cut n in half and take the integer
9 ÷ 2 = 4
n = 4 is even
Since 4 is even, we keep y = 3
Determine u2 mod p
u2 mod p = 92 mod 17
u2 mod p = 81 mod 17
81 mod 17 = 13
Reset u to this value
Cut n in half and take the integer
4 ÷ 2 = 2
n = 2 is even
Since 2 is even, we keep y = 3
Determine u2 mod p
u2 mod p = 132 mod 17
u2 mod p = 169 mod 17
169 mod 17 = 16
Reset u to this value
Cut n in half and take the integer
2 ÷ 2 = 1
n = 1 is odd
Since 1 is odd, calculate (y)(u) mod p
(y)(u) mod p = (3)(16) mod 17
(y)(u) mod p = 48 mod 17
48 mod 17 = 14
Reset y to this value
Determine u2 mod p
u2 mod p = 162 mod 17
u2 mod p = 256 mod 17
256 mod 17 = 1
Reset 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
39 mod 17 ≡ 14
You have 1 free calculations remaining
What is the Answer?
39 mod 17 ≡ 14
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 Squaring
This 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 pFor more math formulas, check out our Formula Dossier
What 6 concepts are covered in the Modular Exponentiation and Successive Squaring Calculator?
exponentThe power to raise a numberintegera whole number; a number that is not a fraction...,-5,-4,-3,-2,-1,0,1,2,3,4,5,...modular exponentiationthe remainder when an integer b (the base) is raised to the power e (the exponent), and divided by a positive integer m (the modulus)modulusthe remainder of a division, after one number is divided by another.
a mod bremainderThe portion of a division operation leftover after dividing two integerssuccessive squaringan algorithm to compute in a finite field
Example calculations for the Modular Exponentiation and Successive Squaring Calculator
Modular Exponentiation and Successive Squaring Calculator Video
Tags:
Add This Calculator To Your Website
ncG1vNJzZmivp6x7rq3ToZqepJWXv6rA2GeaqKVforylsdepZamgoHS7trmcbFxufWmivKV9ll%2BnpXV9pLG2uMCrYn6woKS7prrTopitoZ%2Bj