What is the final digit of 7 7 7 7 7 7 7 ?
This is a tower of seven 7's.
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.
great explanation! thank u
Let 7(n) be a tower of n 7's. Examine the powers of 7 under modulo 4:
7 = 7;
7^2 = 49 = 1.
So 7^a = 7 and 7^b = 7 for odd a and even b. Since 7(5) is odd, so 7(6) = 7^(7(5)) = 7 (mod 4). Examine the power of 7 under modulo 10:
7 = 7;
7^2 = 9;
7^3 = 3;
7^4 = 1.
Therefore 7(7) = 7^(7(6)) = 7^7 = 7^3 = 3 (mod 10). The final digit is 3.
The answer seems to be wrong. It should be 7 . My argument is as follows. Let's check the first n 7 , where 1 ≤ n ≤ 3 0 is an integers . They are as follows:
1 7 = 1
2 7 = 1 2 8
3 7 = 2 1 8 7
4 7 = 1 6 3 8 4
5 7 = 7 8 1 2 5
6 7 = 2 7 9 9 3 6
7 7 = 8 2 3 5 4 3
8 7 = 2 0 9 7 1 5 2
9 7 = 4 7 8 2 9 6 9
1 0 7 = 1 0 0 0 0 0 0 0
1 1 7 = 1 9 4 8 7 1 7 1
1 2 7 = 3 5 8 3 1 8 0 8
1 3 7 = 6 2 7 4 8 5 1 7
1 4 7 = 1 0 5 4 1 3 5 0 4
1 5 7 = 1 7 0 8 5 9 3 7 5
1 6 7 = 2 6 8 4 3 5 4 5 6
1 7 7 = 4 1 0 3 3 8 6 7 3
1 8 7 = 6 1 2 2 2 0 0 3 2
1 9 7 = 8 9 3 8 7 1 7 3 9
2 0 7 = 1 2 8 0 0 0 0 0 0 0
2 1 7 = 1 8 0 1 0 8 8 5 4 1
2 2 7 = 2 4 9 4 3 5 7 8 8 8
2 3 7 = 3 4 0 4 8 2 5 4 4 7
2 4 7 = 4 5 8 6 4 7 1 4 2 4
2 5 7 = 6 1 0 3 5 1 5 6 2 5
2 6 7 = 8 0 3 1 8 1 0 1 7 6
2 7 7 = 1 0 4 6 0 3 5 3 2 0 3
2 8 7 = 1 3 4 9 2 9 2 8 5 1 2
2 9 7 = 1 7 2 4 9 8 7 6 3 0 9
3 0 7 = 2 1 8 7 0 0 0 0 0 0 0
It can be seen that the last digit if n 7 depends only the last digit of n . They are in a sequence of 1 , 8 , 7 , 4 , 5 , 6 , 3 , 2 , 9 , 0 . Therefore,
7 7 ≡ 3 m o d 1 0
( 7 7 ) 7 ≡ 7 m o d 1 0
( ( 7 7 ) 7 ) 7 ≡ 3 m o d 1 0
( ( ( 7 7 ) 7 ) 7 ) 7 ≡ 7 m o d 1 0
( ( ( ( 7 7 ) 7 ) 7 ) 7 ) 7 ≡ 3 m o d 1 0
( ( ( ( ( 7 7 ) 7 ) 7 ) 7 ) 7 ) 7 ≡ 7 m o d 1 0
The answer should be 7 and not 3 . I guessed the 'wrong' answer.
i agree with you. i also wrote 7 first but according to brilliant it was not correct so i changed it to 3 in next trial.
I believe the answer is 3
I have complained to Brilliant.org. They should be checking it now. Just wait for the answer.
Note that a b c = a ( b c ) by convention. You work from the highest point down, not the lowest point up.
Log in to reply
I thought a b c = a b × c instead of a ( b c ) . Am I wrong?
My reasoning is exactly the same as yours, Mr. Cheong.
very Simple Solution.. Came from me... XD
The answer is 3:
7^7^7^7^7^7^7
Evaluate: 7^7 = 823543
Since the cycle is always: 7^1 = 7 7^2 = 9 (last digit of 49) 7^3 = 3 7^4 = 1
Divide 823543 to 4, youll get: 205885 remainder 3
So, it's last digit is on 3..
7^7^7^7^7^823543
Since 7^823543 ends in 3
7^7^7^7^(...3) , where in, (...3) is equivalent to the value of 7^823543
Again, 3 is the last digit of 7^(...3)
So, until to the last 7, the last digit is 3..
There fore, the last digit of 7^7^7^7^7^7^7 is 3...
Thanks to Calvin Lin! I can correct my explanation.
The last digit of N = (7 ↑↑ 7) is: LD(7 ↑↑ 7) = 3.
Proof:
7^(7^(7^(7^(7^(7^7))))) = 7 ↑↑ 7; (tetration of "7" "7's")
7^0 => LD(7^0) = 1 = LD(7^(4n); => 7^(4n) ≡ 1 mod 10;
7^1 => LD(7^1) = 7 = LD(7^(4n + 1)); => 7^(4n + 1) ≡ 7 mod 10;
7^2 => LD(7^2) = 9; LD(7^(4n + 2)); => 7^(4n + 2) ≡ 9 mod 10;
7^3 => LD(7^3) = 3 = LD(7^(4n + 3)); => 7^(4n + 3) ≡ 3 mod 10;
there is a periodicity with period c = 4, n ∈ ℕ ∪ {0};
Since, because:
LD(7 ↑↑7) = 7 ↑↑ 7 mod 10, with period c = 4;
7 ≡ 3 mod 4; but also:
7 ≡ -1 mod 4;
so, because:
4k - 1 = 4(k - 1) + 3, is odd, we have:
7^(4(k - 1)+ 3) ≡ (- 1)^(4(k - 1)+ 3) mod 4,
7^(4(k - 1) + 3) ≡ - 1 mod 4,
so:
7^(4(k - 1) + 3) = 4N + 3;
so, LD(7^(4(k - 1) + 3) = 3, and so:
(7 ↑↑ 2) = 7^7 = 7^(4N2 + 3) = (4N3 + 3); N2 = 1
(7 ↑↑ 3) = 7^(4N3 + 3) = (4N3 + 3); N3 = 205885;
(7 ↑↑ 4) = 7^(4N4 + 3) = (4N5 + 3) N4 = ((7 ↑↑ 3) - 3)/4
(7 ↑↑ 5) = 7^(4N5 + 3) = ...
(7 ↑↑ 6) = 7^(4N6 + 3) = ...
(7 ↑↑ 7) = 7^(4N7 + 3) = ...
(7 ↑↑ n) = 7^(4Nn + 3) = ...
k, n ∈ ℕ - {1}; N, Nk ∈ ℕ;
so, ANSWER:
LD(7 ↑↑ 7) = 3,
and: LD(7 ↑↑ n) = 3
You misinterpreted the tower of exponents.
It is not multiplication, which gives 7 × 7 × 7 … × 7 = 7 7 = 8 2 3 5 4 3 .
the final digit of tower of seven 7's should be 7 not 3... zzzz
Problem Loading...
Note Loading...
Set Loading...
Looking at small powers of 7 , notice that we only care about the last digit, so we can easily compute the last digit of 7 n :
7 1 7 2 7 3 7 4 7 5 7 6 7 7 7 8 ≡ 7 ≡ 7 ⋅ 7 ≡ 9 ≡ 7 ⋅ 9 ≡ 3 ≡ 7 ⋅ 3 ≡ 1 ≡ 7 ⋅ 1 ≡ 7 ≡ 7 ⋅ 7 ≡ 9 ≡ 7 ⋅ 9 ≡ 3 ≡ 7 ⋅ 3 ≡ 1
This suggests the pattern that 7 4 k ≡ 1 , 7 4 k + 1 ≡ 7 , 7 4 k + 2 ≡ 9 , and 7 4 k + 3 ≡ 3 . Using modular arithmetic (thank you Calvin Lin), we get 7 7 7 7 7 7 = 4 k + 3 , so the answer is 3 .