A = 1 1 5 + 1 3 6 + 1 5 7
Find the last digit of A .
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. Can you find the second last digit of A instead?
To find the second last digit we first need to find 1 1 5 + 1 3 6 + 1 5 7 ( m o d 1 0 0 ) . The last two digits of a power of 1 1 repeat every 1 0 powers, i.e.
1 1 1 ≡ 1 1 ( m o d 1 0 0 )
1 1 2 ≡ 2 1 ( m o d 1 0 0 )
1 1 3 ≡ 3 1 ( m o d 1 0 0 )
1 1 4 ≡ 4 1 ( m o d 1 0 0 )
and so on until
1 1 1 0 ≡ 0 1 ( m o d 1 0 0 ) , and then we're back to
1 1 1 1 ≡ 1 1 ( m o d 1 0 0 ) .
Therefore, we know already that the last two digits of 1 1 5 are 5 1 .
We can carry out the selfsame procedure with 1 3 : this is a bit more messy. However, by calculating every power before 6 of 1 3 , and then calculating 1 3 6 ( m o d 1 0 0 ) , this can be done, though quite slowly. We will finally find that the last two digits of 1 3 6 are 0 9 .
Thus far, we have that 1 1 5 + 1 3 6 + 1 5 7 ( m o d 1 0 0 ) ≡ 6 0 + 1 5 5 ( m o d 1 0 0 ) . We can calculate that 1 5 7 ≡ 7 5 ( m o d 1 0 0 ) . Our final answer is therefore 6 0 + 7 5 ≡ 3 5 ( m o d 1 0 0 ) , with the second last digit being 3 .
@Brian Charlesworth @Sharky Kesa Do you perhaps know a quicker way? If the powers become quite large, my method will take a very long time.
Log in to reply
I often use the binomial method. For example, with 1 1 5 = ( 1 0 + 1 ) 5 , if all we are interested in is the last two digits then in the binomial expansion, we only need concern ourselves with the last two terms, (since the others have a factor of 1 0 0 ). In this case the last two terms are
5 ∗ 1 0 ∗ 1 5 + 1 6 = 5 1 .
For the others, the last two terms of the expansion of 1 3 6 = ( 1 0 + 3 ) 6 are
6 ∗ 1 0 ∗ 3 5 + 3 6 ≡ 8 0 + 2 9 ≡ 9 ( m o d 1 0 0 ) ,
and for 1 5 7 = ( 1 0 + 5 ) 7 we have
7 ∗ 1 0 ∗ 5 6 + 5 7 ≡ 5 0 + 2 5 ≡ 7 5 ( m o d 1 0 0 ) .
So the given expression is 5 1 + 9 + 7 5 ≡ 3 5 ( m o d 1 0 0 ) .
I also used the facts that the last digits of the powers of 3 cycle as 3 , 9 , 7 , 1 , 3 , . . . . and that all powers 5 n for n ≥ 2 end in 2 5 . The one "cheat" used here was knowing explicitly that 3 6 ≡ 2 9 ( m o d 1 0 0 ) , but for much higher powers this step could provide some difficulties.
Log in to reply
I learnt a new use of binomial expansion in such problems. Thanks.
Yes, that is a good idea of yours. Upvote for teaching me something new! Thanks!
Its like "mango=sugarcane"..//!!
can you tell me the short way??? like 8^80's unit digit?
Finding the last digits of any of these powers is the same as finding the last digits of the powers of the units place.
For example, the last digit of 1 3 6 is the same as the last digits of 3 6 .
Now the problem is reduced to finding the last digit of 1 5 + 3 6 + 5 7 ⇒ 1 + 9 + 5 = 1 5 . The answer is 5 .
A = 1 5 + 3 6 + 5 = 1 + 9 3 + 5 = 5 . ∵ 9 o d d p o w e r = . . . . 9 , 5 a n y i n t e g e r p o w e r = . . . 5 .
the unit digit of 1 1 5 is 1. the unit digit of 1 3 6 is 6 , the unit digit of 1 5 7 is 5 there fore unit digit of 1 1 5 + 1 3 3 + 1 5 7 is 1+9+5=15 therefore the unit digit is 5
Typo. unit digit of 1 3 6 is 9.
Problem Loading...
Note Loading...
Set Loading...
units digits of 11 is 1, 13 is 3 and 15 is 5.
the units digit of powers repeat after 4 times periodically.
example, 2 4 8 16(6) 32(2) 64(4).
so,
1^5 = 1.
3^6 has the same units digit as 3^2 = 9.
5^7 has the same units digit as 5^3 = 125(5).
so, 1 + 9 + 5 = 5.