Author 
Message 
TAGS:

Hide Tags

Math Expert
Joined: 02 Sep 2009
Posts: 43810

Re: Math Questions [#permalink]
Show Tags
29 Oct 2012, 05:25
breakit wrote: 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)..
Answer: B.
Hope it's clear. out of curiousness, i would like to clarify something here. In case if we have a option like (i know option are pathetic) A. 2 B. 5 C. 11 D. 13 E. any option.. then what would be the answer.. BTW when i try to solve this question i was only having the question(without option) , I took the prime factor stuff & chosen the least one from that.. please help me here to understand more. We are asked about the least possible value of n. The least value of n is 11. Answer choices have nothing to do with that.
_________________
New to the Math Forum? Please read this: Ultimate GMAT Quantitative Megathread  All You Need for Quant  PLEASE READ AND FOLLOW: 12 Rules for Posting!!! Resources: GMAT Math Book  Triangles  Polygons  Coordinate Geometry  Factorials  Circles  Number Theory  Remainders; 8. Overlapping Sets  PDF of Math Book; 10. Remainders  GMAT Prep Software Analysis  SEVEN SAMURAI OF 2012 (BEST DISCUSSIONS)  Tricky questions from previous years.
Collection of Questions: PS: 1. Tough and Tricky questions; 2. Hard questions; 3. Hard questions part 2; 4. Standard deviation; 5. Tough Problem Solving Questions With Solutions; 6. Probability and Combinations Questions With Solutions; 7 Tough and tricky exponents and roots questions; 8 12 Easy Pieces (or not?); 9 Bakers' Dozen; 10 Algebra set. ,11 Mixed Questions, 12 Fresh Meat DS: 1. DS tough questions; 2. DS tough questions part 2; 3. DS tough questions part 3; 4. DS Standard deviation; 5. Inequalities; 6. 700+ GMAT Data Sufficiency Questions With Explanations; 7 Tough and tricky exponents and roots questions; 8 The Discreet Charm of the DS; 9 Devil's Dozen!!!; 10 Number Properties set., 11 New DS set.
What are GMAT Club Tests? Extrahard Quant Tests with Brilliant Analytics



Director
Status: Gonna rock this time!!!
Joined: 22 Jul 2012
Posts: 502
Location: India
GMAT 1: 640 Q43 V34 GMAT 2: 630 Q47 V29
WE: Information Technology (Computer Software)

Re: Math Questions [#permalink]
Show Tags
25 Jan 2013, 01:29
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)..
Answer: B.
Hope it's clear. to cement my understanding, maximum value of n can be anything, right?
_________________
hope is a good thing, maybe the best of things. And no good thing ever dies.
Who says you need a 700 ?Check this out : http://gmatclub.com/forum/whosaysyouneeda149706.html#p1201595
My GMAT Journey : http://gmatclub.com/forum/endofmygmatjourney149328.html#p1197992



Math Expert
Joined: 02 Sep 2009
Posts: 43810

Re: Math Questions [#permalink]
Show Tags
25 Jan 2013, 03:51
Sachin9 wrote: 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)..
Answer: B.
Hope it's clear. to cement my understanding, maximum value of n can be anything, right? The maximum value of n is not limited at all. For all n more than or equal to 11, n! will be a multiple of 990.
_________________
New to the Math Forum? Please read this: Ultimate GMAT Quantitative Megathread  All You Need for Quant  PLEASE READ AND FOLLOW: 12 Rules for Posting!!! Resources: GMAT Math Book  Triangles  Polygons  Coordinate Geometry  Factorials  Circles  Number Theory  Remainders; 8. Overlapping Sets  PDF of Math Book; 10. Remainders  GMAT Prep Software Analysis  SEVEN SAMURAI OF 2012 (BEST DISCUSSIONS)  Tricky questions from previous years.
Collection of Questions: PS: 1. Tough and Tricky questions; 2. Hard questions; 3. Hard questions part 2; 4. Standard deviation; 5. Tough Problem Solving Questions With Solutions; 6. Probability and Combinations Questions With Solutions; 7 Tough and tricky exponents and roots questions; 8 12 Easy Pieces (or not?); 9 Bakers' Dozen; 10 Algebra set. ,11 Mixed Questions, 12 Fresh Meat DS: 1. DS tough questions; 2. DS tough questions part 2; 3. DS tough questions part 3; 4. DS Standard deviation; 5. Inequalities; 6. 700+ GMAT Data Sufficiency Questions With Explanations; 7 Tough and tricky exponents and roots questions; 8 The Discreet Charm of the DS; 9 Devil's Dozen!!!; 10 Number Properties set., 11 New DS set.
What are GMAT Club Tests? Extrahard Quant Tests with Brilliant Analytics



Manager
Joined: 21 Jun 2011
Posts: 77
Location: United States
Concentration: Accounting, Finance
WE: Accounting (Accounting)

Re: Math Questions [#permalink]
Show Tags
14 Jul 2013, 23:29
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)..
Answer: B.
Hope it's clear. Hi Bunuel, I am not sure why have excluded 10, which seems to be one of the factors (5*2).



Math Expert
Joined: 02 Sep 2009
Posts: 43810

Re: Math Questions [#permalink]
Show Tags
14 Jul 2013, 23:33
davidfrank wrote: 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)..
Answer: B.
Hope it's clear. Hi Bunuel, I am not sure why have excluded 10, which seems to be one of the factors (5*2). n! must be a multiple of 990=90* 11. Now, if n=10, then it wont have 11 as its factor, so it cannot be a multiple of a number which HAS 11 as its factor. Hope it's clear.
_________________
New to the Math Forum? Please read this: Ultimate GMAT Quantitative Megathread  All You Need for Quant  PLEASE READ AND FOLLOW: 12 Rules for Posting!!! Resources: GMAT Math Book  Triangles  Polygons  Coordinate Geometry  Factorials  Circles  Number Theory  Remainders; 8. Overlapping Sets  PDF of Math Book; 10. Remainders  GMAT Prep Software Analysis  SEVEN SAMURAI OF 2012 (BEST DISCUSSIONS)  Tricky questions from previous years.
Collection of Questions: PS: 1. Tough and Tricky questions; 2. Hard questions; 3. Hard questions part 2; 4. Standard deviation; 5. Tough Problem Solving Questions With Solutions; 6. Probability and Combinations Questions With Solutions; 7 Tough and tricky exponents and roots questions; 8 12 Easy Pieces (or not?); 9 Bakers' Dozen; 10 Algebra set. ,11 Mixed Questions, 12 Fresh Meat DS: 1. DS tough questions; 2. DS tough questions part 2; 3. DS tough questions part 3; 4. DS Standard deviation; 5. Inequalities; 6. 700+ GMAT Data Sufficiency Questions With Explanations; 7 Tough and tricky exponents and roots questions; 8 The Discreet Charm of the DS; 9 Devil's Dozen!!!; 10 Number Properties set., 11 New DS set.
What are GMAT Club Tests? Extrahard Quant Tests with Brilliant Analytics



Current Student
Joined: 26 Aug 2014
Posts: 827
Concentration: Marketing
Schools: HBS '17 (S), Kellogg '17 (M), Booth '17 (A), CBS '17 (D), Insead Sept '16 (D), HEC Sept'16 (A), CnsrtmAnderson '17 (A), CnsrtmStern '17 (D), CnsrtmKenanFlagler '17 (A), CnsrtmMarshall '17 (A), CnsrtmYale '17 (D), CnsrtmRoss '17 (A)
GPA: 3.4

Re: If n is a positive integer and the product of all integers [#permalink]
Show Tags
19 Oct 2014, 15:11
can somebody explain this in plain English. I think I can follow what people are saying but I don't really understand the concept so I'm not sure i'll be able to apply it to another problem. I don't want to know why 11 but what is the thought process/logic behind this question (much props to explanations without lengthy formulas).



SVP
Joined: 08 Jul 2010
Posts: 1955
Location: India
GMAT: INSIGHT
WE: Education (Education)

If n is a positive integer and the product of all the integers from 1 [#permalink]
Show Tags
20 Oct 2015, 03:31
Bunuel wrote: If n is a positive integer and the product of all the integers from 1 to n, inclusive, is divisible by 990, what is the least possible value of n?
(A) 8 (B) 9 (C) 10 (D) 11 (E) 12
Kudos for a correct solution. Bunuel: I guess, I have seen this question on GMAT CLUB before ifnisapositiveintegerandtheproductofallintegers90855.html product of all the integers from 1 to n = n! 990 = 9*10*11 i.e. n! must be divisible by 9, 10 and 11 all for n! to be divisible by 990 i.e. minimum value of n must be 11 for n! to be divisible by 11 and 10 and 9 both P.S. 11!= 11*10*9*8*7*6*5*4*3*2*1 n = 11 Answer: option D
_________________
Prosper!!! GMATinsight Bhoopendra Singh and Dr.Sushma Jha email: info@GMATinsight.com I Call us : +919999687183 / 9891333772 Online OneonOne Skype based classes and Classroom Coaching in South and West Delhi http://www.GMATinsight.com/testimonials.html
22 ONLINE FREE (FULL LENGTH) GMAT CAT (PRACTICE TESTS) LINK COLLECTION



Senior Manager
Joined: 13 Apr 2013
Posts: 263
Location: India
Concentration: International Business, Operations
GPA: 3.01
WE: Engineering (Consulting)

Re: If n is a positive integer and the product of all the integers from 1 [#permalink]
Show Tags
20 Oct 2015, 04:28
Bunuel wrote: If n is a positive integer and the product of all the integers from 1 to n, inclusive, is divisible by 990, what is the least possible value of n?
(A) 8 (B) 9 (C) 10 (D) 11 (E) 12
Kudos for a correct solution. My Solution:
Prime factorization of 990 gives us = 2 x 3 x 3 x 5 x 11
Therefore, if n! is divisible by 990 it must contain all above factors.
Option A , B and C don't contain 11 as factor. So least value of n must be 11 as 11! contains all possible factors.
Answer is D
_________________
"Success is not as glamorous as people tell you. It's a lot of hours spent in the darkness."



Retired Moderator
Joined: 29 Apr 2015
Posts: 888
Location: Switzerland
Concentration: Economics, Finance
WE: Asset Management (Investment Banking)

Re: If n is a positive integer and the product of all the integers from 1 [#permalink]
Show Tags
20 Oct 2015, 05:05
Bunuel wrote: If n is a positive integer and the product of all the integers from 1 to n, inclusive, is divisible by 990, what is the least possible value of n?
(A) 8 (B) 9 (C) 10 (D) 11 (E) 12
Kudos for a correct solution. First of all, select all prime factors of 990. Those are 2, 5, 3^2 and 11. Since the product of 1 to n is divisible by 990, it has all prime factors of 990. Therefore the least possible value of n is 11. Answer D.
_________________
Saving was yesterday, heat up the gmatclub.forum's sentiment by spending KUDOS!
PS Please send me PM if I do not respond to your question within 24 hours.



SVP
Joined: 11 Sep 2015
Posts: 2051
Location: Canada

Re: If n is a positive integer and the product of all the integers from 1 [#permalink]
Show Tags
20 Oct 2015, 06:17
Bunuel wrote: If n is a positive integer and the product of all the integers from 1 to n, inclusive, is divisible by 990, what is the least possible value of n?
(A) 8 (B) 9 (C) 10 (D) 11 (E) 12
Kudos for a correct solution. 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 NConsider these examples: 24 is divisible by 3 because 24 = (2)(2)(2) (3)Likewise, 70 is divisible by 5 because 70 = (2) (5)(7) And 112 is divisible by 8 because 112 = (2) (2)(2)(2)(7) And 630 is divisible by 15 because 630 = (2)(3) (3)(5)(7) For more on this concept, see the 2nd half of this free video: http://www.gmatprepnow.com/module/gmat ... /video/825So, 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 D Cheers, Brent
_________________
Brent Hanneson – Founder of gmatprepnow.com



Intern
Joined: 01 Mar 2015
Posts: 49

Re: If n is a positive integer and the product of all the integers from 1 [#permalink]
Show Tags
20 Oct 2015, 21:40
Bunuel wrote: If n is a positive integer and the product of all the integers from 1 to n, inclusive, is divisible by 990, what is the least possible value of n?
(A) 8 (B) 9 (C) 10 (D) 11 (E) 12
Kudos for a correct solution. 990 = 2 * 3 * 3 * 5 * 11so integers less than n should contain all factors 990 there fore least value of n should be 11 Answer choice D



Manager
Joined: 20 Aug 2015
Posts: 65

If n is a positive integer and the product of all the integers from 1 [#permalink]
Show Tags
23 Oct 2015, 06:51
990= 3^2 * 11 * 2 * 5
Product of all the integers from 1 to n = factorial (n). Since n! is divisible by 990, its expansion should contain all factors of 990.
Since we need the least possible value of n, the answer is 11.
Option D.



SVP
Joined: 11 Sep 2015
Posts: 2051
Location: Canada

Re: If n is a positive integer and the product of all integers [#permalink]
Show Tags
09 Jan 2016, 09:54
Quote: 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 NSimilarly, we can say: If N is is a multiple of k, then k is "hiding" within the prime factorization of NExamples: 24 is divisible by 3 <> 24 = (2)(2)(2) (3)70 is divisible by 5 <> 70 = (2) (5)(7) 330 is divisible by 6 <> 330 = (2)(3)(5)(11) 56 is divisible by 8 <> 56 = (2)(2)(2)(7) 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



Target Test Prep Representative
Status: Founder & CEO
Affiliations: Target Test Prep
Joined: 14 Oct 2015
Posts: 2181
Location: United States (CA)

Re: If n is a positive integer and the product of all integers [#permalink]
Show Tags
03 May 2016, 10:47
nailgmattoefl 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 I got the right answer 11 by stating: > 990 can be divided by 11
Is is the right way to solve that?
Thanks in advance. Solution: We are given that the product of all integers from 1 to n, inclusive, (i.e., n!) is a multiple of 990. Thus, n! = 990 x k for some integer k. Another way to visualize the given information is to say: n!/990 must be an integer. Thus, n! must contain all the factors of 990. Notice that 990 = 99 x 10 = 9 x 11 x 10. So in order for n!/990 to be an integer, n must at least be equal to 11, since 11! = 11 x 10 x 9 x … x 3 x 2 x 1. Answer: B
_________________
Scott WoodburyStewart
Founder and CEO
GMAT Quant SelfStudy Course
500+ lessons 3000+ practice problems 800+ HD solutions



Intern
Joined: 02 Aug 2016
Posts: 1

Re: If n is a positive integer and the product of all integers [#permalink]
Show Tags
14 Aug 2016, 06:04
1
This post received KUDOS
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.



Intern
Joined: 18 Jun 2013
Posts: 41
Location: India
Concentration: Technology, General Management
GPA: 3.2
WE: Information Technology (Consulting)

Re: If n is a positive integer and the product of all integers [#permalink]
Show Tags
26 Sep 2017, 12:10
Question can be restated as for what smallest value of n is n! a factor of 990
990 = 3.3.11.2.5
minimum we need 11! for 990 hence the answer is 11.



Manager
Joined: 09 Mar 2016
Posts: 223

Re: If n is a positive integer and the product of all integers [#permalink]
Show Tags
26 Nov 2017, 03:15
1
This post was BOOKMARKED
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)..
Answer: B.
Hope it's clear. Bunuel hello! is there a shortcut for prime factorization ? for example you wrote \(n!=990*k=2*5*3^2*11*k\)  Did you write it after using prime factorization tree method ? Or some other method ? thanks and have a great day! D



Intern
Joined: 15 Sep 2017
Posts: 8

Re: If n is a positive integer and the product of all integers [#permalink]
Show Tags
04 Jan 2018, 14:31
Why is it not 3^2=9?
Posted from my mobile device



Manager
Joined: 23 Oct 2017
Posts: 65

Re: If n is a positive integer and the product of all integers [#permalink]
Show Tags
04 Jan 2018, 18:06
SamDGold wrote: Why is it not 3^2=9?
Posted from my mobile device  3^2 is not equal to 9, because 990 was broken into its prime factors. (9 is not a prime number, hence expressed as 3^2) eg. 48 =(2^4)*(3^1) here 2,3 are prime factors and 48 expressed in terms of 2 & 3 and not as 2^4 which would be simple factorization As for solution: The question asks for product of all integers from 1 to n (inclusive) => which is n! Now to reframe the question: For which value of does n! be a multiple 990 ? On looking at 990, we can break it as 990 =99 * 100 =(9*11)*10 =9*10*11 so you need to have 11,10 & 9 appearing in n!, which is only possible for n>=11



EMPOWERgmat Instructor
Status: GMAT Assassin/CoFounder
Affiliations: EMPOWERgmat
Joined: 19 Dec 2014
Posts: 11036
Location: United States (CA)
GRE 1: 340 Q170 V170

Re: If n is a positive integer and the product of all integers [#permalink]
Show Tags
15 Jan 2018, 12: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
Rich Cohen
CoFounder & GMAT Assassin
Special Offer: Save $75 + GMAT Club Tests Free
Official GMAT Exam Packs + 70 Pt. Improvement Guarantee www.empowergmat.com/
***********************Select EMPOWERgmat Courses now include ALL 6 Official GMAC CATs!***********************




Re: If n is a positive integer and the product of all integers
[#permalink]
15 Jan 2018, 12:26



Go to page
Previous
1 2
[ 40 posts ]



