Find all School-related info fast with the new School-Specific MBA Forum

 It is currently 27 Aug 2016, 20:06

### GMAT Club Daily Prep

#### Thank you for using the timer - this advanced tool can estimate your performance and suggest more practice questions. We have subscribed you to Daily Prep Questions via email.

Customized
for You

we will pick new questions that match your level based on your Timer History

Track

every week, we’ll send you an estimated GMAT score based on your performance

Practice
Pays

we will pick new questions that match your level based on your Timer History

# Events & Promotions

###### Events & Promotions in June
Open Detailed Calendar

# If n is a positive integer and the product of all integers

 new topic post reply Question banks Downloads My Bookmarks Reviews Important topics
Author Message
TAGS:

### Hide Tags

Intern
Joined: 18 Dec 2009
Posts: 13
Followers: 0

Kudos [?]: 42 [3] , given: 0

If n is a positive integer and the product of all integers [#permalink]

### Show Tags

28 Dec 2009, 11:47
3
KUDOS
33
This post was
BOOKMARKED
00:00

Difficulty:

5% (low)

Question Stats:

80% (01:44) correct 20% (01:09) wrong based on 755 sessions

### HideShow timer Statistics

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

[Reveal] Spoiler:
I got the right answer 11 by stating:
--> 990 can be divided by 11

Is is the right way to solve that?

[Reveal] Spoiler: OA

Last edited by Bunuel on 27 Feb 2014, 04:56, edited 2 times in total.
Edited the question and added the OA
Math Expert
Joined: 02 Sep 2009
Posts: 34457
Followers: 6279

Kudos [?]: 79678 [16] , given: 10022

Re: Math Questions [#permalink]

### Show Tags

28 Dec 2009, 12:22
16
KUDOS
Expert's post
13
This post was
BOOKMARKED
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

We are told that $$n!=990*k=2*5*3^2*11*k$$ --> $$n!=2*5*3^2*11*k$$ which means that $$n!$$ must have all factors of 990 to be the multiple of 990, hence must have 11 too, so the least value of $$n$$ is 11 (notice that 11! will have all other factors of 990 as well, otherwise the least value of n would have been larger)..

Hope it's clear.
_________________
Manager
Joined: 26 May 2005
Posts: 209
Followers: 2

Kudos [?]: 110 [4] , given: 1

Re: GMAT Prep q#11 need help [#permalink]

### Show Tags

27 Feb 2010, 21:50
4
KUDOS
divanshuj wrote:
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 for n?

a) 10
b) 11
c) 12
d) 13
e) 14

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
Manager
Joined: 16 Apr 2010
Posts: 221
Followers: 4

Kudos [?]: 110 [1] , given: 12

Re: n is a positive int and the product of all ints from 1 to n [#permalink]

### Show Tags

02 Aug 2010, 00:00
1
KUDOS
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
Manager
Joined: 06 Oct 2009
Posts: 69
Followers: 2

Kudos [?]: 34 [2] , given: 5

Re: n is a positive int and the product of all ints from 1 to n [#permalink]

### Show Tags

02 Aug 2010, 07:18
2
KUDOS
990= 2x3x3x5x11
So 11 has to be one of the prime factor
So 11!
_________________

+1 kudos me if this is of any help...

Manager
Status: Getting ready for the internship summer
Joined: 07 Jun 2009
Posts: 51
Location: Rochester, NY
Schools: Simon
WE 1: JPM - Treasury
Followers: 0

Kudos [?]: 23 [4] , given: 23

Re: Multiple of 990 [#permalink]

### Show Tags

18 Sep 2010, 15:18
4
KUDOS
This question tests the concept of prime factorization. In order to figure out if 990 can be a divisor of the unknown product you need to determine all of the prime factors that combine to successfully divide 990 without leaving a remainder.

The prime factors of 990 are 2, 3, 3, 5, 11

Since 11 is a prime factor of 990, you need to have the number present somewhere in the unknown product. Answer A is the product of integers from 1 to 10 and therefore does not meet the necessary criteria. Answer B includes 11 and therefore is the answer.
Retired Moderator
Joined: 02 Sep 2010
Posts: 805
Location: London
Followers: 101

Kudos [?]: 858 [0], given: 25

Re: Multiple of 990 [#permalink]

### Show Tags

18 Sep 2010, 15:59
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.
_________________
Math Expert
Joined: 02 Sep 2009
Posts: 34457
Followers: 6279

Kudos [?]: 79678 [0], given: 10022

Re: If n is a positive integer... [#permalink]

### Show Tags

13 Feb 2011, 18:53
Expert's post
1
This post was
BOOKMARKED
Merging similar topics.

Also check: property-of-integers-104272.html
_________________
Senior Manager
Joined: 29 Jan 2011
Posts: 367
Followers: 0

Kudos [?]: 169 [0], given: 87

Re: Math Questions [#permalink]

### Show Tags

21 Jul 2011, 23:49
Bunuel wrote:
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

We are told that $$n!=990*k=2*5*3^2*11*k$$ --> $$n!=2*5*3^2*11*k$$ which means that $$n!$$ must have all factors of 990 to be the multiple of 990, hence must have 11 too, so the least value of $$n$$ is 11 (notice that 11! will have all other factors of 990 as well, otherwise the least value of n would have been larger)..

Hope it's clear.

Why is this k introduced? Whats the concept of introducing k ?? n ! = 990 * k ?? I am confused...
Intern
Joined: 09 Feb 2011
Posts: 12
Followers: 0

Kudos [?]: 4 [0], given: 2

If n is a positive integer and the product of all the integers from 1 [#permalink]

### Show Tags

24 Aug 2011, 07:27
2
This post was
BOOKMARKED
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?

a) 10
b) 11
c) 12
d) 13
e) 14
Manager
Joined: 19 Jul 2011
Posts: 99
Concentration: Finance, Economics
Schools: Duke '15
GPA: 3.9
Followers: 0

Kudos [?]: 66 [1] , given: 4

Re: If n is a positive integer and the product of all the integers from 1 [#permalink]

### Show Tags

24 Aug 2011, 08:13
1
KUDOS
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
_________________

Show Thanks to fellow members with Kudos its shows your appreciation and its free

Intern
Joined: 09 Feb 2011
Posts: 12
Followers: 0

Kudos [?]: 4 [0], given: 2

Re: If n is a positive integer and the product of all the integers from 1 [#permalink]

### Show Tags

24 Aug 2011, 09:01
Here's my understanding of the term of multiple. If a number Y can be divided into another number X without a remainder resulting it is considered a factor of that number. Likewise, if a number X can be divided by another number Y cleanly then X is a considered a multiple of Y.

Now this is what I don't understand. The question reads:
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?

So when I first saw this I interpreted it as (1*2*3........*n)/990 should end up without a remainder. I interpreted it this way because the question read "the product of all integers from 1 to n, inclusive." Then the question asked for what the smallest value of n could be, which confused me.

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

Quote:
By knowing 11 is an prime, we know the answer can be B,C,D or E as these all contain 990.

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.

This is where I get lost. I understand that the series of 1 to 11 contains all the prime numbers that are factors of 990. But how did you reach the conclusion that the answer is 11?

I guess what I don't understand is how you were able to interpret the question the way you did? Is it just from experience of lots of practice problems?

Or in the worst case scenario where I don't understand the question and just memorize the question format, I have two follow questions:

Lets say the question read:
Quote:
If n is a positive integer and the product of all the integers from 1 to n, inclusive, is a multiple of 2890, what is the least possible value of n?

Would the answer in this situation be 17 in this case (assuming it was an option)

Or alternatively if the question read:
Quote:
If n is a positive integer and the product of all the integers from 1 to n, inclusive, is a multiple of 1960, what is the least possible value of n?

How would you solve that?
Manager
Joined: 19 Jul 2011
Posts: 99
Concentration: Finance, Economics
Schools: Duke '15
GPA: 3.9
Followers: 0

Kudos [?]: 66 [1] , given: 4

Re: If n is a positive integer and the product of all the integers from 1 [#permalink]

### Show Tags

24 Aug 2011, 09:29
1
KUDOS
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.
_________________

Show Thanks to fellow members with Kudos its shows your appreciation and its free

Intern
Joined: 09 Feb 2011
Posts: 12
Followers: 0

Kudos [?]: 4 [0], given: 2

Re: If n is a positive integer and the product of all the integers from 1 [#permalink]

### Show Tags

24 Aug 2011, 09:50
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.
Manager
Joined: 19 Jul 2011
Posts: 99
Concentration: Finance, Economics
Schools: Duke '15
GPA: 3.9
Followers: 0

Kudos [?]: 66 [0], given: 4

Re: If n is a positive integer and the product of all the integers from 1 [#permalink]

### Show Tags

24 Aug 2011, 10:31
Use the GMATClub Math Guide its guide you through basic areas like this well.
_________________

Show Thanks to fellow members with Kudos its shows your appreciation and its free

Manager
Joined: 04 Apr 2010
Posts: 162
Followers: 1

Kudos [?]: 152 [0], given: 31

Re: If n is a positive integer and the product of all the integers from 1 [#permalink]

### Show Tags

24 Aug 2011, 11:23
990= 3*11*5*6 N must be 11 to satisfy the condition. Hence B is the answer.
_________________

Consider me giving KUDOS, if you find my post helpful.
If at first you don't succeed, you're running about average. ~Anonymous

Manager
Joined: 06 Jun 2011
Posts: 157
Followers: 1

Kudos [?]: 48 [0], given: 15

Re: If n is a positive integer and the product of all the integers from 1 [#permalink]

### Show Tags

02 Sep 2011, 00:00
Using trial and error method clearly we need to see how we can calculate 990 by using consecutive integers. Clearly for 990 a prime factor is 11 so we must need it.
9*10*11=990 and multiplying it with other +ve integers will result in a # which is always a multiple of 11.

So 11 is the answer.In this way the problem can be solved quickly.
Let me know if this helps
Manager
Joined: 31 Aug 2011
Posts: 52
Followers: 0

Kudos [?]: 7 [0], given: 18

Re: If n is a positive integer and the product of all the integers from 1 [#permalink]

### Show Tags

02 Sep 2011, 00:57
prime factorization of 990=3*3*11*2*5

As the product of 1 through n inclusive is a multiple of 990, the least number that n could be is 11.
Director
Joined: 01 Feb 2011
Posts: 757
Followers: 14

Kudos [?]: 100 [0], given: 42

Re: If n is a positive integer and the product of all the integers from 1 [#permalink]

### Show Tags

02 Sep 2011, 09:24
990 = 2*3^2*5*11

1*2*.....n = multiple of 990

=> n*n-1*.....1 = multiple of 990

=> n! = multiple of 990

= 2*3^2*5*11 * p (some multiple p)

and we have to find a minimum value for n that satisfies the above condition.

which tells us n! needs to have all prime factors of 990 .i.e 2,3,5,11 prime factors.

=> minimum value of n is 11.
Manager
Joined: 20 Nov 2010
Posts: 224
Followers: 4

Kudos [?]: 19 [0], given: 38

Re: If n is a positive integer and the product of all the integers from 1 [#permalink]

### Show Tags

03 Sep 2011, 11:11
Since we need to find the minimum value of n, So the greatest prime factor of 990 will be the answer.
990 = 2 * 3^2 * 5 * 11.
Hence the minimum value of n such that n! ( 1*2* ... *n) is divisible by 990 is 11.
_________________

~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
MGMAT 6 650 (51,31) on 31/8/11
MGMAT 1 670 (48,33) on 04/9/11
MGMAT 2 670 (47,34) on 07/9/11
MGMAT 3 680 (47,35) on 18/9/11
GMAT Prep1 680 ( 50, 31) on 10/11/11

~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
CR notes
http://gmatclub.com/forum/massive-collection-of-verbal-questions-sc-rc-and-cr-106195.html#p832142
http://gmatclub.com/forum/1001-ds-questions-file-106193.html#p832133
http://gmatclub.com/forum/gmat-prep-critical-reasoning-collection-106783.html
http://gmatclub.com/forum/how-to-get-6-0-awa-my-guide-64327.html
http://gmatclub.com/forum/how-to-get-6-0-awa-my-guide-64327.html?hilit=chineseburned

Re: If n is a positive integer and the product of all the integers from 1   [#permalink] 03 Sep 2011, 11:11

Go to page    1   2   3    Next  [ 48 posts ]

Similar topics Replies Last post
Similar
Topics:
61 n is a positive integer, and k is the product of all integer 15 04 Nov 2010, 18:15
65 If the product of all the factors of a positive integer, N 23 25 Oct 2010, 08:24
If n is a positive integer and the product of all integers 4 07 Nov 2009, 11:02
9 n is a positive integer, and k is the product of all integer 11 28 Sep 2009, 19:49
If n is a positive integer and the product of all the intege 7 17 Oct 2007, 08:44
Display posts from previous: Sort by

# If n is a positive integer and the product of all integers

 new topic post reply Question banks Downloads My Bookmarks Reviews Important topics

 Powered by phpBB © phpBB Group and phpBB SEO Kindly note that the GMAT® test is a registered trademark of the Graduate Management Admission Council®, and this site has neither been reviewed nor endorsed by GMAC®.