Both 2^8633 mod 8633

Solve 2⁸⁶³³ mod 8633 using:

Modular exponentiation

Build an algorithm:

n is our exponent = 8633

y = 1 and u ≡ 2 mod 8633 = 2

See here

n = 8633 is odd

Since 8633 is odd, calculate (y)(u) mod p

(y)(u) mod p = (1)(2) mod 8633

(y)(u) mod p = 2 mod 8633

2 mod 8633 = 2
Reset y to this value

Determine u² mod p

u² mod p = 2² mod 8633

u² mod p = 4 mod 8633

4 mod 8633 = 4
Reset u to this value

Cut n in half and take the integer

8633 ÷ 2 = 4316

n = 4316 is even

Since 4316 is even, we keep y = 2

Determine u² mod p

u² mod p = 4² mod 8633

u² mod p = 16 mod 8633

16 mod 8633 = 16
Reset u to this value

Cut n in half and take the integer

4316 ÷ 2 = 2158

n = 2158 is even

Since 2158 is even, we keep y = 2

Determine u² mod p

u² mod p = 16² mod 8633

u² mod p = 256 mod 8633

256 mod 8633 = 256
Reset u to this value

Cut n in half and take the integer

2158 ÷ 2 = 1079

n = 1079 is odd

Since 1079 is odd, calculate (y)(u) mod p

(y)(u) mod p = (2)(256) mod 8633

(y)(u) mod p = 512 mod 8633

512 mod 8633 = 512
Reset y to this value

Determine u² mod p

u² mod p = 256² mod 8633

u² mod p = 65536 mod 8633

65536 mod 8633 = 5105
Reset u to this value

Cut n in half and take the integer

1079 ÷ 2 = 539

n = 539 is odd

Since 539 is odd, calculate (y)(u) mod p

(y)(u) mod p = (512)(5105) mod 8633

(y)(u) mod p = 2613760 mod 8633

2613760 mod 8633 = 6594
Reset y to this value

Determine u² mod p

u² mod p = 5105² mod 8633

u² mod p = 26061025 mod 8633

26061025 mod 8633 = 6631
Reset u to this value

Cut n in half and take the integer

539 ÷ 2 = 269

n = 269 is odd

Since 269 is odd, calculate (y)(u) mod p

(y)(u) mod p = (6594)(6631) mod 8633

(y)(u) mod p = 43724814 mod 8633

43724814 mod 8633 = 7302
Reset y to this value

Determine u² mod p

u² mod p = 6631² mod 8633

u² mod p = 43970161 mod 8633

43970161 mod 8633 = 2292
Reset u to this value

Cut n in half and take the integer

269 ÷ 2 = 134

n = 134 is even

Since 134 is even, we keep y = 7302

Determine u² mod p

u² mod p = 2292² mod 8633

u² mod p = 5253264 mod 8633

5253264 mod 8633 = 4400
Reset u to this value

Cut n in half and take the integer

134 ÷ 2 = 67

n = 67 is odd

Since 67 is odd, calculate (y)(u) mod p

(y)(u) mod p = (7302)(4400) mod 8633

(y)(u) mod p = 32128800 mod 8633

32128800 mod 8633 = 5407
Reset y to this value

Determine u² mod p

u² mod p = 4400² mod 8633

u² mod p = 19360000 mod 8633

19360000 mod 8633 = 4814
Reset u to this value

Cut n in half and take the integer

67 ÷ 2 = 33

n = 33 is odd

Since 33 is odd, calculate (y)(u) mod p

(y)(u) mod p = (5407)(4814) mod 8633

(y)(u) mod p = 26029298 mod 8633

26029298 mod 8633 = 803
Reset y to this value

Determine u² mod p

u² mod p = 4814² mod 8633

u² mod p = 23174596 mod 8633

23174596 mod 8633 = 3624
Reset u to this value

Cut n in half and take the integer

33 ÷ 2 = 16

n = 16 is even

Since 16 is even, we keep y = 803

Determine u² mod p

u² mod p = 3624² mod 8633

u² mod p = 13133376 mod 8633

13133376 mod 8633 = 2583
Reset u to this value

Cut n in half and take the integer

16 ÷ 2 = 8

n = 8 is even

Since 8 is even, we keep y = 803

Determine u² mod p

u² mod p = 2583² mod 8633

u² mod p = 6671889 mod 8633

6671889 mod 8633 = 7213
Reset u to this value

Cut n in half and take the integer

8 ÷ 2 = 4

n = 4 is even

Since 4 is even, we keep y = 803

Determine u² mod p

u² mod p = 7213² mod 8633

u² mod p = 52027369 mod 8633

52027369 mod 8633 = 4911
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 = 803

Determine u² mod p

u² mod p = 4911² mod 8633

u² mod p = 24117921 mod 8633

24117921 mod 8633 = 5952
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 = (803)(5952) mod 8633

(y)(u) mod p = 4779456 mod 8633

4779456 mod 8633 = 5407
Reset y to this value

Determine u² mod p

u² mod p = 5952² mod 8633

u² mod p = 35426304 mod 8633

35426304 mod 8633 = 5105
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

2⁸⁶³³ mod 8633 ≡ 5407

Solve 2⁸⁶³³ mod 8633 using:

the Successive Squaring Method

Step 1: Convert our power of 0 to binary notation:

Using our binary calculator, we see that 0 in binary form is

The length of this binary term is 0, so this is how many steps we will take for our algorithm below

Step 2: Construct Successive Squaring Algorithm:

i	a	a²	a² mod p

Step 3: Review red entries

Look at the binary term with values of 1 in red

This signifies which terms we use for expansion:

= 1 mod 8633 = 1

Final Answer

2⁸⁶³³ mod 8633 ≡ 5407
= 1 mod 8633 = 1

What is the Answer?

2⁸⁶³³ mod 8633 ≡ 5407
= 1 mod 8633 = 1

How does the Modular Exponentiation and Successive Squaring Calculator work?

Free Modular Exponentiation and Successive Squaring Calculator - Solves xⁿ 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 a² mod p

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

Both 2^8633 mod 8633

Build an algorithm:

n = 8633 is odd

Determine u2 mod p

Cut n in half and take the integer

n = 4316 is even

Determine u2 mod p

Cut n in half and take the integer

n = 2158 is even

Determine u2 mod p

Cut n in half and take the integer

n = 1079 is odd

Determine u2 mod p

Cut n in half and take the integer

n = 539 is odd

Determine u2 mod p

Cut n in half and take the integer

n = 269 is odd

Determine u2 mod p

Cut n in half and take the integer

n = 134 is even

Determine u2 mod p

Cut n in half and take the integer

n = 67 is odd

Determine u2 mod p

Cut n in half and take the integer

n = 33 is odd

Determine u2 mod p

Cut n in half and take the integer

n = 16 is even

Determine u2 mod p

Cut n in half and take the integer

n = 8 is even

Determine u2 mod p

Cut n in half and take the integer

n = 4 is even

Determine u2 mod p

Cut n in half and take the integer

n = 2 is even

Determine u2 mod p

Cut n in half and take the integer

n = 1 is odd

Determine u2 mod p

Cut n in half and take the integer

Because n = 0, we stop

Step 1: Convert our power of 0 to binary notation:

Step 2: Construct Successive Squaring Algorithm:

Step 3: Review red entries

Final Answer

What is the Answer?

How does the Modular Exponentiation and Successive Squaring Calculator work?

What 1 formula is used for the Modular Exponentiation and Successive Squaring Calculator?

What 6 concepts are covered in the Modular Exponentiation and Successive Squaring Calculator?

Example calculations for the Modular Exponentiation and Successive Squaring Calculator

Tags:

Our Services

Top Categories

Community

Determine u² mod p

Determine u² mod p

Determine u² mod p

Determine u² mod p

Determine u² mod p

Determine u² mod p

Determine u² mod p

Determine u² mod p

Determine u² mod p

Determine u² mod p

Determine u² mod p

Determine u² mod p

Determine u² mod p

Determine u² mod p