great question and great explanation, jpv!
Here's another verion, just to diversify: I love prime numbers. I think they're an excellent way to work out integer problems. Here's how I did this problem.
10 is made up of 2 and 5. Any power of 10 is really a power of 2 and 5. For example, 10^2=(2^2)(5^2).
So the maximum value of N in this case is the maximum number of 2's and 5's that can cancel 24!
Since 24! is made up of, among all the other integers, 5, 10, 15, and 20, and the primes there are 5, 2x5, 3x5, and 2x2x5, we have only 4 fives in 24! There are plenty of 2's, but only 4 fives, so there can only be 4 5's on the denominator of the division. So N's maximum is 4.
I hope that was clear...