I need to find the number of ways to distribute a varying number of balls into 3 distinct boxes such that the sum of all balls is $\le 99$.
Since the balls are identical and the boxes are distinct, I have chosen to use $H^n_r$ i.e. ${r+n-1}\choose{r}$ to solve the problem, where $n$ = number of boxes and $r$ = number of balls.
I have split the problem into different cases, such as when sum of balls is 99, sum of balls is 98.. all the way to if the sum of balls is 0.
I have obtained the following sequence
${101}\choose{99}$ + ${100}\choose{98}$ + ${99}\choose{97}$ +...+ ${3}\choose{1}$ + ${2}\choose{0}$
Using the symmetry rule I have simplified this into
${101}\choose{2}$ + ${100}\choose{2}$ + ${99}\choose{2}$ +...+ ${3}\choose{2}$ + ${2}\choose{2}$ = $\sum_{r=2}^{101}{{r}\choose{2}}$
However I feel that my method is too long, is there some kind of way to simplify the answer even more so that I can get an integer solution?