Tuck School is Calling Admits (Join Chat #3) | Final Decisions are Expected from Stanford (Chat #2) & Haas (Chat #7)
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.
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:
Enter The Economist GMAT Tutor’s Brightest Minds competition – it’s completely free! All you have to do is take our online GMAT simulation test and put your mind to the test. Are you ready? This competition closes on December 13th.
Attend a Veritas Prep GMAT Class for Free. With free trial classes you can work with a 99th percentile expert free of charge. Learn valuable strategies and find your new favorite instructor; click for a list of upcoming dates and teachers.
Does GMAT RC seem like an uphill battle? e-GMAT is conducting a free webinar to help you learn reading strategies that can enable you to solve 700+ level RC questions with at least 90% accuracy in less than 10 days.
Let S be the set of all positive integer divisors of 100,000. How many
[#permalink]
Show Tags
01 Apr 2019, 00:20
3
OhsostudiousMJ wrote:
Archit3110 wrote:
Noshad wrote:
Let S be the set of all positive integer divisors of 100,000. How many numbers are the product of two distinct elements of S?
A. 98
B.100
C. 117
D. 119
E. 121
factors of 10^5 = 2^5*5^5; total factors = 36 i am not able to solve further this question GMATinsight ; sir please advise on the solution
How do you determine the total factors to be 36? Kindly explain..
By prime factorising 1,00,000
1,00,000 can be written as 10^5 Further break 10^5 into (2*5)^5 2^5 * 5^5.. when you have a number in the form of a^p * b^q * c^r ..... The total number of factors of that number will be (p+1)(q+1).....
Re: Let S be the set of all positive integer divisors of 100,000. How many
[#permalink]
Show Tags
01 Apr 2019, 00:28
thyagi wrote:
By prime factorising 1,00,000
1,00,000 can be written as 10^5 Further break 10^5 into (2*5)^5 2^5 * 5^5.. when you have a number in the form of a^p * b^q * c^r ..... The total number of factors of that number will be (p+1)(q+1).....
Re: Let S be the set of all positive integer divisors of 100,000. How many
[#permalink]
Show Tags
05 Apr 2019, 02:03
2
Noshad wrote:
Let S be the set of all positive integer divisors of 100,000. How many numbers are the product of two distinct elements of S?
A. 98
B.100
C. 117
D. 119
E. 121
100,000 = 10^5 = 2^5 * 5^5
No of distinct factors = 6*6 = 36 These are: 1, 2^1, 2^2, 5, 2^3, 2^1*5^1, 2^4, 5^2, ...
When you multiply any two of these, you will get a product with powers of 2 and/or 5. Since 2^5 and 5^5 are the maximum powers of 2 and 5, the power of either that you can get ranges from 0 to 10.
This gives us 11*11 = 121 numbers
But no number can be multiplied by itself so the largest and smallest powers of 2 and 5 will not multiply with themselves.
Hence, you will not get the following 4 numbers:
2^10 * 5^10 (because there is only one 2^5 * 5^5)
2^10 (because there is only one 2^5)
5^10 (because there is only one 5^5)
2^0*5^0 (because there is only one 2^0*5^0)
So in all, you will have 117 numbers.
Answer (C)
_________________
Karishma Veritas Prep GMAT Instructor
Learn more about how Veritas Prep can help you achieve a great GMAT score by checking out their GMAT Prep Options >
Re: Let S be the set of all positive integer divisors of 100,000. How many
[#permalink]
Show Tags
06 Apr 2019, 23:53
VeritasKarishma wrote:
Noshad wrote:
Let S be the set of all positive integer divisors of 100,000. How many numbers are the product of two distinct elements of S?
A. 98
B.100
C. 117
D. 119
E. 121
100,000 = 10^5 = 2^5 * 5^5
No of distinct factors = 6*6 = 36 These are: 1, 2^1, 2^2, 5, 2^3, 2^1*5^1, 2^4, 5^2, ...
When you multiply any two of these, you will get a product with powers of 2 and/or 5. Since 2^5 and 5^5 are the maximum powers of 2 and 5, the power of either that you can get ranges from 0 to 10.
This gives us 11*11 = 121 numbers
But no number can be multiplied by itself so the largest and smallest powers of 2 and 5 will not multiply with themselves.
-------------------------------------------------------------------------------------------------------------------------- All the Gods, All the Heavens, and All the Hells lie within you.
Re: Let S be the set of all positive integer divisors of 100,000. How many
[#permalink]
Show Tags
07 Apr 2019, 01:02
VeritasKarishma ; hello ma'am.. I am not able to understand from the highlighted part onwards.. a. how did 121 numbers come up? b. 2^10 , 5^10 are the highest power but how did you deduce to 117 numbers
GMATinsight ; sir if possible kindly look into the question and assist.
VeritasKarishma wrote:
Noshad wrote:
Let S be the set of all positive integer divisors of 100,000. How many numbers are the product of two distinct elements of S?
A. 98
B.100
C. 117
D. 119
E. 121
100,000 = 10^5 = 2^5 * 5^5
No of distinct factors = 6*6 = 36 These are: 1, 2^1, 2^2, 5, 2^3, 2^1*5^1, 2^4, 5^2, ...
When you multiply any two of these, you will get a product with powers of 2 and/or 5. Since 2^5 and 5^5 are the maximum powers of 2 and 5, the power of either that you can get ranges from 0 to 10.
This gives us 11*11 = 121 numbers
But no number can be multiplied by itself so the largest and smallest powers of 2 and 5 will not multiply with themselves.
Hence, you will not get the following 4 numbers:
2^10 * 5^10 (because there is only one 2^5 * 5^5) 2^10 (because there is only one 2^5)
Let S be the set of all positive integer divisors of 100,000. How many
[#permalink]
Show Tags
Updated on: 07 Apr 2019, 02:51
2
1
Archit3110 wrote:
VeritasKarishma ; hello ma'am.. I am not able to understand from the highlighted part onwards.. a. how did 121 numbers come up? b. 2^10 , 5^10 are the highest power but how did you deduce to 117 numbers
GMATinsight ; sir if possible kindly look into the question and assist.
VeritasKarishma wrote:
Noshad wrote:
Let S be the set of all positive integer divisors of 100,000. How many numbers are the product of two distinct elements of S?
A. 98
B.100
C. 117
D. 119
E. 121
100,000 = 10^5 = 2^5 * 5^5
No of distinct factors = 6*6 = 36 These are: 1, 2^1, 2^2, 5, 2^3, 2^1*5^1, 2^4, 5^2, ...
When you multiply any two of these, you will get a product with powers of 2 and/or 5. Since 2^5 and 5^5 are the maximum powers of 2 and 5, the power of either that you can get ranges from 0 to 10.
This gives us 11*11 = 121 numbers
But no number can be multiplied by itself so the largest and smallest powers of 2 and 5 will not multiply with themselves.
Hence, you will not get the following 4 numbers:
2^10 * 5^10 (because there is only one 2^5 * 5^5) 2^10 (because there is only one 2^5)
5^10 (because there is only one 5^5)
2^0*5^0 (because there is only one 2^0*5^0)
So in all, you will have 117 numbers.
Answer (C)
Calculation of Number of Factors For a Number \(N=a^p*b^q*c^r*...\)where a, b, c etc are distinct prime factors of n and p, q r are their respective exponents The number of factors of \(N = (p+1)*(q+1)*(r+1)*...\) and so on
i.e. \(100,000 = 10^5 = 2^5 * 5^5\)
hence, total factors of 100000 = (5+1)*(5+1) = 36
i.e. S = {1, \(2^1\), \(2^2\), \(5^1\), \(2^3\), \(2^1*5^1\), \(2^4\), \(2^2*5\)........100000} 36 elements in S
The biggest terms of the set are \(2^5*5^5\) and \(2^4*5^5\) and \(2^5*5^4\)
i.e. the biggest product of two terms in set S will be \(2^5*5^5\)*\(2^4*5^5\) and \(2^5*5^5\)*\(2^5*5^4\)
i.e. Biggest terms of the product will be \(2^9*5^{10}\) and \(2^{10}*5^9\)
i.e. \(2^0\), \(2^1\), \(2^2\)--- \(2^{10}\) etc. will have combination with \(5^0\) i.e. 11 combinations Similarly, i.e. \(2^0\), \(2^1\), \(2^2\)--- \(2^{10}\) etc. will have combination with \(5^1\) i.e. 11 combinations Similarly, i.e. \(2^0\), \(2^1\), \(2^2\)--- \(2^{10}\) etc. will have combination with \(5^2\) i.e. 11 combinations and so on...
i.e. \(2^0\), \(2^1\), \(2^2\)--- \(2^{10}\) etc. will have combination with \(5^{10}\) i.e. 11 combinations
i.e. Total combinations = 11*11 = 121
But as already mentioned the combinations that are not possible but included here are \(2^{10}*5^{10}\) and \(2^0*5^0\) and \(2^{10}\) and \(5^{10}\)
Prosper!!! GMATinsight Bhoopendra Singh and Dr.Sushma Jha e-mail: info@GMATinsight.com I Call us : +91-9999687183 / 9891333772 Online One-on-One Skype based classes and Classroom Coaching in South and West Delhi http://www.GMATinsight.com/testimonials.html
Let S be the set of all positive integer divisors of 100,000. How many
[#permalink]
Show Tags
07 Apr 2019, 02:38
1
GMATinsight ; thanks for the solution , this surely is a unique question not sure whether is GMAT type or not as it involves a lot of combining of pairs of factors solving under 120 sec would be really challenging..
Noshad ; whats the source of this question? is it really from gmat source ? I actually googled this question and it comes up to be a question from American mathematic association /olympiad, is it so?
gmatclubot
Let S be the set of all positive integer divisors of 100,000. How many
[#permalink]
07 Apr 2019, 02:38
close
21% (02:26) correct 
, this surely is a unique question not sure whether is GMAT type or not as it involves a lot of combining of pairs of factors solving under 120 sec would be really challenging.. 
