I did this math contest and the answers are now posted and this one question I can't figure out, and I was hoping someone here could help me.
Six soccer teams are competing in a tournament in Waterloo. Every team is to play three games, each against a different team. (Note that not every pair of teams plays a game together.) Judene is in charge of pairing up the teams to create a schedule of games that will be played. Ignoring the order and times of the games, how many different schedules are possible?
The answer is: