⌊ 1 ⌋ × ⌊ 2 ⌋ × ⌊ 3 ⌋ × ⌊ 4 ⌋ × ⋯ × ⌊ 1 0 0 ⌋
Find the trailing number of zeros of the product above.
Notation : ⌊ ⋅ ⌋ denotes the floor function .
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.
Could be possible generalize for n ?
this problem can be re-written as
1
0
0
!
.We know the fact that 100! has 24 trailing zeroes and so when you square root 100!, the number of trailing zeroes becomes half of the number of trailing zeroes of 100!
[eg.100 has 2 trailing zeroes whereas
1
0
0
=10 has 1 trailing zero.]
Hmm I think Abhishek is right. Are you missing that floor function?.The question is not equivalent to 1 0 0 ! .
For more, just to verify this to you (not to discourage you), 1 0 0 ! has a factor of 9 9 whereas the expression in the problem don't. You may proceed to find out how this coincidence worked here!
This problem cant be re written as root of 100 factorial because the pattern goes like this 1 1 1 2 2 2 2 2 3 3 3 3 3 3 3......... I too thought it in the same way you thought ,but i then realized that it is wrong
Log in to reply
what pattern are you talking about?
Log in to reply
the pattern is 1#1#1#2#2#2#2#2#3#3#3#3#3#3#3........ where # is multiplication
Log in to reply
@Abhishek Alva – but my solution is an easier way to solve it.by the way you understood my solution right and also try out my quesions.i did not understand your solution.
We are seeking for the number of times 5 will appear on the expression. (The 2's don't matter because clearly, there are more 2's than 5's)
So between 3 6 and 2 5 there are 12 entries of 5 ′ s hence, our answer.
Problem Loading...
Note Loading...
Set Loading...
If you inspect the Problem closely , you will see a pattern . Let me show you from ⌊ 1 ⌋ to ⌊ 3 ⌋ We get 1. from ⌊ 4 ⌋ to ⌊ 8 ⌋ We get 2. from ⌊ 9 ⌋ to ⌊ 1 5 ⌋ We get 3. We can generalize This particular sequence as ⟹ 1 0 n = 1 ∏ 9 n 2 n + 1 To find the answer , we must find the power of 5 because power of 2 is more than 5 But i am still going to calculate it Power of 5 = 5 1 1 Power of 2 [when n=2,4,6,8] = 2 5 × 2 1 8 × 2 1 3 × 2 5 1 = 2 8 7 ⟹ 1 0 × ( 5 1 1 × 2 1 1 ) A n s = 1 2