MathDB
Counting friends in two ways

Source: ISI Entrance 2014, P1

May 11, 2014
combinatorics proposedcombinatorics

Problem Statement

Suppose a class contains 100100 students. Let, for 1i1001\le i\le 100, the ithi^{\text{th}} student have aia_i many friends. For 0j990\le j\le 99 let us define cjc_j to be the number of students who have strictly more than jj friends. Show that \begin{align*} & \sum_{i=1}^{100}a_i=\sum_{j=0}^{99}c_j \end{align*}