Sequential last digits?

The last digit of 2 is 2.

The last digit of 2 2 2^2 is 2 + 2 2+2 .

The last digit of 2 2 2 2^{2^2} is 2 + 2 + 2 2+2+2 .

The last digit of 2 2 2 2 2^{2^{2^2}} is _________ . \text{\_\_\_\_\_\_\_\_\_} .

2 2 2 + 2 2 + 2 2 + 2 + 2 2 + 2 + 2 2 + 2 + 2 + 2 2 + 2 + 2 + 2

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.

5 solutions

N S
Apr 23, 2017

The problem simplifies to 2^16. Without having to calculate that out fully, one can notice a pattern as we go up in powers of 2: 2, 4, 8, 16, 32, 64, 128, 256. The last digit of each power of two cycles as: 2, 4, 8, 6. Every fourth power (2^4, 2^8, 2^12, 2^16) ends with the digit 6. Therefore, 2^16, which is one of the fourth powers of 2, will also end in 6, or 2+2+2.

Moderator note:

You observed that 2 4 n 2^{4n} ends with the digit 6 for all positive integers n . n. There's a straightforward argument hidden here: why is that the case?

2^(4*n) = (2^4)^n

2^4 = 16 and any number ending in 6 to any integer power > 0 will also end in 6.

Geoffrey Wilkinson - 4 years, 1 month ago

Nice! So elegant too.

Dina Yehia - 4 years, 1 month ago

Also if the last number was not 6, digit sum wouldn't be 4 n + 2 (n-1) + 3

Jan Danek - 4 years, 1 month ago

I almost expected the pattern to continue and the answer to be 2 + 2 + 2 + 2 2 + 2 + 2 + 2 ...

Pranshu Gaba - 4 years, 1 month ago
Fidel Simanjuntak
Apr 11, 2017

2 2 2 2 = 2 2 4 = 2 16 = 65536 \begin{aligned} 2^{2^{2^{2}}} & = 2^{2^{4}} \\ & = 2^{16} = 65536 \end{aligned}

Hence, the last digit is 6 = 2 + 2 + 2 6 = 2+2+2 .

It was 2, so you could easily do it, How will you do 9 9 9 9 9 9^{9^{9^{9^{9}}}} ?

Md Zuhair - 4 years, 2 months ago

Log in to reply

That is actually very simple because I'm assuming you mean what is the units digit of 9^9^9^9^9.The pattern for powers of 9 is 9,1,9,1,9,1... so every odd power, like 3 will have a units digit of 9, 9^3=729, and every even power,like 4 will have a units digit of 1, 9^4=6561, and we know that the exponent is just A LOT of 9's multiplied, and since 9=1mod 2, the exponent is equal to 1 1 1*1...mod 2 which is just 1 mod 2,so the units digit of 9^9^9^9^9 is 9.

Razzi Masroor - 4 years, 1 month ago

Hmm, I am still thinking of it.. Maybe, it's about modular arithmetic.. I'm not that good to solve this kind of problem with modular arithmetic.. I'm not good at number theory.. Hehehee

Fidel Simanjuntak - 4 years, 2 months ago

Log in to reply

Same here. I am also finding for the solutions of such problems, thats why i asked it. How you did the problem here , i did it with modular arithmetic, but i simplified till 2 16 2^{16} then did it. Thats where the problem is. How to do it without solving till 2 16 2^{16} . :)

Md Zuhair - 4 years, 2 months ago

Log in to reply

@Md Zuhair I don't know how to apply modular arithmetic in much number theory problem.. Lot to learn..

Fidel Simanjuntak - 4 years, 2 months ago

Log in to reply

@Fidel Simanjuntak You are still young. You will learn brother. Dont worry

Md Zuhair - 4 years, 2 months ago

Log in to reply

@Md Zuhair I know.. But I'm curious about modular arithmetic so bad..

Fidel Simanjuntak - 4 years, 2 months ago

Log in to reply

@Fidel Simanjuntak Okay, If you are too curious , learn it from Youtube. I learnt it from there for RMO(Regional Maths Olympiad)

Md Zuhair - 4 years, 2 months ago

Log in to reply

@Md Zuhair Thanks! Such a good suggestion..

Fidel Simanjuntak - 4 years, 2 months ago

In this instance, you are trying to solve 9 9 9 9 9 x m o d 10 9^{9^{9^{9^9}}} \equiv x \mod 10 for 0 x 9 0 \leq x \leq 9 . So you would look at the residues modulo 10 of successive powers of 9, and the period with which they repeat. In this instance, the period is 2, so you would solve 9 9 9 9 y m o d 2 9^{9^{9^9}} \equiv y \mod 2 . This would tell you the position in the cycle of residues modulo 10. In cases where the new congruence isn't one you can solve straight away, you would just apply the same principle iteratively.

Stewart Gordon - 4 years, 1 month ago
Tom Verhoeff
Apr 28, 2017

Let's solve the more general problem: what is the last digit of any stack of powers of 2, with three or more 2's?

Observe the following table:

\begin{array}{l|*{8}{r}} k & 0&1&2&3&4&5&6&\cdots\\ \hline 2^k \bmod 10 & 1&2&4&8&6&2&4&\cdots\\ 2^k \bmod 4 &1&2&0&0&0&0&0&\cdots \end{array} Note that the second line cycles with a period of 4, when k 1 k\ge1 . Hence, to calculate the last digit of a power of 2, that is, 2 k m o d 10 2^k \bmod 10 , with k 1 k\ge 1 , it suffices to calculate 2 k m o d 4 2^{k \bmod 4} , where k m o d 4 k \bmod 4 is taken to the range 1 , , 4 1, \ldots, 4 (so, actually ( k 1 ) m o d 4 + 1 (k-1)\bmod 4 +1 )..

Now, if that k k is itself a power of 2, then apparently we need to be interested in 2 k m o d 4 2^k \bmod 4 (for another k k ). This is shown in the third line: it cycles with period 1 when k 2 k\ge2 .

Thus, any power stack of three or more 2's will end in 6 = 2 + 2 + 2 6=2+2+2 .

This is wonderfully written. Thanks for going above and beyond!

Pi Han Goh - 4 years, 1 month ago

It's simple, we just have to use this general form 2^(2^n) where n is number of (2's -1)

Kanishk Devgan - 4 years, 1 month ago
Roy Clemmons
Apr 27, 2017

The problem actually simplifies to 2^8 because the exponent powers rule says to multiply exponents: 2 * 2 * 2. Since 2^8 = 256. the answer is 2 + 2 + 2.

Katrina Gerritia
Apr 23, 2017

Problem: 2^2^2^2

Steps: 2^2=4 ; 4^2=16

Solution: 16^2=256 Last digit is Answer: 6= 2+2+2

This is not correct. It should not be 1 6 2 16^2 , it should be 2 16 2^{16} . The fact that you get a correct digit is purely an accident.

Marta Reece - 4 years, 1 month ago

You solved your power tower the wrong way. You start at the top, not the bottom. You just got lucky

Jacob Worboy - 4 years, 1 month ago

I think the best things would be for you to simply delete your "solution," now that you know it to be incorrect.

Marta Reece - 4 years, 1 month ago

I did the same thing. And without his discussion about it, I wouldn't understand why I was incorrect. So I disagree with Marta Reece and think you should leave it posted. If there's a way to flag it as "incorrect" by editing it, that would be helpful.

Bob Smiley - 4 years, 1 month ago

Like everyone else has pointed, the expression is not 1 6 2 16^2 . See this article: How are exponent towers evaluated? .

Pi Han Goh - 4 years, 1 month ago

Log in to reply

can you check the solution directly above it

Razzi Masroor - 4 years, 1 month ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...