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.
It appears that you are browsing the GMAT Club forum unregistered!
Signing up is free, quick, and confidential.
Join other 500,000 members and get the full benefits of GMAT Club
Registration gives you:
Tests
Take 11 tests and quizzes from GMAT Club and leading GMAT prep companies such as Manhattan GMAT,
Knewton, and others. All are free for GMAT Club members.
Applicant Stats
View detailed applicant stats such as GPA, GMAT score, work experience, location, application
status, and more
Books/Downloads
Download thousands of study notes,
question collections, GMAT Club’s
Grammar and Math books.
All are free!
Thank you for using the timer!
We noticed you are actually not timing your practice. Click the START button first next time you use the timer.
There are many benefits to timing your practice, including:
Re: Math Questions [#permalink]
28 Dec 2009, 11:22
13
This post received KUDOS
Expert's post
11
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)..
Re: GMAT Prep q#11 need help [#permalink]
27 Feb 2010, 20:50
4
This post received 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
Re: n is a positive int and the product of all ints from 1 to n [#permalink]
01 Aug 2010, 23: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.
Re: Multiple of 990 [#permalink]
18 Sep 2010, 14:18
3
This post received 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.
Re: Multiple of 990 [#permalink]
18 Sep 2010, 14: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. _________________
Re: Math Questions [#permalink]
21 Jul 2011, 22: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)..
Answer: B.
Hope it's clear.
Why is this k introduced? Whats the concept of introducing k ?? n ! = 990 * k ?? I am confused...
Re: If n is a positive integer and the product of all the integers from 1 [#permalink]
24 Aug 2011, 08: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?
Re: If n is a positive integer and the product of all the integers from 1 [#permalink]
24 Aug 2011, 08:29
1
This post received 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
Re: If n is a positive integer and the product of all the integers from 1 [#permalink]
01 Sep 2011, 23: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
Re: If n is a positive integer and the product of all the integers from 1 [#permalink]
03 Sep 2011, 10: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
The “3 golden nuggets” of MBA admission process With ten years of experience helping prospective students with MBA admissions and career progression, I will be writing this blog through...
You know what’s worse than getting a ding at one of your dreams schools . Yes its getting that horrid wait-listed email . This limbo is frustrating as hell . Somewhere...