You can put this solution on YOUR website! Pascal's triangle. It can be proven using a committee-forming argument (suppose you choose r people from a group of n. If person X is chosen, we have to choose r-1 people from n-1. If X is not chosen, we choose r people from n-1).