alexlearning17
Hi everyone,
I came across the following question from Math Revolution.
For a positive inteer n, if p is the product of all the integers from 1 to n, inclusive, and is divisible by 1,560, what is the least possible value of n?
A. 9
B. 10
C. 11
D. 12
E. 13\(p = n!\)
\(1560 = 2^3 * 3 * 5 * 13\)
For \(p\) to be divisible by 1560, \(n!\) must include 13.
A, B, C and D imply that n! = 9!, 10!, 11! or 12!.
Since none of these options for n! will include 13, eliminate A, B, C and D.
Quote:
I was able to find out that n at least must be a 13 to have a product that is divisible by 1560 but then the question
what is the LEAST possible value made me understand that they are asking for the n that is unlikely to get us such number. I was completely lost because all ABCD are correct answers. I just picked the smallest and looked at the answer which indicated the answer as E.
If answer is E, then the question probably should have sounded like
"What is the smallest possible value of n" Am I right? Please advise.
Alex
least possible value is common wording and conveys the same meaning as
smallest possible value.
An OG problem that asks for the
least possible value:
https://gmatclub.com/forum/if-y-is-an-i ... 39867.html