November 18, 2018 November 18, 2018 07:00 AM PST 09:00 AM PST Get personalized insights on how to achieve your Target Quant Score. November 18th, 7 AM PST November 20, 2018 November 20, 2018 09:00 AM PST 10:00 AM PST The reward for signing up with the registration form and attending the chat is: 6 free examPAL quizzes to practice your new skills after the chat.
Author 
Message 
TAGS:

Hide Tags

Math Expert
Joined: 02 Sep 2009
Posts: 50623

Question Stats:
36% (01:57) correct 64% (02:23) wrong based on 36 sessions
HideShow timer Statistics



Math Expert
Joined: 02 Sep 2009
Posts: 50623

Re M3123
[#permalink]
Show Tags
14 Jun 2015, 12:20
Official Solution:How many positive integers less than 10,000 are such that the product of their digits is 30? A. 12 B. 24 C. 36 D. 38 E. 50 \(30 = 2*3*5 = 6*5\) (only \(2*3\) gives single digit number 6). So, we should count the number of positive integers less than 10,000 with the digits {2, 3, 5} and {5, 6} and any number of 1's with each set. 2digit numbers: {5, 6}  the number of combinations = 2: 56 or 65. 3digit numbers: {1, 5, 6}  the number of combinations = 3! = 6: 156, 165, 516, 561, 615, or 651. {2, 3, 5}  the number of combinations = 3! = 6. 4digit numbers: {1, 1, 5, 6}  the number of combinations = 4!/2! = 12. {1, 2, 3, 5}  the number of combinations = 4! = 24. Total = 2 + 6 + 6 + 12 + 24 = 50. Answer: E
_________________
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



Senior Manager
Joined: 31 Mar 2016
Posts: 386
Location: India
Concentration: Operations, Finance
GPA: 3.8
WE: Operations (Commercial Banking)

Re M3123
[#permalink]
Show Tags
29 Jul 2016, 10:47
I think this is a highquality question and I agree with explanation.



Current Student
Joined: 10 Jan 2016
Posts: 17
Location: United States (WV)
Concentration: Social Entrepreneurship, Sustainability
GPA: 3.72
WE: Project Management (NonProfit and Government)

Re: M3123
[#permalink]
Show Tags
03 Aug 2016, 13:27
Bunuel wrote: Official Solution:
How many positive integers less than 10,000 are such that the product of their digits is 30?
A. 12 B. 24 C. 36 D. 38 E. 50
\(30 = 2*3*5 = 6*5\) (only \(2*3\) gives single digit number 6). So, we should count the number of positive integers less than 10,000 with the digits {2, 3, 5} and {5, 6} and any number of 1's with each set. 2digit numbers: {5, 6}  the number of combinations = 2: 56 or 65. 3digit numbers: {1, 5, 6}  the number of combinations = 3! = 6: 156, 165, 516, 561, 615, or 651. {2, 3, 5}  the number of combinations = 3! = 6. 4digit numbers: {1, 1, 5, 6}  the number of combinations = 4!/2! = 12. {1, 2, 3, 5}  the number of combinations = 4! = 24. Total = 2 + 6 + 6 + 12 + 24 = 50.
Answer: E Just to clarify: For {1, 1, 5, 6}  the number of combinations = 4!/2! = 12. you choose 2! because two of the four places would produce the same number?



Math Expert
Joined: 02 Sep 2009
Posts: 50623

Re: M3123
[#permalink]
Show Tags
03 Aug 2016, 21:23
SemperLiberi wrote: Bunuel wrote: Official Solution:
How many positive integers less than 10,000 are such that the product of their digits is 30?
A. 12 B. 24 C. 36 D. 38 E. 50
\(30 = 2*3*5 = 6*5\) (only \(2*3\) gives single digit number 6). So, we should count the number of positive integers less than 10,000 with the digits {2, 3, 5} and {5, 6} and any number of 1's with each set. 2digit numbers: {5, 6}  the number of combinations = 2: 56 or 65. 3digit numbers: {1, 5, 6}  the number of combinations = 3! = 6: 156, 165, 516, 561, 615, or 651. {2, 3, 5}  the number of combinations = 3! = 6. 4digit numbers: {1, 1, 5, 6}  the number of combinations = 4!/2! = 12. {1, 2, 3, 5}  the number of combinations = 4! = 24. Total = 2 + 6 + 6 + 12 + 24 = 50.
Answer: E Just to clarify: For {1, 1, 5, 6}  the number of combinations = 4!/2! = 12. you choose 2! because two of the four places would produce the same number? Yes. THEORY:Permutations of \(n\) things of which \(P_1\) are alike of one kind, \(P_2\) are alike of second kind, \(P_3\) are alike of third kind ... \(P_r\) are alike of \(r_{th}\) kind such that: \(P_1+P_2+P_3+..+P_r=n\) is: \(\frac{n!}{P_1!*P_2!*P_3!*...*P_r!}\). For example number of permutation of the letters of the word "gmatclub" is 8! as there are 8 DISTINCT letters in this word. Number of permutation of the letters of the word "google" is \(\frac{6!}{2!2!}\), as there are 6 letters out of which "g" and "o" are represented twice. Number of permutation of 9 balls out of which 4 are red, 3 green and 2 blue, would be \(\frac{9!}{4!3!2!}\).
_________________
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
Joined: 28 Mar 2017
Posts: 4

Re M3123
[#permalink]
Show Tags
27 Feb 2018, 09:15
I think this is a highquality question and I agree with explanation. This is a very tricky question and a true rep of GMAT type Qs. Thanks, Bunuel.



Intern
Joined: 07 Nov 2017
Posts: 2

Re: M3123
[#permalink]
Show Tags
27 Aug 2018, 11:02
in (1, 1 , 5, 6) why it is a permutation while the order does not matter ???



Math Expert
Joined: 02 Sep 2009
Posts: 50623

Re: M3123
[#permalink]
Show Tags
28 Aug 2018, 04:19
saranasser wrote: in (1, 1 , 5, 6) why it is a permutation while the order does not matter ??? We are interested in numbers less than 10,000 such that the product of their digits is 30. One combination which gives the product of 30 is (1, 1 , 5, 6). But with this combination gives different numbers, isn't it? 1156 is different from 6511 and each of them has the product of their digits equal to 30. Thus we need all numbers which we can get from each group. Hope it helps.
_________________
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










