If k = 0 ∑ n k 3 + 9 k 2 + 2 6 k + 2 4 ( − 1 ) k ( k n ) can be expressed as α ( n + β ) ( n + γ ) 1 for some positive integers α , β , γ , what is α + β + γ ?
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.
Nice "cheating". I tried factoring the denominator and expressing the expression as partial fractions.It worked out fairly well,but then I couldn't see a way to proceed.I think the sum telescopes quite easily but I can't find a good way to make the sum telescope.
Two key elements are the partial fraction decomposition ( k + 2 ) ( k + 3 ) ( k + 4 ) 1 = k + 2 1 / 2 − k + 3 1 + k + 4 1 / 2 and the identity: k = 0 ∑ n k + η + 1 ( − 1 ) k ( k n ) = ∫ 0 1 x η k = 0 ∑ n ( k n ) ( − x ) k d x = ∫ 0 1 x η ( 1 − x ) n = ( n + η + 1 ) ⋅ … ⋅ ( n + 1 ) η ! . This two (pretty advanced) ingredients give that the original sum is just 2 ( n + 3 ) ( n + 4 ) 1 .
Is there any way to make the sum telescope somehow?Not having any idea about integration,I would like to see a calculus-free solution.
∑ k = 0 n k 3 + 9 k 2 + 2 6 k + 2 4 ( − 1 ) k ( k n )
= ∑ k = 0 n ( k + 2 ) ( k + 3 ) ( k + 4 ) ( − 1 ) k ( k n )
= ∑ k = 0 n ( − 1 ) k ( n + 1 ) ( n + 2 ) ( n + 3 ) ( n + 4 ) k + 1 ( k + 4 n + 4 )
= ( n + 1 ) ( n + 2 ) ( n + 3 ) ( n + 4 ) 1 ∑ k = 4 n ( − 1 ) k ( k − 3 ) ( k n + 4 )
∑ k = 0 n + 4 ( − 1 ) k ( k − 3 ) ( k n + 4 )
= ∑ k = 0 n + 4 ( − 1 ) k k ( k n + 4 ) − 3 ∑ k = 0 n + 4 ( − 1 ) k ( k n + 4 )
= ∑ k = 1 n + 4 ( − 1 ) k k ( k n + 4 ) − 3 ( 1 − 1 ) n + 4
= n + 4 1 ∑ k = 1 n + 4 ( − 1 ) k ( k − 1 n + 3 )
= n + 4 1 ( 1 − 1 ) n + 3 = 0
Hence, ∑ k = 4 n ( − 1 ) k ( k − 3 ) ( k n + 4 )
= − ∑ k = 0 3 ( − 1 ) k ( k − 3 ) ( k n + 4 )
= 3 ( 0 n + 4 ) − 2 ( 1 n + 4 ) + ( 2 n + 4 ) = 2 ( n + 1 ) ( n + 2 )
Problem Loading...
Note Loading...
Set Loading...
Nice problem, but note that one might say that the following "solution" I present is also known as cheating . So read at your own risk.
Note that, if this problem is not flawed, the relationship given is true and it holds for all n ≥ 0 . There are three unknowns: α , β , and γ , so if we have three independent equations relating α , β , and γ , we can solve for them.
For n = 0 , the sum is k = 0 ∑ 0 k 3 + 9 k 2 + 2 6 k + 2 4 ( − 1 ) k ( k 0 ) = 2 4 1 = α β γ 1 .
For n = 1 , the sum is k = 0 ∑ 1 k 3 + 9 k 2 + 2 6 k + 2 4 ( − 1 ) k ( k 1 ) = 2 4 1 − 6 0 1 = 4 0 1 = α ( 1 + β ) ( 1 + γ ) 1 .
For n = 2 , the sum is k = 0 ∑ 2 k 3 + 9 k 2 + 2 6 k + 2 4 ( − 1 ) k ( k 2 ) = 2 4 1 − 6 0 2 + 1 2 0 1 = 6 0 1 = α ( 2 + β ) ( 1 + γ ) 1 .
From these, we get the set of equations: α β γ α ( 1 + β ) ( 1 + γ ) α ( 2 + β ) ( 2 + γ ) = = = 2 4 , 4 0 , 6 0 .
At this point, you realize that there are several integer solutions but α > 1 is probably the case, so α = 2 and β + γ = 7 , giving the answer α + β + γ = 9 .
It also turns out that this is correct, using WolframAlpha: k = 0 ∑ n k 3 + 9 k 2 + 2 6 k + 2 4 ( − 1 ) k ( k n ) = 2 n 2 + 1 4 n + 2 4 1 .
Finally, a note to @Abhishek Singh - it is a good habit to name your problems for descriptively. First of all, the title says nothing about the problem itself. Second, it makes people who cannot solve the problem feel bad, since you are calling it "simple" - it may be simple for you but it's definitely not simple for everybody.