1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 ⋮ ⋮ ⋮ ⋮ ⋮ 1 2 5 3 0 0 2 3 0 0 1 2 6 5 0 ⋯ 1 2 6 3 2 5 2 6 0 0 1 4 9 5 0 ⋯ 1 0 0 0
Pascal's triangle is shown above for the 0 th row through the 4 th row, and parts of the 2 5 th and 2 6 th rows are also shown above.
What is the sum of all the 2 nd elements of each row up to the 2 5 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 row. Then, the next row down is the 1 st row, and so on. The leftmost element in each row of Pascal's triangle is the 0 th element. Then, the element to the right of that is the 1 st element in that row, and so on.
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.
Thanks, I added some additional clarification in the problem!
Nice question. Note that the red terms appear to be the 3rd terms rather than the 2nd.
Log in to reply
No. Actually we start from 0 t h term so the red one will be called 2 n d term.
If you look closer, the highlighted red terms are triangular numbers
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 :)
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 sum up to 4 , which is directly below 3 . Similarly, 4 + 6 sums up to 1 0 , which is directly below 6 . Continuing this, we finally see that 3 0 0 + 2 3 0 0 sums up to 2 6 0 0 , which is directly below 3 0 0 , 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.
An algebraic approach:
Notice that
1 , 1 + 2 = 3 , 1 + 2 + 3 = 6 …
From here, we can deduce that each highlighted term, T n , represents the sum of the first n terms of the arithmetic progression 1 , 2 , 3 , …
We can also say that T n = k = 1 ∑ n k = 2 n ( n + 1 )
There are 2 4 terms from the 2 nd row to the 2 5 th row, and the sum of all these terms are
S 2 4 = k = 1 ∑ 2 4 2 k ( k + 1 ) = 2 1 k = 1 ∑ 2 4 ( k 2 + k ) = 2 1 ( 6 2 4 ( 2 5 ) ( 4 9 ) + 2 2 4 ( 2 5 ) ) = 2 1 ( 4 9 0 0 + 3 0 0 ) = 2 5 2 0 0 = 2 6 0 0
Could you please tell what did you do after second step to get the third?
Please explain too
@Johannes R @Pradyumn Sharma do you mean this?
T n = k = 1 ∑ n k = 2 n ( n + 1 )
Log in to reply
Yes... how is this called?
Log in to reply
Simple. There are two ways to explain this:
1) Notice that T n = 1 + 2 + 3 + … + n . We can represent this as a sum of k . Therefore, we can say that
T n = k = 1 ∑ n k
The formula for the sum of k is in the link above
2) Otherwise, you can use the formula for sum of the first k terms of an arithmetic progression :
Consider an AP of k terms: 1 , 2 , 3 , … , n where a = 1 , T k = n and k = n
T n = S k = 2 k ( a + T k ) = 2 n ( 1 + n ) = 2 n ( n + 1 )
Nicely put. I really like that you used an algebraic approach to solve this problem. +1!
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}.
Problem Loading...
Note Loading...
Set Loading...
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 ( r k ) = ( r + 1 n + 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 2 6 0 0 , which is equal to ( 2 + 1 2 5 + 1 ) .