The Fibonacci sequence \(F_{n}\) is given by
F1=F2=1,Fn+2=Fn+1+FnF_{1}=F_{2}=1, F_{n+2}=F_{n+1}+F_nF1=F2=1,Fn+2=Fn+1+Fn (n∈N).(n\in\mathbb{N}).(n∈N).
Prove that F2n=F2n+23+F2n−239−2F2n3F_{2n}=\frac{F^3_{2n+2}+F^3_{2n-2}}{9}-2F^3_{2n}F2n=9F2n+23+F2n−23−2F2n3
for all n≥2n\geq2n≥2.
Source: 101 Problems in Algebra book by T. Andreescu & Z. Feng
Note by Jane Maleza 1 year, 9 months ago
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*
_italics_
**bold**
__bold__
- bulleted- list
1. numbered2. list
paragraph 1paragraph 2
paragraph 1
paragraph 2
[example link](https://brilliant.org)
> This is a quote
This is a quote
# I indented these lines # 4 spaces, and now they show # up as a code block. print "hello world"
\(
\)
\[
\]
2 \times 3
2^{34}
a_{i-1}
\frac{2}{3}
\sqrt{2}
\sum_{i=1}^3
\sin \theta
\boxed{123}
There are no comments in this discussion.
Problem Loading...
Note Loading...
Set Loading...
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
There are no comments in this discussion.