Combinatorial Sum

r = 1 n r 3 ( n r ) = 2 n 3 ( n 3 + a n 2 + b n + c ) \sum_{r=1}^{n}r^3 {n \choose r} = 2^{n-3}\left(n^3+an^2+bn+c\right)

Find the value of a 2 + b 2 + c 2 a^2+b^2+c^2 if the above equation is true for all integers r r and n n .


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.

2 solutions

Pi Han Goh
Dec 21, 2015

We start by writing r 3 ( n r ) r^3 \dbinom nr as a linear combination of binomial coefficients . Note that

r 3 = r ( r 1 ) ( r 2 ) + 3 r ( r 1 ) + r r^3 = r(r-1)(r-2) + 3r(r-1) + r

The summation becomes

r = 1 n [ r ( r 1 ) ( r 2 ) + 3 r ( r 1 ) + r ] ( n r ) = r = 4 n [ r ( r 1 ) ( r 2 ) ( n r ) ] + 3 r = 3 n [ r ( r 1 ) ( n r ) ] + r = 2 n [ ( r ( n r ) ] \begin{aligned} && \displaystyle \sum_{r=1}^n \left [ r(r-1)(r-2) + 3r(r-1) + r \right] \dbinom nr \\ &=&\displaystyle \sum_{r=4}^n \left[ r(r-1)(r-2)\dbinom nr \right ] + 3 \sum_{r=3}^n \left [r(r-1)\dbinom nr \right ]+ \sum_{r=2}^n \left [ (r\dbinom nr \right ] \end{aligned}

Note that

r ( r 1 ) ( r 2 ) ( n r ) = r ( r 1 ) ( r 2 ) n ! ( n r ) ! r ! = n ! ( n r ) ! ( r 3 ) ! = n ( n 1 ) ( n 2 ) ( n 3 ) ! ( n r ) ! ( r 3 ) ! = n ( n 1 ) ( n 2 ) ( n 3 r 3 ) \begin{aligned} r(r-1)(r-2)\dbinom nr &=& r(r-1)(r-2) \cdot \dfrac{n!}{(n-r)!r!} \\ &=& \dfrac{n!}{(n-r)!(r-3)!} \\ &=& n(n-1)(n-2) \cdot \dfrac{(n-3)!}{(n-r)!(r-3)!} \\ &=& n(n-1)(n-2) \cdot \dbinom {n-3}{r-3} \end{aligned}

Similarly, r ( r 1 ) ( n r ) = n ( n 1 ) ( n 2 r 2 ) r(r-1)\dbinom nr = n(n-1)\cdot \dbinom{n-2}{r-2} and r ( n r ) = n ( n 1 r 1 ) r\dbinom nr = n\dbinom{n-1}{r-1} .

Our sum is equal to

n ( n 1 ) ( n 2 ) r = 3 n ( n 3 r 3 ) + 3 n ( n 1 ) r = 2 n ( n 2 r 2 ) + n r = 1 n ( n 1 r 1 ) . \displaystyle n(n-1)(n-2) \sum_{r=3}^n \dbinom{n-3}{r-3} + 3n(n-1) \sum_{r=2}^n \dbinom{n-2}{r-2} + n \sum_{r=1}^n \dbinom{n-1}{r-1}.

Once we apply the property j = 0 n ( n j ) = 2 j \displaystyle \sum_{j=0}^n \dbinom nj = 2^j , the summation simplifies to

n ( n 1 ) ( n 2 ) 2 n 3 + 3 n ( n 1 ) 2 n 2 + n 2 n 1 = 2 n 3 ( n 3 + 3 n 2 ) . n(n-1)(n-2) \cdot 2^{n-3} + 3n(n-1) \cdot 2^{n-2} + n \cdot 2^{n-1} = 2^{n-3} (n^3 + 3n^2 ) .

Lavneesh Nyol
Dec 4, 2015

Best and the quickest solution is to put value of (r,n) as (1,1), (1,2) and (1,3) (as the given equation is valid for all r and n) and obtain 3 simple equations in a, b and c.

For (r,n)= (1,1): The equation is -> a+b+c=3

For (r,n)= (1,2): The equation is -> 4a+2b+c=12

For (r,n)= (1,3): The equation is -> 9a+3b+c=27

Solving the above equations, we get a=3, b=0 and c=0

Hence, a^ 2 {2} +b^ 2 {2} +c^ 2 {2} = 9 \boxed{9}

This is wrong. You did not prove that it's true for all values of n n .

Pi Han Goh - 5 years, 6 months ago

Can you generalize that summation please

Akhilesh Vibhute - 5 years, 5 months ago

Simulated for n = 10, 11, 12, 13 and 14:

I actually found b = n - 1 and c = n when a = 2, OR b = 2 (n - 1) and c = 2 n when a = 1.

I applied a = 2, b = n - 1 and c = n for

n 3 + 2 n 2 + ( n 1 ) n + n = n 3 + 2 n 2 + n 2 n + n = n 3 + 3 n 2 + 0 + 0. n^3 + 2 n^2 + (n-1) n + n = n^3 + 2 n^2 + n^2 - n + n = n^3 + 3 n^2 + 0 + 0.

Not a genuine way but a 2 + b 2 + c 2 = 3 2 + 0 2 + 0 2 = 9 a^2 + b^2 + c^2 = 3^2 + 0^2 + 0^2 = 9 is determined.

Answer: 9 \boxed{9}

Lu Chee Ket - 5 years, 6 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...