I have thought about this for some time and I can't justify how they got the number 33.
For the $1\leq x_1<x_2<…<x_{20}\leq 33$, it should be $1 \leq x_1<x_2<…<x_{20} = 35$ because the total number of calls at the end of the last day should be 35.
However, if we continue the in the same way, then we arrive at 40 integers under 41 in which the pigeonhole principle does not help. Where did 33 come from, or is there a different way to solve this problem?
Best Answer
Here's how you can adapt the existing solution to work for 35 calls, which is a deeper application.
Include $ x_0 = 0$ (which makes sense because otherwise we're ignoring what Susan does on the first day).
As per before, we have
$0 \leq x_0 < x_1 < \ldots < x_{20} \leq 35.$
$6 \leq x_0 + 6 < x_1 + 6 < \ldots < x_{20} + 6 \leq 35+6 = 41. $
There are 42 integers (pigeons), which range from $0$ to $41$ (holes).
If the integers are distinct, then
$ \sum_{i=0}^{41} i = \sum x_i + \sum (x_i + 6) = \sum ( 2 x_i + 6)$.
However, observe that the LHS is odd and the RHS is even, so this is a contradiction.
Hence, (at least) 2 of the integers are not distinct, which means we have $x_i = x_j + 6$.
Notes
For 36 calls, we have 42 integers (pigeons) which range from 0 to 42 (holes).
If the integers are distinct, then consider their values mod 6.
For 37 calls, we have 42 integers (pigeons) which range from 0 to 43 (holes).
If the integers are distinct, then consider their values mod 6.
35 calls using the above formulation.
If the integers are distinct, then consider their values mod 2.