Successive Squaring 2^100 mod 17
Robert Spencer
Published Aug 13, 2026
Crop Image

Enter Modular Exponentiation
Solve 2100 mod 17 using:
the Successive Squaring Method
Step 1: Convert our power of 100 to binary notation:
Using our binary calculator, we see that 100 in binary form is 1100100
The length of this binary term is 7, so this is how many steps we will take for our algorithm below
Step 2: Construct Successive Squaring Algorithm:
| i | a | a2 | a2 mod p |
|---|---|---|---|
| 0 | 2 | 2 | 2 mod 17 = 2 |
| 1 | 2 | 4 | 4 mod 17 = 4 |
| 2 | 4 | 16 | 16 mod 17 = 16 |
| 3 | 16 | 256 | 256 mod 17 = 1 |
| 4 | 1 | 1 | 1 mod 17 = 1 |
| 5 | 1 | 1 | 1 mod 17 = 1 |
| 6 | 1 | 1 | 1 mod 17 = 1 |