Find the last digit of i = 1 ∑ 2 0 1 4 i 2 0 1 4
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.
@Victor Loh ,how about this sol.?
We need to check the last digits when 1, 2, 3,...,8, 9, 0 are respectively raised to the power 2014. Since these digits reappear in periods of 10, we have to simply multiply the last digit of the sum of 1^2014 + 2^2014 + ... + 3^2014 by [1024/10] to get the last digit when we work out the 2010th period. Then we have to add 1^2014 + 2^2014 + 3^2014 + 4^2014 (their last digits, of course!). And this exercise gives 5.
Sorry I don't have LATEX software.
That's just how I did it!But is there a simpler way?
Log in to reply
You don't have to find the last digits of each n 2 0 1 4 . Note that when you multiply a number by itself a bunch of times, the last digit will be in a pattern which a maximum period of 4 . You can use mods to do the rest.
For example, to find the last digit of 4 1 3 6 1 2 , look at the last digit of the base. It's 3 . You can derive the sequence for f ( 3 n ) .
f ( 3 1 ) = f ( 3 ) = 3 f ( 3 2 ) = f ( 9 ) = 9 f ( 3 3 ) = f ( 2 7 ) = 7 f ( 3 4 ) = f ( 8 1 ) = 1 ⇐ It will start repeating here. f ( 3 5 ) = f ( 2 4 3 ) = 3 ⋮
You can generalize that chart like this.
f ( 3 1 m o d 4 ) = 3 f ( 3 2 m o d 4 ) = 9 f ( 3 3 m o d 4 ) = 7 f ( 3 0 m o d 4 ) = 1
Knowing that 6 1 2 ≡ 0 m o d 4 , we now look for f ( 3 0 m o d 4 ) , which as we just showed, is 1 !
You can apply this to the problem to get the answer.
Log in to reply
i didnt get u sir...?
I DNT GET IT SIR nd i want to solve it plz help
Yeap, this was the solution I had in mind :)
Log in to reply
@Wee Xian Bin – Me too...and used a bunch of Euler too...I just thought there might be a simpler way instead of looking at mods
@Trevor B. how did you decide that the max. period of repetition { when a number is multiplied by itself } is 4??
I understand it now. First I have missed the direction of the question. Please try to add more question!
Log in to reply
I've already begun planning for the countdown problems for 2015 which includes a variant of this problem so stay tuned for those I guess? :)
These are all "brilliant" solutions. I did it a bit differently using rules of summation notation.
Recall that ∑ i = 1 n i = 2 n ∗ ( n + 1 ) and ∑ i = 1 n i 3 = 4 n 2 ∗ ( n + 1 ) 2
So I intended to get rid of the summation notation in order to make it easier to interpret and look for a pattern.
∑ i = 1 2 0 1 4 i 2 0 1 4 = ∑ i = 1 2 0 1 4 ( ( i 3 ) 6 7 1 ∗ i 1 )
Becomes
( 2 2 n 2 ∗ ( n + 1 ) 2 ) 6 7 1 ∗ 2 n ∗ ( n + 1 ) where n = 2014
Simplified it becomes
( 2 n 2 + n ) 1 3 4 3
After subbing in n = 2014 we get
( 2 0 2 9 1 0 5 ) 1 3 4 3
Since the last digit is 5. It won't change given any exponent so I didn't need to use mod.
I started by raising the integers 0-9 to different powers and finding the pattern in the ones digit. 1 -> 1 ... 2 -> 4 -> 8 -> 6 -> 2 ... 3 -> 9 -> 7 -> 1 -> 3 ... 4 -> 6 -> 4 ... 5 -> 5 ... 6 -> 6 ... 7 -> 9 -> 3 -> 1 -> 7 ... 8 -> 4 -> 2 -> 6 -> 8 ... 9 -> 1 -> 9 ... 0 -> 0 ... Now I need to figure out which number from the sequences to pick, so I look at the power (2014). The powers go 1,2,3,4...2014, which means there are 2014 powers. Label the first number in the sequences at index 0. So subtract 1 from the number of powers to get 2013, and get the remainder of 2013 when divided by the period length of each sequence. This gives the index of the number in each sequence: 2013%1=0 2013%2=1 2013%4=1 So I pick the first number in the sequences of period 1 (obviously) and the second number in sequences of periods 2 and 4. This gives the mapping of the integers 0-9 when raised to power 2014 in the ones digit as: 1 -> 1 2 -> 4 3 -> 9 4 -> 6 5 -> 5 6 -> 6 7 -> 9 8 -> 4 9 -> 1 0 -> 0 Incidentally, note these are the ones digit of the square of the integers. The numbers are also palindromic between 1 and 9. Then I add these to get the ones digit of the sum of every 10 terms in the summation: 1 + 4 + 9 + 6 + 5 + 6 + 9 + 4 + 1 + 0 = 45; ones digit of 45 = 5. So for every 10 terms in the summation I add 5. I note that 10 goes into 2014 201 times. So I add 5 201 times and get the ones digit only: 201 * 5 -> 5. This is the answer for up to 2010 terms in the summation. There are still 4 more terms left, and their ones digits are: 1 + 4 + 9 + 6 -> 0. Adding this to the previous result I get the final answer 5.
the way I did it, We can see if from the powers of two that, it follows a cycle of 4, after every 4 power the unit digit reappears, 2^1=2, 2^2=4, 2^3=8, 2^4=(1)6, 2^5=(3)2.. so the unit digit 2 reappears after 4 powers, if we see, all the numbers have this cycle of 4 after which the same unit digit reappears.. only exception is 5,6 which follows the cycle of 1 and 4,9 which follows the cycle of 2, now if 2 is raised to the power of 2014, so up to 2012(divisible by 4 which is the cycle number) power the unit digit will be 2 as unit digit after 4 cycle (2^4) is 2 so the unit digit of 2^2014 is simply, 2^2=4
3^1=3 3^2=9 3^3=(2)7 3^4=(8)1 3^5 is going to give 3 as unit digit. for 3^2014, 3^2012 will give 1 as unit digit, 3^2014 is actually 3^2 which give 9 as unit digit
for 4 and 9 it follows cycle of 2, after every 2 power 6 appears as unit digit for 4 and 1 appears as unit digit for 9, 4^2014 will give 6 as unit digit, 9^2014 will give 1 as unit digit,
5,6 follows the cycle of 1, so 5^2014 will give 5 and 6^2014 will give 6, for 7, 8 will also follow the same rule as 2,3, so 7^2014 will give 9 as unit digit, (7^2=>9) 8^2014 will give 4 as unit digit,
so adding up all the unit digits from 1^2014 to 9^2014 (1+4+9+6+5+6+9+4+1) we get 45, for every 10 terms we get the sum of unit digit 45, as 10^2014 will give 0 as unit digit, so does not count, so till 2010 terms we will find total 181 times the sum of 45 which is going to give 5 as unit digit and from 2011 to 2014 the sum of unit digit is 20 . so the final unit digit it 5.
yes ..so did I ..only for every 20 terms the series has a sum of zero..
Problem Loading...
Note Loading...
Set Loading...
Since we are to find the last digit we need to take ∑ i = 1 2 0 1 4 i 2 0 1 4 ( m o d 1 0 ) . Which is equal to : 1 2 0 1 4 ( m o d 1 0 ) + 2 2 0 1 4 ( m o d 1 0 ) + 3 2 0 1 4 ( m o d 1 0 ) + . . . . . . . . . . . . . . . 2 0 1 3 2 0 1 4 ( m o d 1 0 ) + 2 0 1 4 2 0 1 4 ( m o d 1 0 ) . But we don't have to calculate them all as 1 ≡ 1 1 ≡ 2 1 ≡ 3 1 ≡ 4 1 . . . . . . . . . . . . . . . 2 0 1 1 ( m o d 1 0 ) and 2 ≡ 1 2 ≡ 2 2 ≡ 3 2 ≡ 4 2 . . . . . . . . 2 0 1 2 ( m o d 1 0 ) and 3 ≡ 1 3 ≡ 2 3 ≡ 3 3 ≡ 4 3 . . . . . . . . . . . . 2 0 1 3 ( m o d 1 0 ) and so on.Thus,we will just calculate ∑ i = 1 1 0 i 2 0 1 4 ( m o d 1 0 ) and the others will follow.Now,let us calculate ∑ i = 1 1 0 i 2 0 1 4 ( m o d 1 0 ) . 1 2 0 1 4 ≡ 1 m o d 1 0 , 2 2 0 1 4 ≡ 4 ( m o d 1 0 ) . I found this by building a pattern of the last digits of powers of 2 . 3 2 ≡ − 1 ( m o d 1 0 ) ⟹ 3 2 0 1 4 ( − 1 ) ≡ 9 ( m o d 1 0 ) 4 2 0 1 4 ≡ 6 ( m o d 1 0 ) I found this too by building a pattern. 5 2 0 1 4 ≡ 5 ( m o d 5 ) . 6 ≡ − 4 ( m o d 1 0 ) ⟹ 6 2 0 1 4 ≡ 4 2 0 1 4 ≡ 6 ( m o d 1 0 ) . 7 2 0 1 4 ≡ ( − 3 ) 2 0 1 4 ≡ 3 2 0 1 4 ≡ 9 ( m o d 1 0 ) . Just go on doing this till 9 and you will get ∑ i = 1 1 0 i 2 0 1 4 ( m o d 1 0 ) = 5 . Now we multiply this by 2 1 0 because this was just from 1 − 1 0 and if we multiply it by 2 1 0 we will get from 1 − 2 0 1 0 . Now,just calculate the remaining 4 and add and you will get the answer.