Combinatorics problem

  • Thread starter JasonJo
  • Start date
  • #1
429
2
There are 6 tennis players and each week for a month (4 weeks) a different pair of 5 play a tennis match. How many ways are there to form the sequence of 4 matches so that every player plays at least once?

I believe this is an OR problem, but I don't know how to handle the 4 weeks information and how do you count this?

thanks
 

Answers and Replies

  • #2
Dale
Mentor
Insights Author
2020 Award
31,858
8,722
The 4 weeks just refers to the 4 matches. Since there are 6 players there are 6C2 = 15 pairs. Now with 4 matches there are 15P4 possible sequences (since sequences means that the order matters). If we wanted to exclude one person we would have 5C2 pairs and (5C2)P4 possible sequences. What if we tried to exclude two people? Can you go from here?

-Dale
 

Related Threads on Combinatorics problem

  • Last Post
Replies
1
Views
2K
  • Last Post
Replies
7
Views
1K
  • Last Post
Replies
5
Views
2K
  • Last Post
Replies
2
Views
866
  • Last Post
Replies
7
Views
1K
  • Last Post
Replies
3
Views
1K
  • Last Post
Replies
2
Views
1K
  • Last Post
Replies
1
Views
2K
  • Last Post
Replies
1
Views
2K
V
  • Last Post
Replies
2
Views
2K
Top