Product of consequtive integers problem

[This topic has 14 member replies]
Free $100 Amazon.com Gift Card - Buy a GMAT course using a Beat The GMAT discount code between Mar 8-22 and get a $100 Amazon.com Gift Card. Learn more!
Post New Topic   Post Reply

chuang2
Just gettin' started!

Default Avatar

Joined: 19 Oct 2008
Posts: 2

Thanks given: 0
Thanked 0 times in 0 posts

Topic: Product of consequtive integers problem
PostSun Oct 19, 2008 11:50 am

Elapsed Time:
00:00
Lap   Why a timer is critical to improving your score

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!
Back to top
View user's profile Send private message
rippersid
Just gettin' started!

Default Avatar

Joined: 13 Jun 2008
Posts: 14

Thanks given: 0
Thanked 2 times in 1 posts

PostMon Oct 20, 2008 1:17 am

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!
Back to top
View user's profile Send private message
chuang2
Just gettin' started!

Default Avatar

Joined: 19 Oct 2008
Posts: 2

Thanks given: 0
Thanked 0 times in 0 posts

PostMon Oct 20, 2008 10:16 am

yup that is the correct answer. How did you get to that?
Back to top
View user's profile Send private message
rippersid
Just gettin' started!

Default Avatar

Joined: 13 Jun 2008
Posts: 14

Thanks given: 0
Thanked 2 times in 1 posts

PostMon Oct 20, 2008 1:46 pm

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.
Back to top
View user's profile Send private message
GMATCHPOINT
Rising GMAT Star

Default Avatar

Joined: 08 Oct 2008
Posts: 51

Thanks given: 0
Thanked 0 times in 0 posts

PostMon Oct 20, 2008 4:54 pm

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!
Back to top
View user's profile Send private message
rippersid
Just gettin' started!

Default Avatar

Joined: 13 Jun 2008
Posts: 14

Thanks given: 0
Thanked 2 times in 1 posts

PostMon Oct 20, 2008 8:39 pm

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.
Back to top
View user's profile Send private message
Thanked by: rifat633, alexdallas
GMATCHPOINT
Rising GMAT Star

Default Avatar

Joined: 08 Oct 2008
Posts: 51

Thanks given: 0
Thanked 0 times in 0 posts

PostTue Oct 21, 2008 2:20 pm

now is perfect! tks!
Back to top
View user's profile Send private message
rippersid
Just gettin' started!

Default Avatar

Joined: 13 Jun 2008
Posts: 14

Thanks given: 0
Thanked 2 times in 1 posts

PostWed Oct 22, 2008 12:42 am

The pleasure is mine.
Back to top
View user's profile Send private message
MrGreedy
Just gettin' started!

Default Avatar

Joined: 24 Nov 2008
Posts: 3

Thanks given: 0
Thanked 0 times in 0 posts

PostWed Dec 10, 2008 12:14 pm

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
Back to top
View user's profile Send private message
niraj_a
GMAT Destroyer!

Default Avatar

Joined: 01 Jun 2008
Posts: 708

Thanks given: 5
Thanked 9 times in 9 posts
Location: USA

PostWed Dec 10, 2008 12:18 pm

MrGreedy,

small flaw in your statement. by your method, 5 * 2 = 10 would also work, right?
Back to top
View user's profile Send private message
MrGreedy
Just gettin' started!

Default Avatar

Joined: 24 Nov 2008
Posts: 3

Thanks given: 0
Thanked 0 times in 0 posts

PostWed Dec 10, 2008 12:48 pm

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.
Back to top
View user's profile Send private message
MrGreedy
Just gettin' started!

Default Avatar

Joined: 24 Nov 2008
Posts: 3

Thanks given: 0
Thanked 0 times in 0 posts

PostWed Dec 10, 2008 1:09 pm

I'm also using this question as reference:

http://www.beatthegmat.com/multiples-gmat-prep-t12490.html
Back to top
View user's profile Send private message
alexdallas
Really wants to Beat The GMAT!

Default Avatar

Joined: 15 Mar 2009
Posts: 108

Thanks given: 6
Thanked 0 times in 0 posts

PostSat Jul 18, 2009 10:00 am

tks ripper.
Back to top
View user's profile Send private message
uptowngirl92
GMAT Destroyer!

Default Avatar

Joined: 19 Apr 2009
Posts: 447

Thanks given: 57
Thanked 5 times in 5 posts
Location: Kolkata,India

GMAT Score: 670

PostMon Sep 28, 2009 7:48 pm

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??
Back to top
View user's profile Send private message
artistocrat
Rising GMAT Star

Default Avatar

Joined: 12 Mar 2008
Posts: 41

Thanks given: 1
Thanked 1 times in 1 posts

PostSat Oct 17, 2009 4:37 pm

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.
Back to top
View user's profile Send private message
Display posts from previous:   

Post New Topic   Post Reply All times are GMT - 7 Hours
Page 1 of 1
 
Most Active Members in Last 30 Days
1. harsh.champ 625 posts
2. shashank.ism 465 posts
3. ajith 370 posts
4. money9111 353 posts
5. thephoenix 349 posts
Most Active Experts in Last 30 Days
1. lunarpower
Manhattan GMAT Teacher
85 posts
2. Stuart Kovinsky
Kaplan GMAT Teacher
70 posts
3. Lisa Anderson
Stacy Blackman Consulting
50 posts
4. Testluv
Kaplan GMAT Teacher
50 posts
5. Stacey Koprince
Manhattan GMAT Teacher
35 posts