Row Sums and Hockey Stick Identity
What you'll learn: You'll discover a simple formula for the sum of any row in Pascal's Triangle and learn the elegant Hockey Stick Identity that reveals hidden patterns in diagonal sums.
Row Sums in Pascal's Triangle
When you add up all the numbers in a row of Pascal's Triangle, something beautiful happens. The sum of row n equals 2ⁿ.
For example:
- Row 0: 1 → sum = 1 = 2⁰
- Row 1: 1, 1 → sum = 2 = 2¹
- Row 2: 1, 2, 1 → sum = 4 = 2²
- Row 3: 1, 3, 3, 1 → sum = 8 = 2³
In binomial coefficient notation, this means: C(n,0) + C(n,1) + C(n,2) + ... + C(n,n) = 2ⁿ
This follows directly from the Binomial Theorem: set x = y = 1 in (x + y)ⁿ, and you get (1 + 1)ⁿ = 2ⁿ, which is precisely the sum of all binomial coefficients in row n.
The Hockey Stick Identity
Now for something trickier: if you start at any 1 on the edge of Pascal's Triangle and move diagonally inward, stopping at some position, then the sum of all those diagonal entries equals the number directly below and to the side of where you stopped.
Formally: C(r,r) + C(r+1,r) + C(r+2,r) + ... + C(n,r) = C(n+1, r+1)
Why "hockey stick"? Draw the path on Pascal's Triangle—it looks like a hockey stick! The diagonal forms the blade, and the result sits at the end of the handle.
Analogy: Think of climbing stairs diagonally through Pascal's Triangle. The identity says: add up all your steps along one diagonal, and you'll get the exact value waiting one step beyond your endpoint.
Key Takeaway: The sum of row n in Pascal's Triangle is 2ⁿ, and the Hockey Stick Identity tells us that diagonal sums equal a single entry positioned strategically below them.