Prove the following -
\displaystyle \begin{equation*} 1 - \cfrac{1}{n+\cfrac{2n}{n-3+\cfrac{3(n-1)}{n-5+\cfrac{4(n-2)}{\ddots \cfrac{(m-1)(n-m+3)}{n-(2m-3)}}}}} \end{equation*} = \sum_{0\le k <m}{\dfrac{{(-1)}^k}{\binom{n}{k}}} = \dfrac{n+1}{n+2}\left(1 + \frac{{(-1)}^{m+1}}{\binom{n+1}{m}}\right)
The continued fraction part is optional. It is just a bonus.
This is completely original.
Easy Math Editor
This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.
When posting on Brilliant:
*italics*
or_italics_
**bold**
or__bold__
paragraph 1
paragraph 2
[example link](https://brilliant.org)
> This is a quote
\(
...\)
or\[
...\]
to ensure proper formatting.2 \times 3
2^{34}
a_{i-1}
\frac{2}{3}
\sqrt{2}
\sum_{i=1}^3
\sin \theta
\boxed{123}
Comments
S=r=0∑m−1(rn)(−1)r
=r=0∑m−1(−1)rn!r!(n−r)!
=r=0∑m−1(−1)rn!r!(n−r)!(n−r+1+r+1)×(n+2)1
=r=0∑m−1n!(n+2)1[(−1)r{r!(n−r+1)!+(n−r)!(r+1)!}]
=r=0∑m−1n!(n+2)1[Tr−Tr+1]
where Tr=(−1)rr!(n−r+1)!
Evaluating using telescoping the sum, we have,
S=n+2n+1⎝⎜⎜⎛1+(mn+1)(−1)m+1⎠⎟⎟⎞
Some other methods can be to use Beta functions or using the result (from Partial Fractions)
(kn)1=j=1∑k(−1)k−j(jk)n−j+1j
The continued fraction result is fascinating! I'll work on it when I get some time.
Log in to reply
@Kartik Sharma Btw, what was your approach to this problem?
Log in to reply
I used Finite Calculus(Gosper's Method). I thought of beta functions but it was tedious. Telescoping serious was very nice although a bit too tricky.
I will add my method later. For the continued fraction part if you are asking, then I used a standard result in the theory of evaluating continued fractions.
Log in to reply
Gosper's method?
I was talking about the summation. I assume thisI have added some explanation in the telescoping part for clarity
Log in to reply