Each number is the sum of the two numbers above it • Row n, Position k gives you C(n,k)
C(n, k) is the number of ways to choose k items from n. It is also called a binomial coefficient.
C(n, k) = n! / (k! × (n-k)!)
C(n, k) = C(n-1, k-1) + C(n-1, k)
C(4, 2) = 6
Row 4, Position 2 in Pascal's Triangle