The Pascal's triangle is a triangle filled with numbers. The zeroth row is ,
the first is ,
the second is ,
the third is ,
the fourth is , and so on. Let be the digit sum of the 16th number in the twenty-eighth row. Find
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
We can see a pattern in each row of the Pascal's Triangle. If we take the p th row of the Pascal's Triangle and the r th element of that row, then the value of the element is equal to the binomial coefficient ( r − 1 p ) i.e, p C ( r − 1 ) . So, in this case, the value of the 1 6 th element in the 2 8 th row is equal to the binomial coefficient ( 1 6 − 1 2 8 ) = ( 1 5 2 8 ) = 1 5 ! × ( 2 8 − 1 5 ) ! 2 8 ! = 1 5 ! × 1 3 ! 2 8 ! = 3 7 4 4 2 1 6 0
Now, we have that n is the digit sum of this large value, so we have ----
n = 3 + 7 + 4 + 4 + 2 + 1 + 6 + 0 = 2 7
So, finally we have n 2 = 2 7 2 = 7 2 9