Recent content by flashback

I got somewhat of a solution that in the 2nd round there will be 12 possible solutions, am i somewhat on a good path?

Well i was in my thoughts on that because everyone plays someone in first step, and in the second step they can play with 2 less combinations more, but i would appreciate if you could explain the full solution ty :)

That is where my problem is. I cannot understand what the next steps are. i am going on thoughts that there are 4!/(2^2*2!) ?

well if A and C play in the second round than B and D play in the second round aswell, if i understood ur question correctly. And in addition i think there will be 4 rounds because in that way everyone could play everyone. but i do not know how many combinations go until those rounds. i...

I am sorry but, i have made a mistake in the question. the table on which a player plays does NOT matter. So i guess we should divide it by 4! since in 8 matches we would have 4! tables which are overcounted right?

Well since it is not an elimination match, then it would be the same as the first one or am i wrong?

I am on a clue now, it is i think that there must be no repetition since 2 players can not play two others again because as i understood this is a elimination tournament, but nothing aside from this

As i am new to combinatorics, i do not have an idea how to approach this problem. Because of this i am asking for an advice

Could anyone give me a help with this combinatorics problem: On a tournament of ping-pong there are 8 contestants and these rules apply: -Every player plays every other exactly once. -If in the i-th round there was a match between A and B and a match between C and D, and in the i+1-st round...

Oh i am really sorry i did not know there were rules. Be sure that next time i will be more carefull when writing a post, although this was the original text that my Discrete Mathematics teacher gave me as an assignment. Thanks a lot. Best regards.

Let us define a relation a on the set of nonnegative real triples as follows: (a1, a2, a3) α (b1, b2, b3) if two out of the three following inequalities a1 > b1, a2 > b2, a3 > b3 are satisfied. a) (3) Test a for Transitivity and Antisymmetry We call a triple (x, y, z) special if x, y, z...

Consider a set X with |X|=n≥1 elements. A family F of distinct subsets of X is sad to have property P if there exist A and B in F, such that A is a proper subset of B and |B\A|=1. Determine the least value m, so that any F with |F|>m has property P. This is a problem asked by our Discrete...