This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
First let 1 7 1 7 ≡ y mod x such that 1 7 x ≡ 1 mod 1 0 0 .
Then for some z we have 1 7 1 7 = y + x z .
Then 1 7 1 7 1 7 ≡ 1 7 y + x z ≡ 1 7 y × 1 7 x z ≡ 1 7 y mod 1 0 0 .
We have 1 7 x = 1 + 1 0 0 k for some k .
We have unit digit R.H.S of above equation as 1 and L.H.S can have unit digit as 1 only if x = 4 a for some a .
So 1 7 4 a ≡ 2 1 a ≡ 1 mod 1 0 0 .
We can easily see a = 5 is smallest positive solution which give x = 2 0 .
So 1 7 1 7 ≡ y mod 2 0 ⇒ y = 1 7 .
Finally 1 7 1 7 1 7 ≡ 1 7 y ≡ 1 7 1 7 ≡ 7 7 mod 1 0 0 .
I was just thinking about these towers and solution like this came up.I know there is solution from eulers theorem but still posted this.
We apply Euler's theorem here. 17 and 100 are coprime, so we find phi(100)=40. 17^40=1(mod100) Now we need to find the remainder of 17^17 when divided by 40. By euler's theorem again, phi(40)=16, implies 17^16=1(mod40) 17^17=17(mod40) so 17^(17^17)=17^17(mod100) which can be easily found to be 77.
By means of the Little Fermat Theorem 1 7 4 0 ≡ 1 ( m o d 1 0 0 ) thus we have to calculate 1 7 1 7 ( m o d 4 0 ) , using the same thorem we have that 1 7 1 6 ≡ 1 ( m o d 4 0 ) → 1 7 1 7 ≡ 1 7 1 = 1 ( m o d 4 0 ) then it's easier to calculate 1 7 1 7 ( m o d 1 0 0 ) 1 7 1 7 = 1 7 ∗ 1 7 2 ∗ 8 = 1 7 ∗ 2 8 9 8 ≡ 1 7 ∗ 8 9 8 ( m o d 1 0 0 ) = 1 7 ∗ 8 9 2 ∗ 4 = 1 7 ∗ 7 9 2 1 4 ≡ 1 7 ∗ 2 1 4 ( m o d 1 0 0 ) = 3 3 0 6 1 7 7 ≡ 7 7 ( m o d 1 0 0 )
∣ 1 7 1 = 1 7 ∣ ∣ 1 7 2 = . . 8 9 ∣ ∣ 1 7 3 = . . 1 3 ∣ ∣ 1 7 4 = . . 2 1 ∣ ∣ 1 7 5 = 5 7 ∣ ∣ 1 7 6 = . . 6 9 ∣ ∣ 1 7 7 = . . 7 3 ∣ ∣ 1 7 8 = . . 4 1 ∣ ∣ 1 7 9 = 9 7 ∣ ∣ 1 7 1 0 = . . 4 9 ∣ ∣ 1 7 1 1 = . . 3 3 ∣ ∣ 1 7 1 2 = . . 6 1 ∣ ∣ 1 7 1 3 = 3 7 ∣ ∣ 1 7 1 4 = . . 2 9 ∣ ∣ 1 7 1 5 = . . 9 3 ∣ ∣ 1 7 1 6 = . . 8 1 ∣ ∣ 1 7 1 7 = 7 7 ∣ ∣ 1 7 1 8 = . . 0 9 ∣ ∣ 1 7 1 9 = . . 5 3 ∣ ∣ 1 7 2 0 = . . 0 1 ∣ ∴ 1 7 1 7 1 7 = 1 7 7 7 ≡ 1 7 m o d 2 0 = 1 7 1 7 = 7 7
Note:- On a simple scientific calculator, only the following is sufficient.
∣
1
7
1
=
1
7
∣
∣
1
7
2
=
.
.
8
9
∣
∣
1
7
3
=
.
.
1
3
∣
∣
1
7
4
=
.
.
2
1
∣
∣
1
7
5
=
5
7
∣
∣
1
7
8
=
.
.
4
1
∣
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
∣
1
7
1
7
=
7
7
∣
∣
1
7
2
0
=
.
.
0
1
∣
Reason.:-
1] Unit cycle has a period of 4.
2] First column unit is 7.
Tenth
digit in first column increase by 4.
.........(a) So after adding 17-1=16, we will have 17 as exponent. This is 5th row, first column.
.........(b)This would be in row 5 column 1. So the tenth digit is = 1+(4-1)=1+(4 increment of 4) =17. Unit digit of the Tenth digit is 7, So last two digit, 77. That is to say (17^{17}=.....77
3]In the cycle, only if last two digits are 01, the next row same column would give use the initial last to digits.
Unit 1 appear in the fourth column.
Its increment in tenth digit is 2. So in four
more
columns , {2+(4
2)}=10, there is zero at the end for tenth digit.
So the the cycle of tenth digit is, 4+4
4=20.
The above would be helpful if the exponents are big. The rules given above are derived from the 4X5 table given above.
The method can solve TOWER problem with the help only of a simple scientific calculator and no knowledge of Theory of Numbers.
Same way I did it :)
Can someone please explain how they got that 17^17 is congruent to 77 (mod 100)?
Did the same (+1)
Did the Exact same !!
The last digit repeats with period 4, it is 1 for powers 4k, 7 for 4k+1 etc.
Looking for 01 to find the period for the last 2 digits; it will have to be one of those ending with 1 so 4k-th power. k=1: 21, k=2: 21*21 ends with 41; then 61, 81 and with k=5 we get 01 so the period is 20.
Now we need to 17^17 mod 20. 17^16 ends with 81, so 17^17 ends with 77. Therefore the answer is 17 : 17^17 = 20k + 17 .
17^17^17 = 17 ^ (20k + 17); because of the cycle with perod 20 the last two digits are the same as of 17^17, so 77.
For similar problems, check Towers of Powers of 17 or Time for 7
I tried Euler - Fermat and then repeated squaring method:
a. Euler - Fermat:
Since g c f ( 1 7 , 1 0 0 ) = 1 and 1 7 1 7 ≡ 1 7 m o d φ ( 1 0 0 ) , then 1 7 1 7 1 7 ≡ 1 7 1 7 m o d 1 0 0 .
b. Repeated squaring method:
1 7 1 7 ≡ 1 7 ( 1 7 1 6 m o d 1 0 0 )
1 7 1 7 ≡ 1 7 ( 1 7 2 m o d 1 0 0 ) 8
1 7 1 7 ≡ 1 7 ( 8 9 2 m o d 1 0 0 ) 4
1 7 1 7 ≡ 1 7 ( 2 1 2 m o d 1 0 0 ) 2
1 7 1 7 ≡ 1 7 ( 4 1 2 m o d 1 0 0 )
1 7 1 7 ≡ 1 7 ( 8 1 m o d 1 0 0 )
1 7 1 7 ≡ 7 7
Problem Loading...
Note Loading...
Set Loading...
Studying 1 7 1 7 1 7 ( m o d 2 5 ) , we can work mod ϕ ( 2 5 ) = 2 0 in the first exponent and mod ϕ ( 2 0 ) = 8 in the top exponent. Thus 1 7 1 7 1 7 ≡ 1 7 1 7 ≡ 1 7 − 3 ≡ ( 1 7 − 1 ) 3 ≡ 3 3 ≡ 2 ( m o d 2 5 ) . Clearly, 1 7 1 7 1 7 ≡ 1 ( m o d 4 ) . Examining 2, 27, 52, and 77, we find that 1 7 1 7 1 7 ≡ 7 7 ( m o d 1 0 0 )