Pascal's hockey shot

1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 1 25 300 2300 12650 1 26 325 2600 14950 1000 \begin{array}{c} 1 \end{array} \\ \begin{array}{cc} 1 & 1 \end{array} \\ \begin{array}{ccc} 1 & 2 & \color{#D61F06}{1}\end{array} \\ \begin{array}{cccc} 1 & 3 & \color{#D61F06}{3} & 1\end{array} \\ \begin{array}{ccccc} 1 & 4 & \color{#D61F06}{6} & 4 & 1\end{array} \\ \begin{array}{cccccc} \vdots & \hphantom{\vdots} & \vdots & \hphantom{\vdots} & \vdots \end{array}\\ \begin{array}{cccccc} 1 & 25 & \color{#D61F06}{300} & 2300 & 12650 & \cdots \end{array} \\ \begin{array}{ccccccc} 1 & 26 & 325 & 2600 & 14950 & \cdots & \hphantom{1000} \end{array} \\

Pascal's triangle is shown above for the 0 th 0^\text{th} row through the 4 th 4^\text{th} row, and parts of the 2 5 th 25^\text{th} and 2 6 th 26^\text{th} rows are also shown above.

What is the sum of all the 2 nd 2^\text{nd} elements of each row up to the 2 5 th 25^\text{th} row?


Note : The visible elements to be summed are highlighted in red.

Additional clarification : The topmost row in Pascal's triangle is the 0 th 0^\text{th} row. Then, the next row down is the 1 st 1^\text{st} row, and so on. The leftmost element in each row of Pascal's triangle is the 0 th 0^\text{th} element. Then, the element to the right of that is the 1 st 1^\text{st} element in that row, and so on.


The answer is 2600.

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.

5 solutions

Andy Hayes
Jun 27, 2016

Relevant wiki: Hockey Stick Identity

There is a pattern in Pascal's Triangle called the " Hockey Stick Pattern ," which is based on the Hockey Stick Identity : k = r n ( k r ) = ( n + 1 r + 1 ) \displaystyle\sum\limits_{k=r}^{n}\binom{k}{r}=\binom{n+1}{r+1} .

If you sum all the elements in red, then the sum will be the next element down diagonally in the opposite direction. If you are familiar with the game of hockey, you will recognize that the circled numbers resembles a hockey stick:

The answer is 2600 \boxed{2600} , which is equal to ( 25 + 1 2 + 1 ) \binom{25+1}{2+1} .

Thanks, I added some additional clarification in the problem!

Andy Hayes - 4 years, 11 months ago

Nice question. Note that the red terms appear to be the 3rd terms rather than the 2nd.

Brian Charlesworth - 4 years, 11 months ago

Log in to reply

No. Actually we start from 0 t h 0^{th} term so the red one will be called 2 n d 2^{nd} term.

Anurag Pandey - 4 years, 8 months ago

If you look closer, the highlighted red terms are triangular numbers

Mohammad Farhat - 2 years, 10 months ago
Bli Bla
Jun 28, 2016

My first solution on this website, also algebraic:

Notice that: 1, 2, 3, 6, 10...

Is equal to: 1+0, 1+2, 3+3, 6+4, 10+5... etc.

Here we can see that each number appears twice, so we can also write everything as:

2 x 1 + 2 which are the first 2 numbers 2 x 6 + 4, 2 x 15 + 6,
until 2 x 276 + 24

Notice that these numbers are the numbers we add but squared So they are: 2^2 4^2 6^2 8^2 etc.

So we can write them as the sum of (2n)^2 from 1 to 12 or 4n^2. And this is equal to: 4k(k+1)(2k+1)/6

We put 12 into the equation and get 2600

I sorted went the same way, except I didn't notice the squares but deduced it, since any 2 consecutive numbers' sum would be the sum of the sum of the numbers up to those numbers minus 1, (row 8 number + row 9 number is 7 8/2+8 9/2 from the n(n+1)/2 formula). This sum comes out as the square of the first row number in the pair: (n-1)n/2+n(n+1)/2=n^2. So I got to 2^2+4^2+...+24^2 this way :)

József Inczefi - 4 years, 3 months ago
Manuel Kahayon
Jun 28, 2016

Without a combinatorial approach, we see that the sum of two consecutive numbers in the triangle is equal to the number directly below them, so in the figure, we see that the first two elements, 1 + 3 1+3 sum up to 4 4 , which is directly below 3 3 . Similarly, 4 + 6 4+6 sums up to 10 10 , which is directly below 6 6 . Continuing this, we finally see that 300 + 2300 300+2300 sums up to 2600 \boxed{2600} , which is directly below 300 300 , and, quite coincidentally, is our final answer.

P.S. Sorry if I have no visuals, as I am not yet that well versed in LaTeX.

Hung Woei Neoh
Jun 28, 2016

An algebraic approach:

Notice that

1 , 1 + 2 = 3 , 1 + 2 + 3 = 6 1, \; 1+2=3,\; 1+2+3=6 \ldots

From here, we can deduce that each highlighted term, T n T_n , represents the sum of the first n n terms of the arithmetic progression 1 , 2 , 3 , 1,2,3,\ldots

We can also say that T n = k = 1 n k = n ( n + 1 ) 2 T_n = \displaystyle \sum_{k=1}^n k = \dfrac{n(n+1)}{2}

There are 24 24 terms from the 2 nd 2^{\text{nd}} row to the 2 5 th 25^{\text{th}} row, and the sum of all these terms are

S 24 = k = 1 24 k ( k + 1 ) 2 = 1 2 k = 1 24 ( k 2 + k ) = 1 2 ( 24 ( 25 ) ( 49 ) 6 + 24 ( 25 ) 2 ) = 1 2 ( 4900 + 300 ) = 5200 2 = 2600 S_{24} \\ = \displaystyle \sum_{k=1}^{24} \dfrac{k(k+1)}{2}\\ =\dfrac{1}{2}\displaystyle\sum_{k=1}^{24}(k^2+k)\\ =\dfrac{1}{2}\left(\dfrac{24(25)(49)}{6} + \dfrac{24(25)}{2}\right)\\ =\dfrac{1}{2}\left(4900 +300\right)\\ =\dfrac{5200}{2}\\ =\boxed{2600}

Could you please tell what did you do after second step to get the third?

Pradyumn Sharma - 4 years, 11 months ago

Please explain too

Johannes R - 4 years, 11 months ago

@Johannes R @Pradyumn Sharma do you mean this?

T n = k = 1 n k = n ( n + 1 ) 2 T_n = \displaystyle \sum_{k=1}^n k = \dfrac{n(n+1)}{2}

Hung Woei Neoh - 4 years, 11 months ago

Log in to reply

Yes... how is this called?

Johannes R - 4 years, 11 months ago

Log in to reply

Simple. There are two ways to explain this:

1) Notice that T n = 1 + 2 + 3 + + n T_n = 1+2+3+\ldots+n . We can represent this as a sum of k k . Therefore, we can say that

T n = k = 1 n k T_n = \displaystyle \sum_{k=1}^n k

The formula for the sum of k k is in the link above

2) Otherwise, you can use the formula for sum of the first k k terms of an arithmetic progression :

Consider an AP of k k terms: 1 , 2 , 3 , , n 1,2,3,\ldots,n where a = 1 , T k = n a=1,\;T_k = n and k = n k=n

T n = S k = k 2 ( a + T k ) = n 2 ( 1 + n ) = n ( n + 1 ) 2 T_n =S_k= \dfrac{k}{2}(a+T_k) = \dfrac{n}{2}(1+n) = \dfrac{n(n+1)}{2}

Hung Woei Neoh - 4 years, 11 months ago

Log in to reply

@Hung Woei Neoh Thank you!!

Johannes R - 4 years, 11 months ago

Nicely put. I really like that you used an algebraic approach to solve this problem. +1!

Akeel Howell - 4 years, 5 months ago
Rohan K
Jul 14, 2016

We know that each row in the Pascal's triangle has the coefficients for the expression of (x+1)^n where n runs from 0 to \infty. From the highlighted terms, we can thus infer that they are the successive terms of the sequence n C 2 added from 1 to 25. Doing some simple summation we arrive at \boxed{2600}.

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...