GMAT Question of the Day - Daily to your Mailbox; hard ones only

It is currently 26 Aug 2019, 02:22

Close

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
Your Progress

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

Not interested in getting valuable practice questions and articles delivered to your email? No problem, unsubscribe here.

Close

Request Expert Reply

Confirm Cancel

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

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

Hide Tags

Find Similar Topics 
Intern
Intern
avatar
Joined: 02 Aug 2016
Posts: 1
Re: If n is a positive integer and the product of all integers from 1 to n  [#permalink]

Show Tags

New post 14 Aug 2016, 07:04
1
1
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.
EMPOWERgmat Instructor
User avatar
V
Status: GMAT Assassin/Co-Founder
Affiliations: EMPOWERgmat
Joined: 19 Dec 2014
Posts: 14868
Location: United States (CA)
GMAT 1: 800 Q51 V49
GRE 1: Q170 V170
Re: If n is a positive integer and the product of all integers from 1 to n  [#permalink]

Show Tags

New post 15 Jan 2018, 13:26
Hi All,

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.

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

Final Answer:

GMAT assassins aren't born, they're made,
Rich
_________________
760+: Learn What GMAT Assassins Do to Score at the Highest Levels
Contact Rich at: Rich.C@empowergmat.com

*****Select EMPOWERgmat Courses now include ALL 6 Official GMAC CATs!*****

Rich Cohen

Co-Founder & GMAT Assassin

Special Offer: Save $75 + GMAT Club Tests Free
  Official GMAT Exam Packs + 70 Pt. Improvement Guarantee
www.empowergmat.com/
Intern
Intern
avatar
Joined: 18 Feb 2018
Posts: 1
Re: If n is a positive integer and the product of all integers from 1 to n  [#permalink]

Show Tags

New post 18 Mar 2018, 14:04
Can someone please confirm why the answer is not 10? (i.e. 5*2). I understand how to do prime factorization just want to confirm my understanding of why the answer is not 2*5. Thanks for your help.
Senior Manager
Senior Manager
User avatar
P
Status: Gathering chakra
Joined: 05 Feb 2018
Posts: 387
Premium Member CAT Tests
Re: If n is a positive integer and the product of all integers from 1 to n  [#permalink]

Show Tags

New post 21 Jan 2019, 07:56
rsciretta14 wrote:
Can someone please confirm why the answer is not 10? (i.e. 5*2). I understand how to do prime factorization just want to confirm my understanding of why the answer is not 2*5. Thanks for your help.

Let me try to explain for the sake of self-edification.

n is a +int (because negative factorial is undefined), and saying the product of all ints 1 to n is the same as saying n!

So we are looking for a n! that will equal 990*k (k is some number which has all the other factors of n!)
In other words, 1*2*3*...*n = 990*k

Prime factorization of 990 = 9*10*11 = (3^2)*(2*5)*11
So we have 1*2*3*...*n = 2*9*5*11 * k

The least possible n has to be a number that makes our equation true.
The reason it can't be 10 is because 10! won't have the prime number 11, which we need to make 990 on LHS of equation.

Writing it out:
1*2*3*4*5*6*7*8*9*10*11 = 1*2*3*_*5*_*_*_*_*_*11 *k
So for the equation to be true the other factors of n! (4, 6 [2*other 3 here], 7, 8, 9, 10) have to be in k.

Please let me know if I made an error.
Intern
Intern
avatar
B
Joined: 21 Aug 2018
Posts: 10
Location: France
GMAT 1: 390 Q22 V23
GPA: 2.8
If n is a positive integer and the product of all integers from 1 to n  [#permalink]

Show Tags

New post 17 Jul 2019, 11:06
One other way to put it is to pick answers for 990:

A): 10x99=990
B): 11x90=990 we can use 90 as a value of reference since it's the smallest multiplicator

Then any number bigger than 11 that multiplies 90 will be bigger, don't look further, B is the Answer!

I don't really understand the need to put such complicated answers that just confuse people like me who absolutely suck at maths, I really hope that one day some answers will be more straightforward rather than putting factorials and time consuming operations such as LCM calculation...
Manager
Manager
User avatar
B
Joined: 24 Sep 2018
Posts: 100
Location: India
Re: If n is a positive integer and the product of all integers from 1 to n  [#permalink]

Show Tags

New post 23 Jul 2019, 01:05
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

Question simply asking n!/ 990 :

So prime factorise 990 WE will get : 2*5*3*3*11 =990

So we need a 11 so that n! should be divisible by 990. ( B is the correct answer)
_________________
Thanks,
Bijaya

If this post is helpful for you please press the kudos button
Intern
Intern
avatar
B
Joined: 25 Nov 2018
Posts: 2
Re: If n is a positive integer and the product of all integers from 1 to n  [#permalink]

Show Tags

New post 05 Aug 2019, 18:47
Still not sure why is the answer is not 10, since it asks for the "LEAST" possible value of N? Could we say that question is asking for the biggest prime = least possible number?
EMPOWERgmat Instructor
User avatar
V
Status: GMAT Assassin/Co-Founder
Affiliations: EMPOWERgmat
Joined: 19 Dec 2014
Posts: 14868
Location: United States (CA)
GMAT 1: 800 Q51 V49
GRE 1: Q170 V170
Re: If n is a positive integer and the product of all integers from 1 to n  [#permalink]

Show Tags

New post 05 Aug 2019, 19:46
1
Hi hedgehuglove,

One of the 'restrictions' in the prompt is that the product has to be a MULTIPLE OF 990. If you multiply the integers from 1 to 10, inclusive, then you will NOT get a multiple of 990. We need to include the number 11 in that group to end up with that multiple.

GMAT assassins aren't born, they're made,
Rich
_________________
760+: Learn What GMAT Assassins Do to Score at the Highest Levels
Contact Rich at: Rich.C@empowergmat.com

*****Select EMPOWERgmat Courses now include ALL 6 Official GMAC CATs!*****

Rich Cohen

Co-Founder & GMAT Assassin

Special Offer: Save $75 + GMAT Club Tests Free
  Official GMAT Exam Packs + 70 Pt. Improvement Guarantee
www.empowergmat.com/
GMAT Club Bot
Re: If n is a positive integer and the product of all integers from 1 to n   [#permalink] 05 Aug 2019, 19:46

Go to page   Previous    1   2   [ 28 posts ] 

Display posts from previous: Sort by

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

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





Powered by phpBB © phpBB Group | Emoji artwork provided by EmojiOne