The document proves a formula for calculating binomial coefficients without using Pascal's triangle. It does so through a 4 step proof by induction:
1) It shows the formula holds for k=0
2) It assumes the formula holds for some integer k=r
3) It shows that if the formula holds for k=r, then it also holds for k=r+1
4) By the principle of mathematical induction, it concludes the formula therefore holds for all positive integer values of k.
The document then explains how this formula relates to the binomial theorem, which expresses the expansion of the powers of binomial expressions.