Question Details

In a tournament, there are $n$ teams T₁, T₂, .....T_n, with $n > 5$ . Each team consists of $k$ players, $k > 3$ . The following pairs of teams have one player in common: T₁ and T₂, T₂ and T₃, T₃ and T_n-1, and T_n-1 and T_n. No other pair of teams has any player in common. How many players are participating in the tournament, considering all the $n$ team together?

Options

A

k (n-1)

B

n (k-2)

C

k (n-2)

D

n (k-1)

Show Answer

Access expert-curated educational resources and study materialsâ€”completely free.

Create, conduct, and manage professional online assessments with Mindyard. Perfect for teachers and institutes.

Discover more resources

You may also like