Good job guys,
I have a solution similar to that of scoobydooby.
We'll know the number of ending zeros of 10! by finding the largest power of 10 contained in 50!
Why? Because for example 1000= 10^3;so 1000 has 3 ending zeros.
900= 9*10^2; so 900 has 2 ending zeros.
Now to solve the problem, we first need to break down 10 into prime numbers. 10 = 2*5.
We then need to find how many 2s (call it x) and how many 5s (call it y) go into 50!
Once we do that, we'll take the lower number between x and y.
Clearly, there will be more 2s than 5s in 50!; so let's save time by focusing on y (the number of 5).
Let's do it:
Divide 50 by 5 and the resulting quotient by 5 repeatedly until the quotient of the division is less than 5, which is the divisor, and you stop.
We only write out and take the quotients in the divisions.
50/5 = 10; 10/5= 2. Stop! since 2 is less than 5.
Let's now add all the quotients: y= 10 + 2 = 12.
12 is the largest power of 5 in 50!
12 is also the largest power of 10 contained in 50!
50! has 12 ending zeros!
That's all folks!
This concept can be applied to any number including 10!, which you do not need to find the ending zeroes of 50!
Deznos.
You can tame any beast, the GMAT included.