Skip to main content
OlympiadHQ

Browse · MATH

Print

jmc

prealgebra senior

Problem

In the prime factorization of , what is the exponent of ? (Reminder: The number is the product of the integers from 1 to . For example, .)
Solution
First, we check how many of the numbers from to are multiples of . We divide by , and it comes out to be and a bit. So we know this gives us times the factor appears, to begin with.

Now, some numbers are multiples of , so they have as a factor twice, and we've only counted them once so far! There are multiples of less than , and we need to add one to our exponent for each of these. That gives another to the exponent.

Some numbers are also multiples of . (Horrible, isn't it?) We actually have four such numbers: , , , and . We've counted two s for each of them, so now we need to count one more for each, adding another to the exponent.

One more time. What about ? Yes, we do have a multiple of among our numbers. So we add one more to the exponent, and at last we've gotten all of them.

Finally, we end up with a total of in the exponent.
Final answer
53