MHB Combinatorics problem. Discrete Mathematics II

AI Thread Summary
The discussion revolves around calculating the number of possible schedules for a table tennis tournament with 8 participants, where each player competes against every other player once. The rules dictate that if two matches occur in one round, the players not involved must also compete in the next round. The initial calculation for the first round suggests that there are 105 possible combinations, derived from the formula 8!/2^4 * 4!. Participants are encouraged to share their progress to facilitate better assistance. The conversation indicates a need for further exploration of scheduling for subsequent rounds.
Mei1
Messages
1
Reaction score
0
There is a table tennis tournament consisted of 8 participants that is guided by the following rules:

1. Each player plays with every other player for exactly one party
2. If in the i-round there was a party between A and B and a party between C and D, and A and C play In i+1, then in i+1 round B and D have to play too.

In how many different ways can a schedule for all rounds be made, not giving importance to the table on which each player plays?
 
Physics news on Phys.org
Hello and welcome to MHB, Mei! :D

We ask that our users show their progress (work thus far or thoughts on how to begin) when posting questions. This way our helpers can see where you are stuck or may be going astray and will be able to post the best help possible without potentially making a suggestion which you have already tried, which would waste your time and that of the helper.

Can you post what you have done so far?

A similar post was made http://mathhelpboards.com/advanced-probability-statistics-19/combinations-problem-18376.html.
 
Last edited:
Mei said:
There is a table tennis tournament consisted of 8 participants that is guided by the following rules:

1. Each player plays with every other player for exactly one party
2. If in the i-round there was a party between A and B and a party between C and D, and A and C play In i+1, then in i+1 round B and D have to play too.

In how many different ways can a schedule for all rounds be made, not giving importance to the table on which each player plays?
Hi Mei! Welcome to MHB! (Smile)

Let's start with the first round.
We can order the contestants in $8!$ ways.
Since (A,B) is the same game as (B,A), which applies to each pair, we should divide by $2^4$.
Then, since the table it not important, we should also divide by $4!$.
So the number of possible combinations for the first round is:
$$\frac{8!}{2^4 \cdot 4!} = 105$$

Hmm... how about the second round? (Wondering)
 
I was reading documentation about the soundness and completeness of logic formal systems. Consider the following $$\vdash_S \phi$$ where ##S## is the proof-system making part the formal system and ##\phi## is a wff (well formed formula) of the formal language. Note the blank on left of the turnstile symbol ##\vdash_S##, as far as I can tell it actually represents the empty set. So what does it mean ? I guess it actually means ##\phi## is a theorem of the formal system, i.e. there is a...
Back
Top