How Many Ways Can You Arrange 3 Birds to Feed if Two Don't Get Along?

Click For Summary
SUMMARY

The problem involves arranging 3 out of 7 birds to feed, with the constraint that two specific birds cannot feed together. The correct calculation for the number of valid combinations is given by the formula C(7,3) - C(2,2) * C(5,1), resulting in 5 valid combinations. The initial misunderstanding stemmed from incorrectly assuming that order mattered in the selection process. The solution clarifies that only the combinations of birds are relevant, not their arrangement.

PREREQUISITES
  • Understanding of combinatorial mathematics, specifically combinations.
  • Familiarity with the binomial coefficient notation C(n, k).
  • Basic knowledge of factorial calculations.
  • Concept of constraints in combinatorial problems.
NEXT STEPS
  • Study the principles of combinatorial mathematics in detail.
  • Learn about advanced combinatorial techniques, such as permutations and combinations with restrictions.
  • Explore real-world applications of combinatorial problems in probability theory.
  • Practice solving similar problems involving constraints in selection processes.
USEFUL FOR

Students studying combinatorial mathematics, educators teaching probability and statistics, and anyone interested in solving constrained selection problems.

Happyzor
Messages
9
Reaction score
0

Homework Statement


You have 7 birds lined up to feed. Only 3 birds can feed at a time. Two of the 7 birds do not like to feed with each other. How many combinaions can be formed?

Homework Equations


C(n,k)=n!/k!(n-k)!

The Attempt at a Solution


Attempted solution
C(7,3)-C(7,2)=21.


That is the wrong answer. The correct answer is C(7,3)-C(2,2)*C(5,1)=5

Can someone explain this to me? Thanks. My thinking was 7 choose 3 minus 7 choose the two birds that don't like to mix. Subtract and you'll get the birds that mix. Obviously its wrong -_-. Thanks for your help in advance.
 
Physics news on Phys.org
C(7,3) is clear.
Then you must subtract the number of times when the two birds are with each other. You must fix these two birds - that is where C(2,2) comes from (ie, these is only 1 way to select these two birds). The C(5,1) term comes from the fact that after you have selected these two birds, you must pick 1 last one so you have 3 on the feeding line.

Also, note that if 3 is the maximum number of birds allowed on the feeding line, then you can still consider situations when there are just 1 and 2 birds (respectively) on the line.
 
VeeEight said:
C(7,3) is clear.
Then you must subtract the number of times when the two birds are with each other. You must fix these two birds - that is where C(2,2) comes from (ie, these is only 1 way to select these two birds). The C(5,1) term comes from the fact that after you have selected these two birds, you must pick 1 last one so you have 3 on the feeding line.

Also, note that if 3 is the maximum number of birds allowed on the feeding line, then you can still consider situations when there are just 1 and 2 birds (respectively) on the line.

Ah ok, thanks. I was thinking order mattered and all, but now its clear order doesn't matter. There is only one way to choose the two birds. Then the 3rd combination is the combinations with the other 5 birds. Thanks a bunch for clearing it up.
 

Similar threads

  • · Replies 22 ·
Replies
22
Views
3K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 8 ·
Replies
8
Views
4K
Replies
1
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 4 ·
Replies
4
Views
4K
  • · Replies 4 ·
Replies
4
Views
4K
  • · Replies 2 ·
Replies
2
Views
3K
Replies
4
Views
6K
  • · Replies 7 ·
Replies
7
Views
2K