This is essentially a direct copy of an official question, with one number changed:
https://gmatclub.com/forum/if-n-is-a-po ... 90855.html
though you might notice how much more elegant the wording of the official problem is (there's no need to introduce two separate letters in this kind of problem).
Here, we know n! is divisible by 1440 = (12)^2 * (10) = (2^5)(3^2)(5). So we need n to be large enough so that we have one 5, two 3s, and five 2s among the divisors of the integers from 1 through n. It might be clear if you've done similar kinds of problems, or looked at prime factorizations of factorials, that we won't need an especially large value of n here, so you could just confirm that the smallest answer choice, n=8, works and be done here. But you could also solve without answer choices - as long as n is 5 or greater, we'll have a '5' in the product of n!, and as long as n is 6 or greater, we'll a 3 and a 6 in the product making up n!, so 3^2 will be a divisor of n!. Lastly, we just need to be sure to get five 2s. If n = 6, then n! = 6! is only divisible by 2^4, because we only get twos from 2, 4, and 6. But as long as n is 8 or greater, then 2^5 will easily divide n! (in fact, 2^7 will), so 8 is the smallest possible value of n.
For online GMAT math tutoring, or to buy my higher-level Quant books and problem sets, contact me at ianstewartgmat at gmail.com
ianstewartgmat.com
