Question 96
In a group of people, some are friends (friendship is mutual) and each person $p$ has a list $f_1(p), f_2(p), \dots, f_{d(p)}(p)$ of their friends, where $d(p)$ is the number of friends $p$ has. Additionally, any two people are connected by a series of friendships. Each person also has a *water balloon*. The following game is played until someone ends up with more than one water balloon: on round $r$, each person $p$ throws the current water balloon they have to their friend $f_s(p)$ such that $d(p) \mid r - s$. Show that if the game never ends, then everyone has the same number of friends.