Problems

Age
Difficulty
Found: 14

The picture below shows the ‘hockey-stick’ identity in Pascal’s triangle.

image

It says that if you start one of the diagonals formed of 1s at the edge, then follow the numbers diagonally in one direction (e.g. left in the picture) and then change direction on your final turn (right in the picture), then the sum of the all but the last number is equal to the last number.

Prove this is true. Written algebraically, (rr)+(r+1r)+...+(n1r)+(nr)=(n+1r+1), where 0rn.

In the nth row of Pascal’s triangle, leave the left 1 untouched, multiply the next number along (which is (n1)=n) by 2, multiply the next number along (which is (n2)=n(n12) by 4, and so on, until you multiply the right-hand 1 by 2n. That is, multiply the kth number from the left by 2k.

Now what’s the sum of the numbers in the nth row?

Let sn be the product of the numbers in the nth row. (e.g. s3=1331=9) What’s the limit limnsn1sn+1sn2?

Other than 1, does any number appear more than eight times in Pascal’s triangle?