If n is a positive integer and the product of all integers from 1 to n

Question

If n is a positive integer and the product of all integers from 1 to n, inclusive, is a multiple of 990, what is the least possible value of n?

A. 10 
B. 11 
C. 12 
D. 13 
E. 14

A. 8
B. 9 
C. 10 
D. 11 
E. 12

EMPOWERgmatRichC · Answer

Hi All,

For a number to be a multiple of 990, that number must have the exact same prime factors (including duplicates) as 990 (but may have "extra" prime factors as well).

This prompt adds the extra stipulation that N has to be as SMALL as possible, so after factoring 990, we need to find the smallest product that "holds" the 2, 5, 11, and two 3s that make up 990.

1(2)(3)(4)....(11) is the smallest product that does that, so N = 11.

Final Answer:  B

GMAT assassins aren't born, they're made, 
Rich

hedgehuglove · Answer

Still not sure why is the answer is not 10, since it asks for the "LEAST" possible value of N? Could we say that question is asking for the biggest prime = least possible number?

EMPOWERgmatRichC · Answer

Hi hedgehuglove,

One of the 'restrictions' in the prompt is that the product has to be a MULTIPLE OF 990. If you multiply the integers from 1 to 10, inclusive, then you will NOT get a multiple of 990. We need to include the number 11 in that group to end up with that multiple.

GMAT assassins aren't born, they're made,
Rich

ScottTargetTestPrep · Answer

We are given that n is a positive integer and the product of all integers from 1 to n, inclusive, is a multiple of 990. Thus:

n! / 990 = integer

To determine the minimum value of n, we need to break 990 into its prime factors.

990 = 10 x 99 = 5 x 2 x 3^2 x 11

Thus:

n! / (5 x 2 x 3^2 x 11) = integer

Since n! must be divisible by 2, 5, 9, and 11, the minimum value of n must be 11. Recall that 11! is divisible by 11 and by any positive integer less than 11. In other words, 11! / 990 = integer.

Answer: B

CrackverbalGMAT · Answer

Solution:

Given- Product of all integers from 1 to n, inclusive, is a multiple of 990

=> 1x2x3x4x..n is a multiple of 990 = 990 m

=> n! = 990 m

=> n! = 2 x 5 x 3^2 x 11 x m

Out of the options 11! will have all the factors of 990 without missing any and hence the smallest value of n would be 11.

(option b)

Devmitra Sen
GMAT SME

ueh55406 · Answer

Hi Bunuel,

I solved it similar toh this one..but came to the conclusion that 10 must be the least number. I have highlighted why I say that. why is that reasoning incorrect?

EMPOWERgmatRichC · Answer

Hi ueh55406,

One of the 'restrictions' in the prompt is that the product has to be a MULTIPLE OF 990. If you multiply the integers from 1 to 10, inclusive, then you will NOT get a multiple of 990. Since 990 is a multiple of 11, any multiple of 990 (re: 990, 1980, 2970, etc.) will ALSO be a multiple of 11.

When we prime-factor that large number (whatever it is), the number 11 must be in that group of primes - but it does not occur anywhere in the first 10 integers, meaning that N cannot be 10.

GMAT assassins aren't born, they're made,
Rich

GMATinsight · Answer

Answer: Option B

Video solution by  GMATinsight

https://www.youtube.com/watch?v=IeKgcVIohSY

woohoo921 · Answer

KarishmaB 
Would you be able to explain why we only look at the prime numbers? Thank you!

KarishmaB · Answer

Consider this first: If n! is a multiple of 6, what is the smallest value of n?
Is it 6? Can we say that 1*2*3*4*5*6 = n! and this is a multiple of 6 so n MUST be at least 6? No.
How about 3! 
3! = 1*2*3 = 6
This is a multiple of 6 so n = 3 is the smallest value of n.

Now consider this:
If n! is a multiple of 5, what is the smallest value of n?
Will n = 2 or 3 or 4 work? Can I multiply any of these to give 5? No because 5 is prime. I must have a 5 in the product.
So n must be at leats 5. 
1*2*3*4*5 is the smallest n! that is a multiple of 5. Here the smallest value of n is 5.

The point is we can make composite numbers by using smaller numbers (their factors) but we cannot make prime numbers.

SO to have 990 as a factor, I need 2*3*3*5*11
If n! is 1*2*3*4*5*6, I have already got 2, 3, 3, 5 but I don't have 11 yet. Will 7! gives me 11? No. Neither will 8!, 9! or 10!.
I need 11! because that is when I will get my first 11. That is why we focus on prime numbers.

khera · Answer

what is the difficulty level of this question ?

Bunuel · Answer

You can check difficulty level of a question along with the stats on it in the first post. For this question Difficulty = Sub-600 Level. The difficulty level of a question is calculated automatically based on the timer stats from the users which attempted the question.

Kimberly77 · Answer

Hi Brent BrentGMATPrepNow , Could you elaborate a bit more on this "For 11 to appear in the product of all the integers from 1 to n, n must equal 11 or more. " ? why do we need 11 to appear in it? Question asked the least possible value of n? but 11 is the highest no in the prime factorization?

BrentGMATPrepNow · Answer

First recognize that "the product of all the integers from 1 to n, inclusive" is the same as n!

Let's take the prime factorization of 4!
4! = (4)(3)(2)(1) = (2)(2)(3)(2)(1)
Since there is no 5 hiding in the prime factorization of 4!, we know that 4! Is not divisible by 5.

Similarly, if we were to take the prime factorization of 10!, we would see that there is no 11 hiding in the prime factorization of 10!, which means 10! is not divisible by 11.

However, if we were to take the prime factorization of 11!, we would see that there IS an 11 hiding in the prime factorization of 11!, which means 11! IS divisible by 11.

DanTheGMATMan · Answer

After factoring, it's clear that you have to go up to 11! to get 11 as a factor:

https://www.youtube.com/watch?v=p1xm7JLEOGY

ManifestDreamMBA · Answer

990 = 9*11*10 = 2*5*(3^2)*11
n! = 990k (where k is a positive integer)
n! = 2*5*(3^2)*11*k
We already see 11 as a factor. Assuming k is not a multiple of any prime >11, else we will not hav the least possible value, answer is 11

NEYR0N · Answer

Bunuel  do you have link to some harder ones? thanks

Bunuel · Answer

rushimehta · Answer

Hi  Bunuel

Can you please explain What do you mean by the  statement  "(notice that 11! will have all other factors of 990 as well, otherwise the least value of n would have been larger)"

Thank you !

AbhishekP220108 · Answer

Basically he means to state that, factorial of 11 is the least value for n! Which has all the factor of 990, there is how

990= 2×3×3×5×11

Suppose as given in option choices least value of n is 10 then in n! I.e
10!=1×2×3×4×5×6×7×8×9×10 it has all the factors of 990 except 11 and now if look into 11!, then problem resolved and we got our least value required for n!

If n is a positive integer and the product of all integers from 1 to n

Prep Toolkit

Top 5 GMAT Debrief Videos

615 to 715 in 15 Days (Ria's Strategies)

More than Quant/Verbal Abilities: Speed vs. Accuracy

745 with Only Self-Prep and GMAT Club

From 555 to 765: 210-point Improvement

Perfect 805 Score Debrief by Julia

My Rewards

GMAT Problem Solving (PS) Questions

If n is a positive integer and the product of all integers from 1 to n

Prep Toolkit

615 to 715 in 15 Days (Ria's Strategies)

More than Quant/Verbal Abilities: Speed vs. Accuracy

745 with Only Self-Prep and GMAT Club

From 555 to 765: 210-point Improvement

Perfect 805 Score Debrief by Julia

My Rewards