Let T n = 1 + 2 + ⋯ + n . What is 1 + 2 + ⋯ + 1 2 3 4 T 1 + T 2 + ⋯ + T 1 2 3 4 ?
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.
Very neat solution!!!
There's a shorter proof for T 1 + T 2 + ⋯ + T n = 6 n ( n + 1 ) ( n + 2 ) . Hint: read the title.
Log in to reply
Are you talking about the hockey stick method in Pascal triangle. As the triangular numbers are also present in Pascal triangle we could use that fact too . Right?😀
Log in to reply
YESSSSSSSSSSSSSS
Log in to reply
@Pi Han Goh – Just read it up. I guess it makes sense, from a combinatorial point of view. Especially given that a triangular number T n can also be expressed as ( 2 n + 1 ) , one can derive that:
∑ i = 1 n T i = ∑ i = 1 n ( 2 i + 1 ) = ( 3 n + 2 )
Log in to reply
@A Former Brilliant Member – EXACTLYYY! Hope you enjoyedd this question
Relevant wiki: Sum of n, n², or n³
Q n = 1 + 2 + 3 + . . . + n T 1 + T 2 + T 3 + . . . + T n = 1 + 2 + 3 + . . . n n + 2 ( n − 1 ) + 3 ( n − 2 ) + . . . + n = ∑ k = 1 n k ∑ k = 1 n k ( n + 1 − k ) = ∑ k = 1 n k ( n + 1 ) ∑ k = 1 n k − ∑ k = 1 n k 2 = n + 1 − ∑ k = 1 n k ∑ k = 1 n k 2 = n + 1 − 2 n ( n + 1 ) 6 n ( n + 1 ) ( 2 n + 1 ) = n + 1 − 3 2 n + 1 = 3 n + 2
⟹ Q 1 2 3 4 = 3 1 2 3 4 + 2 = 4 1 2
Let’s solve the problem in general (for n ∈ N , n > 1 ) first:
T n = 1 + 2 + . . . + n = 2 n ( n + 1 ) = 0 . 5 ( n 2 + n )
1 + 2 + . . . + n T 1 + T 2 + . . . + T n = 1 + 2 + . . . + n 0 . 5 ( ( 1 2 + 2 2 + . . . + n 2 ) + ( 1 + 2 + . . . + n ) ) =
= 0 . 5 n ( n + 1 ) 0 . 5 ( 6 n ( n + 1 ) ( 2 n + 1 ) + 0 . 5 n ( n + 1 ) ) = n ( n + 1 ) n ( n + 1 ) ( 6 2 n + 1 + 0 . 5 ) = 6 2 n + 1 + 0 . 5 = 6 2 n + 4
In our case, n = 1234 :
6 2 n + 4 = 6 2 × 1 2 3 4 + 4 = 6 2 4 7 2 = 4 1 2
Tetrahedral number / triangular number
Problem Loading...
Note Loading...
Set Loading...
Here's a novel but refreshingly nice way to solve this problem.
First, note that:
T n = 1 + 2 + ⋯ + n = k = 1 ∑ n k = 2 n ( n + 1 )
Given that:
1 2 + 2 2 + ⋯ + n 2 = k = 1 ∑ n k 2 = 6 n ( n + 1 ) ( 2 n + 1 )
then:
k = 1 ∑ n T k = k = 1 ∑ n 2 k ( k + 1 ) = 2 1 k = 1 ∑ n k 2 + 2 1 k = 1 ∑ n k = 1 2 n ( n + 1 ) ( 2 n + 1 ) + 4 n ( n + 1 ) = 1 2 n ( n + 1 ) ( 2 n + 1 ) + 1 2 3 n ( n + 1 ) = 1 2 n ( n + 1 ) ( 2 n + 1 + 3 ) = 6 n ( n + 1 ) ( n + 2 )
Let:
S n = 1 + 2 + ⋯ + n T 1 + T 2 + ⋯ + T n
So:
S n = 2 n ( n + 1 ) 6 n ( n + 1 ) ( n + 2 ) = 3 n + 2
and:
S 1 2 3 4 = 3 1 2 3 6 = 4 1 2
as required.