MathDB
soccer tournament

Source: Italy TST 2002

September 23, 2008
floor functioncombinatorics unsolvedcombinatorics

Problem Statement

On a soccer tournament with n≥3n\ge 3 teams taking part, several matches are played in such a way that among any three teams, some two play a match. (a)(a) If n=7n=7, find the smallest number of matches that must be played. (b)(b) Find the smallest number of matches in terms of nn.
Back to ProblemsView on AoPS