• FREE GMAT Exam
Know how you'd score today for $0 Available with Beat the GMAT members only code • Award-winning private GMAT tutoring Register now and save up to$200

Available with Beat the GMAT members only code

• Free Practice Test & Review
How would you score if you took the GMAT

Available with Beat the GMAT members only code

• Get 300+ Practice Questions
25 Video lessons and 6 Webinars for FREE

Available with Beat the GMAT members only code

• Free Veritas GMAT Class
Experience Lesson 1 Live Free

Available with Beat the GMAT members only code

• 5-Day Free Trial
5-day free, full-access trial TTP Quant

Available with Beat the GMAT members only code

• Free Trial & Practice Exam
BEAT THE GMAT EXCLUSIVE

Available with Beat the GMAT members only code

• 5 Day FREE Trial
Study Smarter, Not Harder

Available with Beat the GMAT members only code

• 1 Hour Free
BEAT THE GMAT EXCLUSIVE

Available with Beat the GMAT members only code

• Magoosh
Study with Magoosh GMAT prep

Available with Beat the GMAT members only code

## multiple of 990?

tagged by: Brent@GMATPrepNow

This topic has 3 expert replies and 3 member replies
josh80 Senior | Next Rank: 100 Posts
Joined
03 Nov 2013
Posted:
72 messages
1

#### multiple of 990?

Sun Dec 15, 2013 3:18 pm
If n is a positive integer and product of all the integers from 1 to n, inclusive, is a multiple of 990, what is the least possible value of n?

10
11
12
13
14

### GMAT/MBA Expert

Brent@GMATPrepNow GMAT Instructor
Joined
08 Dec 2008
Posted:
11487 messages
Followed by:
1229 members
5254
GMAT Score:
770
Sun Dec 15, 2013 3:54 pm
josh80 wrote:
If n is a positive integer and product of all the 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 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
Similarly, we can say:
If N is is a multiple of k, then k is "hiding" within the prime factorization of N

Examples:
24 is divisible by 3 <--> 24 = 2x2x2x3
70 is divisible by 5 <--> 70 = 2x5x7
330 is divisible by 6 <--> 330 = 2x3x5x11
56 is divisible by 8 <--> 56 = 2x2x2x7

So, if 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

_________________
Brent Hanneson â€“ Founder of GMATPrepNow.com
Use our video course along with

Check out the online reviews of our course
Come see all of our free resources

GMAT Prep Now's comprehensive video course can be used in conjunction with Beat The GMATâ€™s FREE 60-Day Study Guide and reach your target score in 2 months!
theCodeToGMAT Legendary Member
Joined
14 Aug 2012
Posted:
1556 messages
Followed by:
34 members
448
Target GMAT Score:
750
GMAT Score:
650
Sun Dec 15, 2013 10:37 pm
n! = 11 x 5 x 2 x 3 x 3 x _

From RHS, we need one 11, 5, 2 & 3x3

So, n! must comprise of prime number "11"

For that we need minimum n=11 .. as if n = 10.. then "11" will not be there..

So, {B}

_________________
R A H U L

prada Senior | Next Rank: 100 Posts
Joined
08 Dec 2010
Posted:
64 messages
1
Thu May 19, 2016 3:30 pm
Brent@GMATPrepNow wrote:
josh80 wrote:
If n is a positive integer and product of all the 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 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
Similarly, we can say:
If N is is a multiple of k, then k is "hiding" within the prime factorization of N

Examples:
24 is divisible by 3 <--> 24 = 2x2x2x3
70 is divisible by 5 <--> 70 = 2x5x7
330 is divisible by 6 <--> 330 = 2x3x5x11
56 is divisible by 8 <--> 56 = 2x2x2x7

So, if 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
Hi Brent,

Could we not say the answer is (a) or 10 since in the PF (2)(3)(3)(5)(11) 2x5=10? I did the same methodology as you but I concluded that it would be (a) since with the pf we can come up with 10

### GMAT/MBA Expert

Brent@GMATPrepNow GMAT Instructor
Joined
08 Dec 2008
Posted:
11487 messages
Followed by:
1229 members
5254
GMAT Score:
770
Thu May 19, 2016 3:40 pm
Brent@GMATPrepNow wrote:
josh80 wrote:
If n is a positive integer and product of all the 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 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
Similarly, we can say:
If N is is a multiple of k, then k is "hiding" within the prime factorization of N

Examples:
24 is divisible by 3 <--> 24 = 2x2x2x3
70 is divisible by 5 <--> 70 = 2x5x7
330 is divisible by 6 <--> 330 = 2x3x5x11
56 is divisible by 8 <--> 56 = 2x2x2x7

So, if 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
Hi Brent,

Could we not say the answer is (a) or 10 since in the PF (2)(3)(3)(5)(11) 2x5=10? I did the same methodology as you but I concluded that it would be (a) since with the pf we can come up with 10
Since 11 is a factor of 990, we need 11 to be included in the product. So, n cannot equal 10.

Cheers,
Brent

_________________
Brent Hanneson â€“ Founder of GMATPrepNow.com
Use our video course along with

Check out the online reviews of our course
Come see all of our free resources

GMAT Prep Now's comprehensive video course can be used in conjunction with Beat The GMATâ€™s FREE 60-Day Study Guide and reach your target score in 2 months!

### GMAT/MBA Expert

Rich.C@EMPOWERgmat.com Elite Legendary Member
Joined
23 Jun 2013
Posted:
9426 messages
Followed by:
480 members
2867
GMAT Score:
800
Thu May 19, 2016 3:40 pm

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. 10! does NOT have the "11" that we need.

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

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

_________________
Contact Rich at Rich.C@empowergmat.com

prada Senior | Next Rank: 100 Posts
Joined
08 Dec 2010
Posted:
64 messages
1
Thu May 19, 2016 3:46 pm
Rich.C@EMPOWERgmat.com wrote:

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. 10! does NOT have the "11" that we need.

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

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

### Top First Responders*

1 GMATGuruNY 71 first replies
2 Rich.C@EMPOWERgma... 48 first replies
3 Brent@GMATPrepNow 37 first replies
4 Jay@ManhattanReview 26 first replies
5 ErikaPrepScholar 10 first replies
* Only counts replies to topics started in last 30 days
See More Top Beat The GMAT Members

### Most Active Experts

1 GMATGuruNY

The Princeton Review Teacher

129 posts
2 Rich.C@EMPOWERgma...

EMPOWERgmat

116 posts
3 Jeff@TargetTestPrep

Target Test Prep

106 posts
4 Max@Math Revolution

Math Revolution

92 posts
5 Scott@TargetTestPrep

Target Test Prep

92 posts
See More Top Beat The GMAT Experts