Author 
Message 
TAGS:

Hide Tags

Math Expert
Joined: 02 Sep 2009
Posts: 49300

How many positive integers less than 10,000 are there in
[#permalink]
Show Tags
Updated on: 13 Oct 2009, 21:27
Question Stats:
46% (02:25) correct 54% (02:49) wrong based on 1116 sessions
HideShow timer Statistics
Originally posted by Bunuel on 13 Oct 2009, 20:37.
Last edited by Bunuel on 13 Oct 2009, 21:27, edited 1 time in total.




Math Expert
Joined: 02 Sep 2009
Posts: 49300

Re: Integers less than 10,000
[#permalink]
Show Tags
07 Apr 2010, 03:50
Ramsay wrote: Sorry guys,
Could someone please explain the following:
"There are 8C3 ways to determine where to place the separators"
I'm not familiar with this shortcut/approach.
Ta Consider this: we have 5 \(d\)'s and 3 separators \(\), like: \(ddddd\). How many permutations (arrangements) of these symbols are possible? Total of 8 symbols (5+3=8), out of which 5 \(d\)'s and 3 \(\)'s are identical, so \(\frac{8!}{5!3!}=56\). With these permutations we'll get combinations like: \(ddddd\) this would be 3 digit number 212 OR \(ddddd\) this would be single digit number 5 (smallest number less than 10,000 in which sum of digits equals 5) OR \(ddddd\) this would be 4 digit number 5,000 (largest number less than 10,000 in which sum of digits equals 5)... Basically this arrangements will give us all numbers less than 10,000 in which sum of the digits (sum of 5 d's=5) equals 5. Hence the answer is \(\frac{8!}{5!3!}=56\). Answer: C (56). This can be done with direct formula as well: The total number of ways of dividing n identical items (5 d's in our case) among r persons or objects (4 digt places in our case), each one of whom, can receive 0, 1, 2 or more items (from zero to 5 in our case) is \({n+r1}_C_{r1}\). In our case we'll get: \({n+r1}_C_{r1}={5+41}_C_{41}={8}C3=\frac{8!}{5!3!}=56\) Also see the image I found in the net about this question explaining the concept: Attachment:
pTNfS2e270de4ca223ec2741fa10b386c7bfe.jpg [ 63.83 KiB  Viewed 71491 times ]
_________________
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: 11 Sep 2009
Posts: 129

Re: Integers less than 10,000
[#permalink]
Show Tags
14 Oct 2009, 12:23
I believe the answer to be C: 56.
Basically, the question asks how many 4 digit numbers (including those in the form 0XXX, 00XX, and 000X) have digits which add up to 5. Think about the question this way: we know that there is a total of 5 to be spread among the 4 digits, we just have to determine the number of ways it can be spread.
Let X represent a sum of 1, and  represent a seperator between two digits. As a result, we will have 5 X's (digits add up to the 5), and 3 's (3 digit seperators).
So, for example:
XXXXX = 2111 XXXXX = 0032
etc.
There are 8C3 ways to determine where to place the separators. Hence, the answer is 8C3 = 56.




Math Expert
Joined: 02 Sep 2009
Posts: 49300

Re: Integers less than 10,000
[#permalink]
Show Tags
14 Oct 2009, 20:06
AKProdigy87 wrote: I believe the answer to be C: 56.
Basically, the question asks how many 4 digit numbers (including those in the form 0XXX, 00XX, and 000X) have digits which add up to 5. Think about the question this way: we know that there is a total of 5 to be spread among the 4 digits, we just have to determine the number of ways it can be spread.
Let X represent a sum of 1, and  represent a seperator between two digits. As a result, we will have 5 X's (digits add up to the 5), and 3 's (3 digit seperators).
So, for example:
XXXXX = 2111 XXXXX = 0032
etc.
There are 8C3 ways to determine where to place the separators. Hence, the answer is 8C3 = 56. This is correct. Also this is the best way to solve this question. +1. (Solved exactly the same way) Answer: 56.
_________________
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: 27 Apr 2008
Posts: 179

Re: Tough Combinatronics questions
[#permalink]
Show Tags
11 Jan 2010, 13:15
Since the sum of the 4 digits have to equal to 5, anyting #s >=6000 is eliminated.
5000s range  1 5000 is the only possibly number in the 5000's range.
4000s range  3 Since 4+1=5, there are only 3 spots to put the 1s, namely 4100, 4010, 4001.
3000s range  6 We can have 3+2+0+0 (3 combinations) or 3+1+1+0 (3 combinations).
2000s range  7 We can have 2+2+1+0 (6 combinations because of 3! ways of arranging the last 3 digits using 2,1,0) or 2+1+1+1 (1 combination).
1000s range  15 We can have 1+1+1+2 (3 combinations), 1+2+2+0 (3 combinations), 1+4+0+0 (3 combinations), and 1+3+1+0 (6 combinations because of 3! ways of arranging the last 3 digits of 3,1,0).
The # of numbers is therefore 1+3+6+7+15=32. Notice that you get 3 combinations whenever 2 of the last 3 digits are the same.
Then use the same logic on 3 digits and 2 digits and 1 digit numbers.
Is there a fast way to do this?



Math Expert
Joined: 02 Sep 2009
Posts: 49300

Re: Tough Combinatronics questions
[#permalink]
Show Tags
11 Jan 2010, 16:46
zaarathelab wrote: How many positive integers less than 10,000 are there in which the sum of the digits equals 5?
A) 31 B) 51 C) 56 D) 62 E) 93 Consider this: we have 5 \(d\)'s and 3 separators \(\), like: \(ddddd\). How many permutations (arrangements) of these symbols are possible? Total of 8 symbols (5+3=8), out of which 5 \(d\)'s and 3 \(\)'s are identical, so \(\frac{8!}{5!3!}=56\). With these permutations we'll get combinations like: \(ddddd\) this would be 3 digit number 212 OR \(ddddd\) this would be single digit number 5 (smallest number less than 10,000 in which sum of digits equals 5) OR \(ddddd\) this would be 4 digit number 5,000 (largest number less than 10,000 in which sum of digits equals 5)... Basically this arrangements will give us all numbers less than 10,000 in which sum of the digits (sum of 5 d's=5) equals 5. Hence the answer is \(\frac{8!}{5!3!}=56\). Answer: C (56). This can be done with direct formula as well: The total number of ways of dividing n identical items (5 d's in our case) among r persons or objects (4 digt places in our case), each one of whom, can receive 0, 1, 2 or more items (from zero to 5 in our case) is \({n+r1}_C_{r1}\). In our case we'll get: \({n+r1}_C_{r1}={5+41}_C_{41}={8}C3=\frac{8!}{5!3!}=56\)
_________________
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: 27 Apr 2008
Posts: 179

Re: Tough Combinatronics questions
[#permalink]
Show Tags
11 Jan 2010, 18:17
What's the concept behind the separators?



Math Expert
Joined: 02 Sep 2009
Posts: 49300

Re: Tough Combinatronics questions
[#permalink]
Show Tags
11 Jan 2010, 23:58



Intern
Joined: 23 Dec 2009
Posts: 41
Schools: HBS 2+2
WE 1: Consulting
WE 2: Investment Management

Re: Tough Combinatronics questions
[#permalink]
Show Tags
12 Jan 2010, 00:08
Bunuel wrote: zaarathelab wrote: How many positive integers less than 10,000 are there in which the sum of the digits equals 5?
A) 31 B) 51 C) 56 D) 62 E) 93 Consider this: we have 5 \(d\)'s and 3 separators \(\), like: \(ddddd\). How many permutations (arrangements) of these symbols are possible? Total of 8 symbols (5+3=8), out of which 5 \(d\)'s and 3 \(\)'s are identical, so \(\frac{8!}{5!3!}=56\). With these permutations we'll get combinations like: \(ddddd\) this would be 3 digit number 212 OR \(ddddd\) this would be single digit number 5 (smallest number less than 10,000 in which sum of digits equals 5) OR \(ddddd\) this would be 4 digit number 5,000 (largest number less than 10,000 in which sum of digits equals 5)... Basically this arrangements will give us all numbers less than 10,000 in which sum of the digits (sum of 5 d's=5) equals 5. Hence the answer is \(\frac{8!}{5!3!}=56\). Answer: C (56). This can be done with direct formula as well: The total number of ways of dividing n identical items (5 d's in our case) among r persons or objects (4 digt places in our case), each one of whom, can receive 0, 1, 2 or more items (from zero to 5 in our case) is \({n+r1}_C_{r1}\). In our case we'll get: \({n+r1}_C_{r1}={5+41}_C_{41}={8}C3=\frac{8!}{5!3!}=56\) That was brilliant. Wow.
_________________
My GMAT quest...
...over!



Manager
Joined: 01 Feb 2010
Posts: 238

Re: Integers
[#permalink]
Show Tags
10 Mar 2010, 04:23
Grt explanation Bunuel.



CEO
Joined: 17 Nov 2007
Posts: 3458
Concentration: Entrepreneurship, Other
Schools: Chicago (Booth)  Class of 2011

Re: Integers
[#permalink]
Show Tags
10 Mar 2010, 23:31
there is a shortcut. For the problem, 4 digits are equally important in 00009999 set and it is impossible to build a number using only one digit (like 11111) So, answer has to be divisible by 4. Only 56 works. Posted from GMAT ToolKit
_________________
HOT! GMAT TOOLKIT 2 (iOS) / GMAT TOOLKIT (Android)  The OFFICIAL GMAT CLUB PREP APP, a musthave app especially if you aim at 700+  Limited GMAT/GRE Math tutoring in Chicago



Intern
Joined: 31 Mar 2010
Posts: 17
Schools: Stanford GSB (waiting), Wharton (wl w/ int), INSEAD (admit)
WE 1: TopTier MC

Re: Integers less than 10,000
[#permalink]
Show Tags
07 Apr 2010, 06:40
Fantastic explanation. +1



Manager
Joined: 07 Jan 2010
Posts: 196

Re: Integers less than 10,000
[#permalink]
Show Tags
10 Apr 2010, 00:29
amazing minds I solved it using a lengthy process and still got it wrong. Don't know what I did wrong ...well does not matter.



Manager
Joined: 05 Mar 2010
Posts: 180

Re: Integers less than 10,000
[#permalink]
Show Tags
10 Apr 2010, 03:52
Thanks Bunuel and AKProdigy +1 to you both excellent approach.
_________________
Success is my Destiny



CEO
Status: Nothing comes easy: neither do I want.
Joined: 12 Oct 2009
Posts: 2617
Location: Malaysia
Concentration: Technology, Entrepreneurship
GMAT 1: 670 Q49 V31 GMAT 2: 710 Q50 V35

Re: Integers less than 10,000
[#permalink]
Show Tags
13 May 2010, 16:08
Pairs possible : 1,2,1,1 ; 1,3,1,0 ; 1,4,0,0 ; 0,1,2,2 ; 0,0,0,5 ; 0,0,2,3 which gives : 1,2,1,1 => 4!/3! = 4 0,0,0,5 =>=> 4!/3! = 4 1,3,1,0 => 4!/2! = 12 1,4,0,0 => 4!/2! = 12 0,1,2,2 => 4!/2! = 12 0,0,2,3 => 4!/2! = 12 Total = 4+4+ 12+12+12+12 = 56. Bunnel I have solved it in this way but your methods seems to be quicker. But I couldn't understand. Could you please explain in simple words.
_________________
Fight for your dreams :For all those who fear from Verbal lets give it a fight
Money Saved is the Money Earned
Jo Bole So Nihaal , Sat Shri Akaal
Support GMAT Club by putting a GMAT Club badge on your blog/Facebook
GMAT Club Premium Membership  big benefits and savings
Gmat test review : http://gmatclub.com/forum/670to710alongjourneywithoutdestinationstillhappy141642.html



Manager
Joined: 26 Feb 2010
Posts: 75
Location: Argentina

Re: Integers less than 10,000
[#permalink]
Show Tags
13 May 2010, 18:14
gurpreetsingh wrote: Pairs possible : 1,2,1,1 ; 1,3,1,0 ; 1,4,0,0 ; 0,1,2,2 ; 0,0,0,5 ; 0,0,2,3
which gives : 1,2,1,1 => 4!/3! = 4 0,0,0,5 =>=> 4!/3! = 4
1,3,1,0 => 4!/2! = 12 1,4,0,0 => 4!/2! = 12 0,1,2,2 => 4!/2! = 12 0,0,2,3 => 4!/2! = 12
Total = 4+4+ 12+12+12+12 = 56.
Bunnel I have solved it in this way but your methods seems to be quicker. But I couldn't understand. Could you please explain in simple words. this approach was more natural and my first idea to solve the promblem Then I saw the Bunnel´s and AKProdigy87´s way to solve this problem. The idea of Bunnel and AKProdigy87 method is that the sum of the digits must equal 5, and this five can be distributed among the 4 digits and numbers are made by "ones". Again, numbers are made by "ones"! please do not thing of numbers as 2, 3, 4 or 5 digit for example: Quote: XXXXX = 2111 XXXXX = 0032 XXXXX = 0122 = 0122 XXXXX = 1004 = 1004 I hope it helps



Manager
Joined: 16 Feb 2010
Posts: 154

Re: Integers less than 10,000
[#permalink]
Show Tags
14 May 2010, 11:43
great explaination & good question thanks Bunuel



Intern
Joined: 01 Dec 2008
Posts: 3

Re: Integers less than 10,000
[#permalink]
Show Tags
17 May 2010, 11:34
Bunuel, Great explanation! Can you provide another example of a digit problem where we can apply this concept?



Manager
Joined: 26 Feb 2010
Posts: 75
Location: Argentina

Re: Integers less than 10,000
[#permalink]
Show Tags
18 May 2010, 19:21
Quote: Can this method be used in variations of this question?
Such as sum of 7 digits that add to equal 6? Yes. Why not? You mean numbers with 7 digits? I don't know if that is going to be a question of gmat, but... If the question was to equal 5 you can do the same to six, just add one X



Manager
Joined: 26 Feb 2010
Posts: 75
Location: Argentina

Re: Integers less than 10,000
[#permalink]
Show Tags
14 Jun 2010, 09:37
bibha wrote: HEy, How do we know how many separators to use? I mean how did we get 8 and 3?? Hi Bibha! Have you read the previous explanations? 8 because we have 8 elements 5 + 3 and 3 because we need a four digit number I hope it helps




Re: Integers less than 10,000 &nbs
[#permalink]
14 Jun 2010, 09:37



Go to page
1 2 3
Next
[ 59 posts ]



