What is the number of trailing zeroes in ( 1 0 0 2 0 0 ) ?
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.
( 1 0 0 2 0 0 ) = 1 0 0 ! × 1 0 0 ! 2 0 0 ! ,which again is equal to 1 0 0 × 9 9 × 9 8 × ⋯ × 2 × 1 2 0 0 × 1 9 9 × 1 9 8 × ⋯ × 1 0 2 × 1 0 1 Now by using floor function\greatest integer function on 1 0 0 ! we will get number of 0 's equal to 2 4 and similarly using floor function on 2 0 0 ! , we will get number of 0 's equal to 4 9 .But the product in the numerator will have only 4 9 − 2 4 = 2 5 0 's. Hence, the number of zeroes in the expression will be 1 because 2 4 0 's will get cancelled from numerator and denominator both.
You made a serious misconception. Can you identify it?
What's my mistake? I can't understand.Please tell me sir.
Log in to reply
Does 8 0 1 0 0 end with 1 zero "because 1 0's will get cancelled from numerator and denominator both"?
Log in to reply
Oh yes! I got it. I did not show that the numerator will be completely divisible by the denominator. Sir I request you to change my solution,because you will write it in a good way.
Log in to reply
@Vilakshan Gupta – Well, that's not the only issue. For example, 2 0 1 0 0 doesn't end with 1 0's, even though the numerator is completely divisible by the denominator.
So, figure out what the crux of the issue is.
Unfortunately, I do not think there is a simple way to fix your solution, without introducing a new idea to it.
Log in to reply
@Calvin Lin – Then what will be a perfect solution for the problem, as @Naren Bhandari 's solution is also incomplete due to similar reasons, what can be the good solution.
Log in to reply
@Vilakshan Gupta – Naren's solution is fine (once he fills the gap about the powers of 2). That is the correct way of proceeding. Instead of focusing on the "number of zeros", he focused on the "number of powers of 5 (and 2)". This way, if we can guarantee that 5 divides the number, and 2 divides the number, then we can conclude that 10 divides the number.
IE In the example of 2 0 1 0 0 , because 2 doesn't divide the number (since the power of 2 in the numerator and denominator are both 2^2), hence it will not be divisible by 10.
Problem Loading...
Note Loading...
Set Loading...
C ( 2 0 0 , 1 0 0 ) = ( 1 0 0 2 0 0 ) = 1 0 0 ! 1 0 0 ! 2 0 0 ! Total numbers of trailing zeros hold by ( 1 0 0 2 0 0 ) are the prime factor of 5 . So highest power of prime p = 5 for 2 0 0 ! , 1 0 0 ! is given by \begin{aligned}& H_p(n!) & =\displaystyle\sum_{k=1}^{m}\left\lfloor\frac{n}{p^k}\right\rfloor\phantom{cccccccc}\text{where p^m≤n<p^{m+1}} \end{aligned} H 5 ( 2 0 0 ! ) = ⌊ 5 2 0 0 ⌋ + ⌊ 2 5 2 0 0 ⌋ + ⌊ 1 2 5 2 0 0 ⌋ = 4 0 + 9 + 1 = 4 9 H 5 ( 1 0 0 ! ) = ⌊ 5 1 0 0 ⌋ + ⌊ 2 5 1 0 0 ⌋ = 2 0 + 4 = 2 4
It can be noted that the total number of zeros in denominator are 2 × 2 4 = 4 8 .There are altogether 4 9 zeros in the numerator and 4 8 zeros in denominator. Remaining numbers of are ending zeros of ( 1 0 0 2 0 0 ) ie 1 .