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:

Re: Integers less than 10,000 [#permalink]
12 Oct 2010, 07:35

thanks Bunuel can u explain me this by using the formulae How many positive integers less than 10,000 are there in which the sum of the digits equals 6? thanks in advance

Re: Integers less than 10,000 [#permalink]
14 Oct 2010, 22:03

Man this is one of the hardest questions I have seen. Couldn't really understand at first (still not a firm grasp) and couldn't solve. After following the above posts it is coming to mind slowly but I am gonna go find more about "Stars & Bars" on internet (Looks like need tutor here ). _________________

"Don't be afraid of the space between your dreams and reality. If you can dream it, you can make it so." Target=780 http://challengemba.blogspot.com Kudos??

Re: Integers less than 10,000 [#permalink]
31 Jan 2011, 16:43

Bunuel wrote:

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.

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

Also see the image I found in the net about this question explaining the concept:

Attachment:

pTNfS-2e270de4ca223ec2741fa10b386c7bfe.jpg

This is a brilliant post, kudos to you Bunuel! _________________

Thank you for your kudoses Everyone!!!

"It always seems impossible until its done." -Nelson Mandela

Re: Integers less than 10,000 [#permalink]
01 Oct 2011, 19:29

Hi want to know hy two digit Numbers are neglected when forming combinations can anyone explain me in a breif manner i am totally confused. _________________

Re: Integers less than 10,000 [#permalink]
05 Oct 2011, 01:17

Loki2612 wrote:

I'm sorry but where did you see in the question that numbers like 0005 are considered 4 digits numbers?

No its not a 4-digit number.

Question says, "integers less than 10000". That includes: 0005->Single digit 0050->2 digits 0500->3 digits 5000->4 digits

The idea is that "5" must not be ignored while counting. The method suggested ensures that 5 is not ignored and is counted only once. The representation may very well be "0005", yet it is still a single digit 5. _________________

Re: How many positive integers less than 10,000 are there in [#permalink]
07 Feb 2012, 14:23

I understand that the total number of positive integers less than 10000 with the sum of the digits equal to 5 is 8C3 = 56.

Any idea how to solve this if the question instead is to find the total number of 4 digit numbers less than 10000 with the sum of digits equal to 5. Is it 8C2 = 28?

Re: How many positive integers less than 10,000 are there in [#permalink]
23 May 2012, 15:44

Bunuel,

Many apologies for reviving this method. But I gotta say I love your "stars and bars" method. My Question is it seems to only work for this question if the sum is less than 9 for this question. You can't have more than 9 stars in each slot. What if the question had asked,

How many positive integers less than 10,000 are there in which the sum of the digits equals 13?

Now this is a little tricker. Here is another example from another problem posted on this forum that illustrates the problem. Is there a way we can exand "stars and bars" to numbers that sum larger than 9?

A wheel of fortune contains numerical values from 1 to 8. The scoring system of the game is based on the sum of these values. If the host were to spin the wheel three times, how many possible number of combinations are there that will give the player the sum of 16 points?

Re: Integers less than 10,000 [#permalink]
25 May 2013, 21:03

Bunuel wrote:

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.

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

Also see the image I found in the net about this question explaining the concept:

Re: Integers less than 10,000 [#permalink]
26 May 2013, 02:45

Bunuel wrote:

anilnandyala wrote:

thanks Bunuel can u explain me this by using the formulae How many positive integers less than 10,000 are there in which the sum of the digits equals 6? thanks in advance

6 * (digits) and 3 ||| --> ******||| --> # of permutations of these symbols is \frac{9!}{6!3!}.

Or: The total number of ways of dividing n identical items (6 *'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 6 in our case) is {n+r-1}_C_{r-1}.

In our case we'll get: {n+r-1}_C_{r-1}={6+4-1}_C_{4-1}={9}C3=\frac{9!}{6!3!}.

Hope it's clear.

Hi Bunnel,

Can I say that this involves the placement of 5 identical 1's in four places such that each place can receive 0 to 5 1's.

Re: Integers less than 10,000 [#permalink]
26 May 2013, 03:47

Expert's post

cumulonimbus wrote:

Bunuel wrote:

anilnandyala wrote:

thanks Bunuel can u explain me this by using the formulae How many positive integers less than 10,000 are there in which the sum of the digits equals 6? thanks in advance

6 * (digits) and 3 ||| --> ******||| --> # of permutations of these symbols is \frac{9!}{6!3!}.

Or: The total number of ways of dividing n identical items (6 *'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 6 in our case) is {n+r-1}_C_{r-1}.

In our case we'll get: {n+r-1}_C_{r-1}={6+4-1}_C_{4-1}={9}C3=\frac{9!}{6!3!}.

Hope it's clear.

Hi Bunnel,

Can I say that this involves the placement of 5 identical 1's in four places such that each place can receive 0 to 5 1's.

Re: How many positive integers less than 10,000 are there in [#permalink]
12 Jul 2013, 21:44

alphabeta1234 wrote:

Bunuel,

Many apologies for reviving this method. But I gotta say I love your "stars and bars" method. My Question is it seems to only work for this question if the sum is less than 9 for this question. You can't have more than 9 stars in each slot. What if the question had asked,

How many positive integers less than 10,000 are there in which the sum of the digits equals 13?

Now this is a little tricker. Here is another example from another problem posted on this forum that illustrates the problem. Is there a way we can exand "stars and bars" to numbers that sum larger than 9?

A wheel of fortune contains numerical values from 1 to 8. The scoring system of the game is based on the sum of these values. If the host were to spin the wheel three times, how many possible number of combinations are there that will give the player the sum of 16 points?

Bunuel,

Like alphabeta1234 mentioned above, there is a limitation to the stars and bars method. How then would we be able to find out the number of positive integers less than 10,000 if their sum is to be, say, 13? He mentioned the wheel of fortune method, but looking it up on the internet didn't turn up much that was useful.

Re: How many positive integers less than 10,000 are there in [#permalink]
12 Jul 2013, 23:10

Expert's post

keylimepie wrote:

alphabeta1234 wrote:

Bunuel,

Many apologies for reviving this method. But I gotta say I love your "stars and bars" method. My Question is it seems to only work for this question if the sum is less than 9 for this question. You can't have more than 9 stars in each slot. What if the question had asked,

How many positive integers less than 10,000 are there in which the sum of the digits equals 13?

Now this is a little tricker. Here is another example from another problem posted on this forum that illustrates the problem. Is there a way we can exand "stars and bars" to numbers that sum larger than 9?

A wheel of fortune contains numerical values from 1 to 8. The scoring system of the game is based on the sum of these values. If the host were to spin the wheel three times, how many possible number of combinations are there that will give the player the sum of 16 points?

Bunuel,

Like alphabeta1234 mentioned above, there is a limitation to the stars and bars method. How then would we be able to find out the number of positive integers less than 10,000 if their sum is to be, say, 13? He mentioned the wheel of fortune method, but looking it up on the internet didn't turn up much that was useful.

There is a direct formula given on previous page. _________________

Re: How many positive integers less than 10,000 are there in [#permalink]
12 Jul 2013, 23:52

Bunuel wrote:

keylimepie wrote:

alphabeta1234 wrote:

Bunuel,

Many apologies for reviving this method. But I gotta say I love your "stars and bars" method. My Question is it seems to only work for this question if the sum is less than 9 for this question. You can't have more than 9 stars in each slot. What if the question had asked,

How many positive integers less than 10,000 are there in which the sum of the digits equals 13?

Now this is a little tricker. Here is another example from another problem posted on this forum that illustrates the problem. Is there a way we can exand "stars and bars" to numbers that sum larger than 9?

A wheel of fortune contains numerical values from 1 to 8. The scoring system of the game is based on the sum of these values. If the host were to spin the wheel three times, how many possible number of combinations are there that will give the player the sum of 16 points?

Bunuel,

Like alphabeta1234 mentioned above, there is a limitation to the stars and bars method. How then would we be able to find out the number of positive integers less than 10,000 if their sum is to be, say, 13? He mentioned the wheel of fortune method, but looking it up on the internet didn't turn up much that was useful.

There is a direct formula given on previous page.

I'm sorry. I'm afraid I don't see which one I can apply to the situation. Could you please point me in the right direction?

1. My favorite football team to infinity and beyond, the Dallas Cowboys, currently have the best record in the NFL and I’m literally riding on cloud 9 because...

I couldn’t help myself but stay impressed. young leader who can now basically speak Chinese and handle things alone (I’m Korean Canadian by the way, so...