Dominic S. answered 09/14/15
Tutor
5.0
(240)
Math and Physics Tutor
This is a form of what's often called the handshake problem (because you could do it with handshakes instead of games, if you wanted to). The best way to approach it is to consider it in the following way:
Person 1 (let's say it's Vinnie) goes through and plays a game with each other member - 159 games, Since there are 159 people other than himself that he could play a game with. He's now completely done; there's no one else for him to play with, and if anyone else initiated a game with him it would be a repeat, so he sits out.
Person 2 now goes through and plays a game with each other remaining member - 158 more games. She's now done as well, and sits out.
Person 3 goes through and plays 157 more games with the remaining members, and sits out himself.
It continues along these lines until the last two remaining members play one more game, which is the last.
The total number of games required is then just the sum of this series: 159 + 158 + 157 + 156 + ... + 3 + 2 + 1, a simple arithmetic series whose sum can be found by Sn = n(a1 + an)/2.
n, the number of terms, is clearly 159. a1, the first term, is 1, and an is also 159. The sum is then 159*80 = 12,720.