Fermi
·
Concept Library
·
Courses
·
Books
·
Problems
·
Simulations
·
Math Wiki
·
High School
Fermi
›
Problems
Mathematics
Mathematics
Problem
a. (i) Prove that in a single round-robin tournament involving
n
n
n
teams, the total number of matches required is
n
(
n
−
1
)
2
\dfrac{n(n-1)}{2}
2
n
(
n
−
1
)
. b. (ii) Hence, determine the total number of matches if
n
=
24
n = 24
n
=
24
.
Browse the problem library