2008 OIM Problems/Problem 6

Revision as of 15:37, 14 December 2023 by Tomasdiaz (talk | contribs) (Created page with "== Problem == In a "''biribol''" match, two teams of four people each face each other. A ''biribol'' tournament is organized in which <math>n</math> people participate, who f...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Problem

In a "biribol" match, two teams of four people each face each other. A biribol tournament is organized in which $n$ people participate, who form teams for each match (teams are not fixed). At the end of the tournament it was observed that every two people competed exactly one match on rival teams. For what values of $n$ is it possible to organize a tournament with such features?

~translated into English by Tomas Diaz. ~orders@tomasdiaz.com

Solution

This problem needs a solution. If you have a solution for it, please help us out by adding it.

See also

OIM Problems and Solutions