Consider a tournament with $n+1$ teams each playing each other. We will count the number of matches played in two ways.
* Every match is played between two teams. This inturn implies that the number of matches is $\dbinom{n+1}2$.
* We will now count the number of distinct matches played team by team.
* The number of matches played by the first team is $n$.
* The number of matches played by the second team is $n-1$, since their match with the first team has already been accounted for.
* The number of matches played by the third team is $n-2$, since their matches with the first and second team have already been accounted for.
* The number of matches played by the $k^{th}$ team is $n-k+1$, since their matches with the first $k-1$ teams have already been accounted for. Hence, the total number of matches is $$n+(n-1) + (n-2) + \cdots + 1$$