Gifting summations

Algebra Level 4

r = 0 10 3 r r ! ( 3 r 2 + 5 r + 1 ) r 2 + 3 r + 2 = 3 m n ! 12 12 \large\ \sum _{ r=0 }^{ 10 }{ \frac { { 3 }^{ r }r!\left( 3{ r }^{ 2 } + 5r + 1 \right) }{ { r }^{ 2 } + 3r + 2 } } = \frac { { 3 }^{ m }n! - 12 }{ 12 }

The equation above holds true for natural numbers m m and n n . Find m n m - n .


The answer is 0.

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

3 r ( r ) ! ( 3 r 2 + 5 r + 1 ) r 2 + 3 r + 2 = 3 r + 1 ( r + 1 ) ! r + 2 3 r ( r ) ! r + 1 \dfrac{3^{r}(r)!(3r^2+5r+1)}{r^2+3r+2} = \dfrac{3^{r+1}(r+1)!}{r+2} - \dfrac{3^{r}(r)!}{r+1}

Now enjoy telescoping :)

Let S k = r = 0 k 3 r r ! ( 3 r 2 + 5 r + 1 ) r 2 + 3 r + 2 \displaystyle S_k = \sum_{r=0}^k \frac {3^rr!(3r^2+5r+1)}{r^2+3r+2} . Then we can prove by induction that S k = 3 k + 1 ( k + 1 ) ! k + 2 1 S_k = \dfrac {3^{k+1}(k+1)!}{k+2}-1 for k = 0 k=0 .

Proof:

For k = 0 k=0 , S 0 = 3 0 0 ! ( 1 ) 2 = 1 2 = 3 0 + 1 ( 0 + 1 ) ! 0 + 2 1 S_0 = \dfrac {3^00!(1)}{2} = \dfrac 12 = \dfrac {3^{0+1}(0+1)!}{0+2}-1 . Therefore, the claim is true for k = 0 k=0 . Now assuming the claim is true for k k , then we have:

S k + 1 = S k + 3 k + 1 ( k + 1 ) ! ( 3 ( k + 1 ) 2 + 5 ( k + 1 ) + 1 ) ( k + 1 ) 2 + 3 ( k + 1 ) + 2 = 3 k + 1 ( k + 1 ) ! k + 2 1 + 3 k + 1 ( k + 1 ) ! ( 3 k 2 + 11 k + 9 ) ( k + 2 ) ( k + 3 ) = 3 k + 1 ( k + 1 ) ! k + 2 ( 1 + 3 k 2 + 11 k + 9 k + 3 ) 1 = 3 k + 1 ( k + 1 ) ! k + 2 ( 3 k 2 + 12 k + 12 k + 3 ) 1 = 3 k + 1 ( k + 1 ) ! k + 2 ( 3 ( k + 2 ) 2 k + 3 ) 1 = 3 k + 2 ( k + 2 ) ! k + 3 1 \begin{aligned} S_{k+1} & = S_k + \frac {3^{k+1}(k+1)!(3(k+1)^2+5(k+1)+1)}{(k+1)^2+3(k+1)+2} \\ & = \frac {3^{k+1}(k+1)!}{k+2}-1 + \frac {3^{k+1}(k+1)!(3k^2+11k+9)}{(k+2)(k+3)} \\ & = \frac {3^{k+1}(k+1)!}{k+2} \left(1+\frac {3k^2+11k+9}{k+3}\right) - 1 \\ & = \frac {3^{k+1}(k+1)!}{k+2} \left(\frac {3k^2+12k+12}{k+3}\right) - 1 \\ & = \frac {3^{k+1}(k+1)!}{k+2} \left(\frac {3(k+2)^2}{k+3}\right) - 1 \\ & = \frac {3^{k+2}(k+2)!}{k+3} - 1 \end{aligned}

This implies that the claim is also true for k + 1 k+1 and hence true for all k 0 k \ge 0 .

Therefore, S 10 = 3 11 11 ! 12 1 = 3 11 11 ! 12 12 S_{10} = \dfrac {3^{11}11!}{12} - 1 = \dfrac {3^{11}11!-12}{12} , m n = 11 11 = 0 \implies m-n = 11 - 11 = \boxed{0} .

Did the same

Aditya Kumar - 3 years, 4 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...