What is the trailing number of zeros at the end of the integer
1 0 ! 2 + 1 1 ! 2 + 1 2 ! 2 ⋯ + 9 9 ! 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.
This is a good start. However, your explanation has a common misconception.
Do you see how to fix this gap in your solution?
Keep writing more solutions and you will get the hang of this!
Log in to reply
how will i fix this gap for this problem?
Log in to reply
Well, think about the gap.
My solution is approximately same as MD Zuhair's but to complete the work from where he left ,we need to prove that
1 + (11! /10!)×(11! / 10!) + ...... + (14! / 10!)×(14! / 10!) is not divisible by 10 which can be shown using modular arithmetic.
Problem Loading...
Note Loading...
Set Loading...
The number of trailing zeroes at the end of ( 1 0 ! ) 2 + ( 1 1 ! ) 2 + . . . . . + ( 9 9 ! ) 2 is to be finded out.
No of zeroes at the end of 1 0 ! = [ 1 0 / 5 ] = 2 or ( 1 0 ! ) 2 = 4 zeroes. Now, ( 1 1 ! ) 2 similarly has 4 zeroes at the end uptill ( 1 5 ! ) 2 which has 9 zeroes. Hence Now ( 1 0 ! ) 2 also have a non zero part, which when added to the others will leave with only 4 zeroes at the end.
Hence Ans is 4 .