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

990 = 2 * 5 * 3 * 3* 11
so product from 1 to n should have all the above numbers. n = 11 will have all the above numbers as factors of 1 * 2* ..... * 11

B

Hi,

The question says that 990 is a factor of n!.
990 = 9*110 = 9*11*10
For 990 to be a factor of n!, n should at least be 11 so that it includes the common factor 11 that is found in 990.


regards,
Jack

The least possible value of such a n will be at least the highest prime factor of 990, which is 11

The only other thing to check is if the rest of the factors of 990, can be obtained by multiplication of numbers less than 11. Otherwise n may be greater than 11

But that is easy to see since 990=9*10*11. So taking all the numbers below 11 will suffice.

Similar question: https://gmatclub.com/forum/n-is-a-posit ... 04272.html

You need to primarily find the primes of 990:
2,3,3,5,11
The integer must contain all these primes

By knowing 11 is an prime, we know the answer can be B,C,D or E as these all contain 11.
11=1,2,3,4,5,6,7,8,9,10,11

11 contains the 2,3,5 and 11 explicitly and the second 3 comes from the 6 (2*3), therefore the answer is 11.

This is because we know a number that contains all the primes of 990 will be a multiple of 990.

Hope this helps

The answer would be the number which contains all the factors of the figure.
The series of 1 to 11 contained all the factors of 990. 2,3,3,5 and 11.
Because 990 is made up from these 5 numbers such that 2*3*3*5*11 = 990
If you times the other numbers (1,4,6,7,8,9,10) in the series you will get a multiple of 990 from this.

I picked 11 because it asked for the least possible value of n. Picking 12,13,14 would result in a multiple of 990 but the number is more than the least possible value of 11.

The best way to interpret problems is through practice, you will come to understand questions better over time. Always remember GMAT questions are simple questions made to look complicated.

just entered this in google and you're right! (1 * 2 * 3 * 4 * 5 * 6 * 7 * 8 * 9 * 10 * 11) / 990 = 40 320

meanwhile (1 * 2 * 3 * 4 * 5 * 6 * 7 * 8 * 9 * 10) / 990 = 3 665.45455 wouldn't work

It makes sense because the highest prime factor of 990 must also be a factor of any multiple of 990.

I guess I need to do more practice problems involving multiples and number properties.

to cement my understanding, maximum value of n can be anything, right?

The maximum value of n is not limited at all. For all n more than or equal to 11, n! will be a multiple of 990.

Hi Bunuel,

I am not sure why have excluded 10, which seems to be one of the factors (5*2).

n! must be a multiple of 990=90*11. Now, if n=10, then it wont have 11 as its factor, so it cannot be a multiple of a number which HAS 11 as its factor.

Hope it's clear.

Here's a more elaborated thinking response to what you all have summarized above -- but for those who need the extra steps, try this.

990* multiple = product of 1 to n
990 * multiple = 1 * 2 * 3 * 4 * 5 * ... * n
11 * 3 * 3 * multiple = 1 * 2 * 3 * 4 * 5 * ... * n

We need to find the smallest value for n. We know in the factor tree, any number can be broken down to its lowest level in the factor tree. And that factor tree will comprise of all prime factors.

The factors on the left side are:
11 and 3 and 'multiple' -- the multiple can be anything.

We know that we want 990 to go into the right side (we don't care how many times).

The 990 consists of 11 and 3^2. So essentially it's prime factors are 11 and 3. These lowest level prime factors must go into the right side -- so the right side at the very least must contain the lowest prime factors from the left side.

So, we see 1 * 2 * 3 * 4 * 5 * ... * n

contains a 3.

But it does not contain an '11'.
11 is the answer.

Hope that helps.

Can you multiply two numbers (other than 11) and get an 11? No because 11 is prime. If 11 is a part of the product of 3 numbers, say a*b*c, it must have been one of the numbers.
Given that the product is 990x (where x is some integer). When we start breaking down 990 into factors, we start with 9*11*10. We see that 9 and 10 will be further broken down into smaller factors but 11 will not be. It is prime. So one of the numbers which multiplied to give 990x must have been 11.
Since consecutive integers 1 to n were multiplied, n is either 11 or greater than 11 to include 11 in the numbers multiplied.
Least possible value of n is 11.

product of all the integers from 1 to n = n!
990 = 9*10*11
i.e. n! must be divisible by 9, 10 and 11 all for n! to be divisible by 990
i.e. minimum value of n must be 11 for n! to be divisible by 11 and 10 and 9 both

P.S. 11!= 11*10*9*8*7*6*5*4*3*2*1

n = 11

Answer: option D

A lot of integer property questions can be solved using prime factorization.
For questions involving divisibility, divisors, factors and multiples, we can say:
If N is divisible by k, then k is "hiding" within the prime factorization of N

Consider these examples:
24 is divisible by 3 because 24 = (2)(2)(2)(3)
Likewise, 70 is divisible by 5 because 70 = (2)(5)(7)
And 112 is divisible by 8 because 112 = (2)(2)(2)(2)(7)
And 630 is divisible by 15 because 630 = (2)(3)(3)(5)(7)

For more on this concept, see the 2nd half of this free video: https://www.gmatprepnow.com/module/gmat- ... /video/825

So, if some number is a multiple of 990, then 990 is hiding in the prime factorization of that number.

Since 990 = (2)(3)(3)(5)(11), we know that one 2, two 3s, one 5 and one 11 must be hiding in the prime factorization of our number.

For 11 to appear in the product of all the integers from 1 to n, n must equal 11 or more.
So, the answer is B

Cheers,
Brent

Solution:

We are given that the product of all integers from 1 to n, inclusive, (i.e., n!) is a multiple of 990.

Thus, n! = 990 x k for some integer k.

Another way to visualize the given information is to say:

n!/990 must be an integer. Thus, n! must contain all the factors of 990.

Notice that 990 = 99 x 10 = 9 x 11 x 10. So in order for n!/990 to be an integer, n must at least be equal to 11, since 11! = 11 x 10 x 9 x … x 3 x 2 x 1.

Answer: B

Lets breakdown the question:
n is a positive integer
Therefore n>0

the product of all the integers from 1 to n, inclusive, is a multiple of 990

Therefore (1 x 2 x 3 ..... x n) / 990 gives an integer
Therefore n!/990 gives an integer
Therefore n!/(9 x 10 x 11)gives an integer

Question: What is the least possible value of n!
This means what is the lowest value that n! can be so that when it is divided by 9 x 10 x 11, the outcome gives an integer

The lowest value of n! should have all the factors that are in the demoninator so that when divided an integer is formed

11! / (9 x 10 x 11) = (11 x 10 x 9 x 8 x 7 x 6 x 5 x 4 x 3 x 2 x 1) / (9 x 10 x 11)
= 8 x 7 x 6 x 5 x 4 x 3 x 2 x 1

10! / (9 x 10 x 11) = (10 x 9 x 8 x 7 x 6 x 5 x 4 x 3 x 2 x 1) / (9 x 10 x 11)
= (9 x 8 x 7 x 6 x 5 x 4 x 3 x 2 x 1) / 11 = mixed number

Any number lower than 10! will give a mixed number.

Any number higher that 11! will give an integer, however 11! is the lowest value that will produce an integer when 990 is the denominator.