Counting friends in two ways
Source: ISI Entrance 2014, P1
May 11, 2014
combinatorics proposedcombinatorics
Problem Statement
Suppose a class contains students. Let, for , the student have many friends. For let us define to be the number of students who have strictly more than friends. Show that \begin{align*} & \sum_{i=1}^{100}a_i=\sum_{j=0}^{99}c_j \end{align*}