Secret Society
Source: St Petersburg Olympiad 2011, Grade 11, P7
September 15, 2017
combinatorics
Problem Statement
There is secret society with members. Every member has bank account with integer balance ( can be negative). Sometimes some member give one dollar to every his friend. It is known, that after some such moves members can redistribute their money arbitrarily. Prove, that there are exactly pairs of friends.