Find the last digit of 1 5 + 2 5 + 3 5 + ⋯ + 9 9 5 .
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.
For 1 5 + 2 5 + 3 5 + ⋯ + 9 9 5 , the last digit of each term repeats itself 10 times throughout the sequence so ( 1 5 + 2 5 + 3 5 + ⋯ + 9 9 5 ) ( m o d 1 0 ) becomes 1 0 ( 1 5 + 2 5 + 3 5 + ⋯ + 9 5 ) ( m o d 1 0 ) . Since 1 0 m o d ( 1 0 ) ≡ 0 m o d ( 1 0 ) the product becomes 0 ( 1 5 + 2 5 + 3 5 + ⋯ + 9 5 ) ( m o d 1 0 ) which is simply 0
S = k = 1 ∑ 9 9 k 5 Using the identity k = a ∑ b f ( k ) = k = a ∑ b f ( a + b − k ) = 2 1 k = 1 ∑ 9 9 ( k 5 + ( 1 0 0 − k ) 5 ) = 2 1 k = 1 ∑ 9 9 ( k 5 + ( 1 0 0 5 − 5 ⋅ 1 0 0 4 ⋅ k + 1 0 ⋅ 1 0 0 3 ⋅ k 2 − 1 0 ⋅ 1 0 0 2 ⋅ k 3 + 3 ⋅ 1 0 0 ⋅ k 4 − k 5 ) ) = 2 1 k = 1 ∑ 9 9 ( 1 0 0 5 − 5 ⋅ 1 0 0 4 ⋅ k + 1 0 ⋅ 1 0 0 3 ⋅ k 2 − 1 0 ⋅ 1 0 0 2 ⋅ k 3 + 3 ⋅ 1 0 0 ⋅ k 4 ) = 5 0 k = 1 ∑ 9 9 ( 1 0 0 4 − 5 ⋅ 1 0 0 3 ⋅ k + 1 0 ⋅ 1 0 0 2 ⋅ k 2 − 1 0 ⋅ 1 0 0 ⋅ k 3 + 3 k 4 )
We note that S is divisible by 1 0 , therefore the last digit of S is 0 .
Here we know that ( a + b ) p = 0 m o d ( a + b ) or ( a + b ) p is divisible by ( a + b ) hence 1 5 + 9 9 5 + 2 5 + 9 8 5 + . . . . . . . . ( Like this pair wise) Hence we know 1 5 + 9 9 5 is divisible by ( 1 + 9 9 ) = 1 0 0 and ( 2 5 + 9 8 5 ) is divisible by ( 2 + 9 8 ) = 1 0 0 and so on. Hence All have common factor as 100 . Hence the last digit must be 0.
@Md Zuhair , your the other problem has 8 solutions so how do I answer. Give me your answer and I will change the problem and answer for you.
Log in to reply
@Chew-Seong Cheong What are the solutions ? Tell me, Or take any of them for the answer and please give an solution to the problem. Or Change the question to how many solutions are there for this equation. Thankyou.
Log in to reply
I need to answer the problem correctly before I can change the problem for you. What was the answer you used?
Log in to reply
@Chew-Seong Cheong – Ok sorry, It was 2.
@Chew-Seong Cheong – Hey , did you wrote the solution of the sum?
Md, just use the standard three dots . . . will do.
Log in to reply
You can either use ... ( . . . ) or \cdots ( ⋯ ) (dots at the centre), \dots ( … ) (dots at the bottom).
Ok , Thanks for the information
The answer to the problem should be 5. You can check the answer using Wolfram Alpha . It is free.
Log in to reply
Please let me know where i am wrong in the solution. Thankyou
Log in to reply
message me at facebook. I am sleeping now.
Problem Loading...
Note Loading...
Set Loading...
S = U ( 1 5 + 2 5 + 3 5 + … + 9 9 5 ) S = U ( U ( 1 5 + 9 9 5 ) + U ( 2 5 + 9 8 5 ) + U ( 3 5 + 9 7 5 ) + U ( … ) + U ( 4 9 5 + 5 1 5 ) + U ( 5 0 5 ) ) S = U ( 0 + 0 + 0 + … + 0 + 0 ) S = 0
The big U represents function which returns unit digit of given integer.