How can I prove this mathematical by induction? $(2) = (+1)^2 − (−1)^2$
and using this relation F(2n+1)=F(n+1)^2+F(n)^2
Asked
Active
Viewed 65 times
1
-
In short, this is hard to prove without the other relation mentioned in the "duplicate question" $F_{2n-1} = F_n^2+F_{n-1}^2$. – player3236 Nov 03 '20 at 12:24
-
that's the problem they don't given me this F(2n−1=)F(2n)+F(2n−1) . – Mohanad Sfe Nov 03 '20 at 12:34
-
i have this relation F(2n+1)=F(n+1)^2+F(n)^2 , how it can help me? – Mohanad Sfe Nov 03 '20 at 12:49
-
Please tidy up the formatting. It's unclear what the equation actually even is. – Matt Nov 03 '20 at 12:56
-
For example, what is $Fn$ supposed to be? – Matt Nov 03 '20 at 12:57
-
And how does Fibonnacci come into it? – Matt Nov 03 '20 at 12:58
-
f(n)=f(n-1)+f(n-2) Fibonacci (f- they mean a fibonacci) – Mohanad Sfe Nov 03 '20 at 13:00
-
1Please edit your question to tidy up the notation, then. It is still entirely unclear. There are typos. – Matt Nov 03 '20 at 13:49
-
maybe know it's better?! – Mohanad Sfe Nov 03 '20 at 14:08