Can you find a formula for this?

Algebra Level 3

{ 1 + 2 + 3 + + ( n 1 ) + n = n ( n + 1 ) 2 1 2 + 2 2 + 3 3 + + ( n 1 ) 2 + n 2 = n ( n + 1 ) ( 2 n + 1 ) 6 \begin{cases} 1 + 2 + 3 + \cdots + (n-1) + n = \dfrac {n(n+1)}2 \\ 1^2 + 2^2 + 3^3 + \cdots + (n-1)^2 + n^2 = \dfrac {n(n+1)(2n+1)}6 \end{cases}

Using the well-known identities for the sum of first n n positive integers and sum of first n n squares above, find the identity for the following sum:

1 ( n ) + 2 ( n 1 ) + 3 ( n 2 ) + + ( n 1 ) ( 2 ) + n ( 1 ) 1(n) + 2(n-1) + 3(n-2)+ \cdots + (n-1)(2) + n(1)

If the answer can be expressed as ( n + a ) ( n + b ) ( n + c ) d \dfrac{(n+a)(n+b)(n+c)}{d} , find a + b + c + d a + b + c + d .


The answer is 9.

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.

4 solutions

David Vreken
Jun 27, 2020

The different terms represent the number of dots in different diagonal slices of a regular tetrahedron, so the sum of the terms will be a tetrahedral number. The following picture shows the specific case for n = 4 n = 4 :

Since the n th n^{\text{th}} tetrahedral number is n ( n + 1 ) ( n + 2 ) 6 \frac{n(n + 1)(n + 2)}{6} , that means a = 0 a = 0 , b = 1 b = 1 , c = 2 c = 2 , d = 6 d = 6 , and a + b + c + d = 9 a + b + c + d = \boxed{9} .

Excellent visualization

Vijay Simha - 11 months, 2 weeks ago

I wish I thought of it that way! This seems far more clever than my pitiful re-arrangement of terms.

Yugendra Uppalapati - 10 months, 1 week ago
Chew-Seong Cheong
Jun 26, 2020

In summation notations, we have k = 1 n k = n ( n + 1 ) 2 \displaystyle \sum_{k=1}^n k = \dfrac {n(n+1)}2 , k = 1 n k 2 = n ( n + 1 ) ( 2 n + 1 ) 6 \displaystyle \sum_{k=1}^n k^2 = \dfrac {n(n+1)(2n+1)}6 , and

S = 1 ( n ) + 2 ( n 1 ) + 3 ( n 2 ) + + ( n 1 ) ( 2 ) + n ( 1 ) = k = 1 n k ( n + 1 k ) = k = 1 n ( ( n + 1 ) k k 2 ) = ( n + 1 ) k = 1 n k k = 1 n k 2 = ( n + 1 ) n ( n + 1 ) 2 n ( n + 1 ) ( 2 n + 1 ) 6 = n ( n + 1 ) 6 ( 3 ( n + 1 ) ( 2 n + 1 ) ) = n ( n + 1 ) ( n + 2 ) 6 \begin{aligned} S & = 1(n) + 2(n-1) + 3(n-2)+ \cdots + (n-1)(2) + n(1) \\ & = \sum_{k=1}^n k(n+1-k) \\ & = \sum_{k=1}^n ((n+1)k-k^2) \\ & = (n+1) \sum_{k=1}^n k - \sum_{k=1}^n k^2 \\ & = \frac {(n+1)n(n+1)}2 - \frac {n(n+1)(2n+1)}6 \\ & = \frac {n(n+1)}6 \cdot (3(n+1) - (2n+1)) \\ & = \frac {n(n+1)(n+2)}6 \end{aligned}

Therefore a + b + c + d = 0 + 1 + 2 + 6 = 9 a+b+c+d = 0+1+2+6 = \boxed 9 .

Valentino Wu
Jun 26, 2020

1 × n + 2 × ( n 1 ) + 3 × ( n 2 ) + . . . + ( n 1 ) × 2 + n × 1 1 \times n + 2 \times (n-1) + 3 \times (n-2) + ... + (n-1) \times 2 + n \times 1 can be rewritten as:

1 + ( 1 + 2 ) + ( 1 + 2 + 3 ) + ( 1 + 2 + 3 + 4 ) + . . . + ( 1 + 2 + 3 + . . . + n ) 1 + (1 + 2) + (1 + 2 + 3) + (1 + 2 + 3 + 4) + ... + (1 + 2 + 3 + ... + n)

The expression above has (n) 1's, (n-1) 2's, (n-2) 3's, ... , and 1 n'(s). Therefore it is equivalent to the sum of the first n triangle numbers. The formula for the x t h ^{th} triangle number is the first formula,

1 + 2 + 3 + 4 + . . . + x = 1 2 ( x 2 + x ) 1 + 2 + 3 + 4 + ... + x = \frac{1}{2}(x^2+x) , and so we plug in 1, 2, 3, all the way to n for x, and then sum it all up.

So the expression is

1 2 [ ( 1 2 + 2 2 + 3 2 + . . . + n 2 ) + ( 1 + 2 + 3 + . . . + n ) ] = 1 2 [ n ( n + 1 ) 2 + n ( n + 1 ) ( 2 n + 1 ) 6 ] \frac{1}{2}[(1^2 + 2^2 + 3^2 + ... + n^2) + (1 + 2 + 3 + ... + n)] = \frac{1}{2}[\frac{n(n+1)}{2} + \frac{n(n+1)(2n+1)}{6}] ,

and then through some simplification we arrive at the formula,

1 × n + 2 × ( n 1 ) + 3 × ( n 2 ) + . . . + ( n 1 ) × 2 + n × 1 = n ( n + 1 ) ( n + 2 ) 6 a = 0 , b = 1 , c = 2 , d = 6 1 \times n + 2 \times (n-1) + 3 \times (n-2) + ... + (n-1) \times 2 + n \times 1 = \frac{n(n+1)(n+2)}{6} \Rightarrow a = 0, b = 1, c = 2, d = 6

a + b + c + d = 0 + 1 + 2 + 6 = 9 a + b + c + d = 0 + 1 + 2 + 6 = \boxed{9} .

Very nice. I wonder if there's a geometric "proof without words" (the sum of triangular numbers is a tetrahedral number). Also, these numbers are one of the diagonals of Pascal's triangle.

Chris Lewis - 11 months, 3 weeks ago

Log in to reply

Each layer in a regular tetrahedron is the next triangular number, so the sum of triangular numbers is a tetrahedral number.

David Vreken - 11 months, 2 weeks ago

Log in to reply

Ah, sorry, I wasn't clear in my comment there - I meant a wordless way of proving the formula in the question.

Chris Lewis - 11 months, 2 weeks ago

Log in to reply

@Chris Lewis Oh, I see. Good question!

David Vreken - 11 months, 2 weeks ago

@Chris Lewis Got one. The different terms represent the number of dots in diagonal slices of a regular tetrahedron, and the following picture shows the specific case for n = 4 n = 4 :

David Vreken - 11 months, 2 weeks ago

Log in to reply

@David Vreken Yessss...very nice!!

Chris Lewis - 11 months, 2 weeks ago
Aryan Sanghi
Jun 27, 2020

The series can be expressed as

T r = r ( n r + 1 ) T_r = r(n - r +1)

T r = ( n + 1 ) r r 2 T_r = (n + 1)r - r^2

r = 1 n T r = ( n + 1 ) r = 1 n r r = 1 n r 2 \sum_{r=1}^n T_r = (n+1)\sum_{r=1}^nr - \sum_{r=1}^n r^2

S = ( n + 1 ) n ( n + 1 ) 2 n ( n + 1 ) ( 2 n + 1 ) 6 S = (n+1)\frac{n(n+1)}{2} - \frac{n(n+1)(2n+1)}{6}

S = n ( n + 1 ) ( n + 2 ) 6 S = \frac{n(n+1)(n+2)}{6}

So, a = 0 a = 0 , b = 1 b = 1 , c = 2 c = 2 and d = 6 d = 6

So, a + b + c + d = 9 \boxed{a + b + c + d = 9}

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...