edited by
664 views
0 votes
0 votes

In a tournament, there are $n$ teams $T_1, T_2 ......., T$ with $n > 5$. Each team consists of $k$ players, $k>3$. The following pairs of teams have one player in common:

$T_1 \text{ and } T_2 , T_2 \text{ and } T_3, ...... , T_{n-1} \text{ and } T_n, \text{ and } T_n \text{ and } T_1 $

No other pair of teams has any player in common. How many players are participating in the tournament, considering all the $n$ teams together?

  1. $n(k-1)$
  2. $k(n-1)$
  3. $n(k-2)$
  4. $k(k-2)$
  5. $(n-1) (k-1)$
edited by

1 Answer

Related questions