How Many Ways to Select 10 Jellybeans With Up to 4 Greens?

Extreme112
Messages
5
Reaction score
0

Homework Statement


How many ways can you select 10 jellybeans from colors Red, Blue, Green so that at most you only have 4 Green jellybeans?

Homework Equations


...

3. The Attempt at a Solution [/B]
# of ways = # of ways to pick 1 Green + # of ways to pick 2 Green + #of ways to pick 3 Green + # of ways to pick 4 Green.

1 Green jellybean: After picking out the jellybean, there are then 9 left to choose from.
* * * * $ * * * * *
If the '*' are the 9 jellybeans and '$' is the divider to separate the jellybeans so that those on the left of it are Red and those to the right of it are Blue then there are 10!/9! or 10 ways to rearrange it.

2 Greens: Following the same process above would result in 9!/8! = 9
3 Greens: 8!/7! = 8
4 Greens: 7!/6! = 7

Therefore you would have 10+9+8+7 ways to select 10 jellybeans with at most having 4 Green jellybeans.
 
Physics news on Phys.org
For two greens,
one comes out first, the second one can come out with the second draw, or the third, or... up to the tenth.
that's nine ways... but the first could have come out on the 3rd draw, with the second coming out on the 4th or subsequent... that's another 6 ways or something isn't it?
So that's 15 ways to get 2 green, and I haven't finished counting yet.
 
Simon Bridge said:
For two greens,
one comes out first, the second one can come out with the second draw, or the third, or... up to the tenth.
that's nine ways... but the first could have come out on the 3rd draw, with the second coming out on the 4th or subsequent... that's another 6 ways or something isn't it?
So that's 15 ways to get 2 green, and I haven't finished counting yet.
I would say Extreme112 is interpreting the question correctly, that the order of selection is unimportant.
Extreme112 said:
you would have 10+9+8+7 ways to select 10 jellybeans with at most having 4 Green jellybeans.
You left out one case.
 
haruspex said:
I would say Extreme112 is interpreting the question correctly, that the order of selection is unimportant.

You left out one case.
I think I forgot the 0 case. Thanks for the help guys.
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top