Mar 20 09:00 PM EDT  10:00 PM EDT Strategies and techniques for approaching featured GMAT topics. Wednesday, March 20th at 9 PM EDT Mar 20 07:00 AM PDT  09:00 AM PDT Join a FREE 1day workshop and learn how to ace the GMAT while keeping your fulltime job. Limited for the first 99 registrants. Mar 23 07:00 AM PDT  09:00 AM PDT Christina scored 760 by having clear (ability) milestones and a trackable plan to achieve the same. Attend this webinar to learn how to build trackable milestones that leverage your strengths to help you get to your target GMAT score. Mar 27 03:00 PM PDT  04:00 PM PDT Join a free live webinar and learn the winning strategy for a 700+ score on GMAT & the perfect application. Save your spot today! Wednesday, March 27th at 3 pm PST
Author 
Message 
TAGS:

Hide Tags

Intern
Joined: 18 Dec 2009
Posts: 11

If n is a positive integer and the product of all integers
[#permalink]
Show Tags
Updated on: 27 Feb 2014, 04:56
Question Stats:
81% (01:15) correct 19% (01:24) wrong based on 2742 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 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.
Official Answer and Stats are available only to registered users. Register/ Login.
Originally posted by nailgmattoefl on 28 Dec 2009, 11:47.
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: 53734

Re: Math Questions
[#permalink]
Show Tags
28 Dec 2009, 12:22




Intern
Status: Getting ready for the internship summer
Joined: 07 Jun 2009
Posts: 44
Location: Rochester, NY
Schools: Simon
WE 1: JPM  Treasury

Re: Multiple of 990
[#permalink]
Show Tags
18 Sep 2010, 15:18
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.




Manager
Joined: 26 May 2005
Posts: 186

Re: GMAT Prep q#11 need help
[#permalink]
Show Tags
27 Feb 2010, 21:50
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: 197

Re: n is a positive int and the product of all ints from 1 to n
[#permalink]
Show Tags
02 Aug 2010, 00:00
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: 55

Re: n is a positive int and the product of all ints from 1 to n
[#permalink]
Show Tags
02 Aug 2010, 07:18
990= 2x3x3x5x11 So 11 has to be one of the prime factor So 11!
_________________
+1 kudos me if this is of any help...



Retired Moderator
Joined: 02 Sep 2010
Posts: 760
Location: London

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 writeups 1) Algebra101 2) Sequences 3) Set combinatorics 4) 3D geometry
My GMAT story
GMAT Club Premium Membership  big benefits and savings



Math Expert
Joined: 02 Sep 2009
Posts: 53734

If n is a positive integer and the product of all integers
[#permalink]
Show Tags
13 Feb 2011, 18:53



Manager
Joined: 19 Jul 2011
Posts: 91
Concentration: Finance, Economics
GPA: 3.9

Re: If n is a positive integer and the product of all the integers from 1
[#permalink]
Show Tags
24 Aug 2011, 08:13
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: 11

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 I follow this. 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: 91
Concentration: Finance, Economics
GPA: 3.9

Re: If n is a positive integer and the product of all the integers from 1
[#permalink]
Show Tags
24 Aug 2011, 09:29
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: 11

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: 04 Apr 2010
Posts: 132

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: 92

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



Intern
Joined: 31 Aug 2011
Posts: 34

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: 653

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*n1*.....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: 139

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/massivecollectionofverbalquestionsscrcandcr106195.html#p832142 http://gmatclub.com/forum/1001dsquestionsfile106193.html#p832133 http://gmatclub.com/forum/gmatprepcriticalreasoningcollection106783.html http://gmatclub.com/forum/howtoget60awamyguide64327.html http://gmatclub.com/forum/howtoget60awamyguide64327.html?hilit=chineseburned



Manager
Joined: 04 Jun 2011
Posts: 152

Re: If n is a positive integer and the product of all the integers from 1
[#permalink]
Show Tags
06 Sep 2011, 13:31
SunnyDelight wrote: 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? 1960 is divisible by 10 ( or 2*5) = 196 196 is divisible by 4 = > 49 49 = 7 *7 hence 1960 is divisible by 2,4,5, 7 ,7 if there were only one 7, i.e if the problem were 280 then the least possible value that is a multiple would be 7 ( since the value is 1*2*3*4*5*6*7) i.e 280 * 3*6 however since we have 2 7's the second 7 can only be used in the digit 14.. hence the minimum value of n required will be 14 hope it helps



Math Expert
Joined: 02 Sep 2009
Posts: 53734

Re: Math Questions
[#permalink]
Show Tags
11 Apr 2012, 02:46
siddhans 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. Why is this k introduced? Whats the concept of introducing k ?? n ! = 990 * k ?? I am confused... We are told that n! is a multiple of 990, which can be expressed as n!=990*k, for some positive integer multiple k.
_________________
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



Intern
Status: K... M. G...
Joined: 22 Oct 2012
Posts: 32
Concentration: General Management, Leadership
GMAT Date: 08272013
GPA: 3.8

Re: Math Questions
[#permalink]
Show Tags
27 Oct 2012, 12:04
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.




Re: Math Questions
[#permalink]
27 Oct 2012, 12:04



Go to page
1 2 3
Next
[ 46 posts ]



