It is currently 19 Nov 2017, 23:21

### 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

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

# Events & Promotions

###### Events & Promotions in June
Open Detailed Calendar

# How many positive integers less than 10,000 are there in

Author Message
TAGS:

### Hide Tags

Math Expert
Joined: 02 Sep 2009
Posts: 42254

Kudos [?]: 132741 [13], given: 12360

How many positive integers less than 10,000 are there in [#permalink]

### Show Tags

13 Oct 2009, 20:37
13
KUDOS
Expert's post
79
This post was
BOOKMARKED
00:00

Difficulty:

95% (hard)

Question Stats:

46% (02:25) correct 54% (02:49) wrong based on 918 sessions

### HideShow timer Statistics

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
[Reveal] Spoiler: OA

_________________

Last edited by Bunuel on 13 Oct 2009, 21:27, edited 1 time in total.

Kudos [?]: 132741 [13], given: 12360

Manager
Joined: 11 Sep 2009
Posts: 129

Kudos [?]: 431 [64], given: 6

Re: Integers less than 10,000 [#permalink]

### Show Tags

14 Oct 2009, 12:23
64
KUDOS
23
This post was
BOOKMARKED
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:

XX|X|X|X = 2111
||XXX|XX = 0032

etc.

There are 8C3 ways to determine where to place the separators. Hence, the answer is 8C3 = 56.

Kudos [?]: 431 [64], given: 6

Math Expert
Joined: 02 Sep 2009
Posts: 42254

Kudos [?]: 132741 [5], given: 12360

Re: Integers less than 10,000 [#permalink]

### Show Tags

14 Oct 2009, 20:06
5
KUDOS
Expert's post
7
This post was
BOOKMARKED
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:

XX|X|X|X = 2111
||XXX|XX = 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)

_________________

Kudos [?]: 132741 [5], given: 12360

Manager
Joined: 17 Aug 2009
Posts: 227

Kudos [?]: 300 [1], given: 25

How many positive integers less than 10,000 are there in whi [#permalink]

### Show Tags

11 Jan 2010, 12:34
1
KUDOS
4
This post was
BOOKMARKED
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

Kudos [?]: 300 [1], given: 25

Manager
Joined: 27 Apr 2008
Posts: 191

Kudos [?]: 97 [0], given: 1

### 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?

Kudos [?]: 97 [0], given: 1

Math Expert
Joined: 02 Sep 2009
Posts: 42254

Kudos [?]: 132741 [5], given: 12360

### Show Tags

11 Jan 2010, 16:46
5
KUDOS
Expert's post
3
This post was
BOOKMARKED
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: $$|dd|d|dd$$ 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$$.

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+r-1}_C_{r-1}$$.

In our case we'll get: $${n+r-1}_C_{r-1}={5+4-1}_C_{4-1}={8}C3=\frac{8!}{5!3!}=56$$
_________________

Kudos [?]: 132741 [5], given: 12360

Manager
Joined: 27 Apr 2008
Posts: 191

Kudos [?]: 97 [0], given: 1

### Show Tags

11 Jan 2010, 18:17
What's the concept behind the separators?

Kudos [?]: 97 [0], given: 1

Math Expert
Joined: 02 Sep 2009
Posts: 42254

Kudos [?]: 132741 [1], given: 12360

### Show Tags

11 Jan 2010, 23:58
1
KUDOS
Expert's post
1
This post was
BOOKMARKED
mrblack wrote:
What's the concept behind the separators?

Attachment:

pTNfS-2e270de4ca223ec2741fa10b386c7bfe.jpg [ 63.83 KiB | Viewed 7614 times ]

Hope it's clear.
_________________

Kudos [?]: 132741 [1], given: 12360

Intern
Joined: 23 Dec 2009
Posts: 46

Kudos [?]: 47 [0], given: 7

Schools: HBS 2+2
WE 1: Consulting
WE 2: Investment Management

### Show Tags

12 Jan 2010, 00:08
1
This post was
BOOKMARKED
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: $$|dd|d|dd$$ 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$$.

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+r-1}_C_{r-1}$$.

In our case we'll get: $${n+r-1}_C_{r-1}={5+4-1}_C_{4-1}={8}C3=\frac{8!}{5!3!}=56$$

That was brilliant. Wow.
_________________

My GMAT quest...

...over!

Kudos [?]: 47 [0], given: 7

Senior Manager
Joined: 01 Feb 2010
Posts: 251

Kudos [?]: 62 [0], given: 2

### Show Tags

10 Mar 2010, 04:23
Grt explanation Bunuel.

Kudos [?]: 62 [0], given: 2

CEO
Joined: 17 Nov 2007
Posts: 3583

Kudos [?]: 4663 [1], given: 360

Concentration: Entrepreneurship, Other
Schools: Chicago (Booth) - Class of 2011
GMAT 1: 750 Q50 V40

### Show Tags

10 Mar 2010, 23:31
1
KUDOS
Expert's post
there is a shortcut. For the problem, 4 digits are equally important in 0000-9999 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 must-have app especially if you aim at 700+ | PrepGame

Kudos [?]: 4663 [1], given: 360

Math Expert
Joined: 02 Sep 2009
Posts: 42254

Kudos [?]: 132741 [24], given: 12360

Re: Integers less than 10,000 [#permalink]

### Show Tags

07 Apr 2010, 03:50
24
KUDOS
Expert's post
20
This post was
BOOKMARKED
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: $$|dd|d|dd$$ 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$$.

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+r-1}_C_{r-1}$$.

In our case we'll get: $${n+r-1}_C_{r-1}={5+4-1}_C_{4-1}={8}C3=\frac{8!}{5!3!}=56$$

Attachment:

pTNfS-2e270de4ca223ec2741fa10b386c7bfe.jpg [ 63.83 KiB | Viewed 62021 times ]

_________________

Kudos [?]: 132741 [24], given: 12360

Intern
Joined: 31 Mar 2010
Posts: 17

Kudos [?]: 3 [0], given: 12

WE 1: Top-Tier MC
Re: Integers less than 10,000 [#permalink]

### Show Tags

07 Apr 2010, 06:40
Fantastic explanation. +1

Kudos [?]: 3 [0], given: 12

Manager
Joined: 07 Jan 2010
Posts: 236

Kudos [?]: 9 [1], given: 16

Re: Integers less than 10,000 [#permalink]

### Show Tags

10 Apr 2010, 00:29
1
KUDOS
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.

Kudos [?]: 9 [1], given: 16

Manager
Joined: 05 Mar 2010
Posts: 202

Kudos [?]: 38 [0], given: 8

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

Kudos [?]: 38 [0], given: 8

CEO
Status: Nothing comes easy: neither do I want.
Joined: 12 Oct 2009
Posts: 2757

Kudos [?]: 1911 [16], given: 235

Location: Malaysia
Concentration: Technology, Entrepreneurship
Schools: ISB '15 (M)
GMAT 1: 670 Q49 V31
GMAT 2: 710 Q50 V35
Re: Integers less than 10,000 [#permalink]

### Show Tags

13 May 2010, 16:08
16
KUDOS
8
This post was
BOOKMARKED
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

GMAT Club Premium Membership - big benefits and savings

Gmat test review :
http://gmatclub.com/forum/670-to-710-a-long-journey-without-destination-still-happy-141642.html

Kudos [?]: 1911 [16], given: 235

Manager
Joined: 26 Feb 2010
Posts: 78

Kudos [?]: 9 [2], given: 1

Location: Argentina
Re: Integers less than 10,000 [#permalink]

### Show Tags

13 May 2010, 18:14
2
KUDOS
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:
XX|X|X|X = 2111
||XXX|XX = 0032

|X|XX|XX = 0|1|2|2 = 0122
X|||XXXX = 1|0|0|4 = 1004

I hope it helps

Kudos [?]: 9 [2], given: 1

Manager
Joined: 16 Feb 2010
Posts: 179

Kudos [?]: 34 [0], given: 17

Re: Integers less than 10,000 [#permalink]

### Show Tags

14 May 2010, 11:43
great explaination & good question
thanks Bunuel

Kudos [?]: 34 [0], given: 17

Intern
Joined: 01 Dec 2008
Posts: 5

Kudos [?]: [0], given: 4

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?

Kudos [?]: [0], given: 4

Manager
Joined: 26 Feb 2010
Posts: 78

Kudos [?]: 9 [0], given: 1

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

Kudos [?]: 9 [0], given: 1

Re: Integers less than 10,000   [#permalink] 18 May 2010, 19:21

Go to page    1   2   3    Next  [ 58 posts ]

Display posts from previous: Sort by