Problem Solving

Question:

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

Answers:
10, 11, 12, 13, 14

I know this should be a easy question but could someone walk me through the work process to figuring this out?

Any help would be greatly appreciated, thanks!

Is the answer 11?

chuang2 wrote:Question:

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

Answers:
10, 11, 12, 13, 14

I know this should be a easy question but could someone walk me through the work process to figuring this out?

Any help would be greatly appreciated, thanks!

yup that is the correct answer. How did you get to that?

I will try my best to explain in the simplest manner possible. So if you don't get something, just hit me back and I will make things simpler. So here is how you do this problem.
This is a problem based on the definition of a factorial.
A factorial is defined as N!= N*(N-1)*(N-2)*(N-3)..............3*2*1
This is what has been given to you when they say N is a positive integer and a product of all integers from 1 to N.
Now this N is also a multiple of 990. So if you divide this N by 990, you will get an integer.
The trick in this question lies in the fact that 990 can be written as 11*10*9.
Thus, you know, by the definition for factorial above, that N has to be atleast 11 so that N!/990 becomes an integer.
Case in point, if N were only 10, you'd still have a 11( 11*10*9, where the 10 and 9 would be common in both the numerator and denominator) in the denominator, and it would not factor out completely, and thus would not be an integer.
So the minimum value of N you need is 11.

Let me know if you need any further clarifications.

rippersid,
Would you rephrase this part pls? I understood the rest, but not from this point. (see below)
"....Thus, you know, by the definition for factorial above, that N has to be atleast 11 so that N!/990 becomes an integer.
Case in point, if N were only 10, you'd still have a 11( 11*10*9, where the 10 and 9 would be common in both the numerator and denominator) in the denominator, and it would not factor out completely, and thus would not be an integer.
So the minimum value of N you need is 11...."

thank you!

Here goes.
N! = N*(N-1)*(N-2)..........3*2*1
This N, as given by the problem is a multiple of 990.
Say N=12.
Then 12! = 12*11*10*9*8*7*6*5*4*3*2*1. As you can see, this is also a multiple of 990 because 990 = 11*10*9.
Now let N = 11.
11! = 11*10*9*8*7*6*5*4*3*2*1 which is the LEAST possible value of N such that it is a multiple of 990 (11*10*9)
Now say N = 10
10! = 10*9*8*7*6*5*4*3*2*1
Now this is not a multiple of 990 because you are missing a prime factor, namely 11.
In other words, anything less than N=11, will not be a multiple of 990 because you will not have 11 as one of the factors for the number. (Try factoring 990, and you will realize that 11, is one of the prime factors required).

Since the questions asks for the least value of N, N = 11 satisfies this. All values of N! for N>11 will always be a multiple of 990.

I apologize if my previous post did not make sense.

I hope that this clears things up.

now is perfect! tks!

The pleasure is mine.

I went about this question another way....

I broke down 990 into it's prime factors

3 - 990
3 - 330
11- 110
5 - 10
2 - 2


990 = 2 * 3 * 3* 5 * 11

Therefore, the least possible value for N would be 11 i.e. a multiple of 11 from the list

MrGreedy,

small flaw in your statement. by your method, 5 * 2 = 10 would also work, right?

I see what you mean...but in my statement I assumed the least possible multiple had to contain the greatest prime of 990 such as 11....10 wouldn't work.

!10 = 3 628 800

3 628 800 / 990 = 36653.45454545 recurring

!11 = 39 916 800

39 916 800 / 990 = 40320

But if I'm going about this the wrong way, please let me know..just started getting back into it for the GMAT.

I'm also using this question as reference:

https://www.beatthegmat.com/multiples-gm ... 12490.html

tks ripper.

I am not too sure i got this one..
990=11 x 3 x 3 x 5 x 2..ok..
So since we want the MINIMUM value of n we didide this by the MAXIMUM prime factor which is 11?
Am i understanding it correctly??

In 990 factored you have 3*3*2*2*5*5*11, so you need 2 3's, 2 2's, 2 5's and an 11, all of which are contained in N=11 or =11*(2*5)*(3*3)*(2*2*2)*7*(2*3)*5 and so on.