hey,guys,i'm practicing proofs .so, i'll be writing some proofs for the community to point out flaws, and many others to learn\[\] this are all about the golden ratios. often written as\( \phi \quad or\quad\varphi=\dfrac{1+\sqrt{5}}{2}\) first is the power proof, i.e \[\phi^n=F_{n}\phi+F_{n-1}\] where\(F_{n}\) is the nth Fibonacci number, which is defined as \[F_n=\begin{cases} 1,& n=1\\1,&n=2\\F_{n-1}+F_{n-2},&n\geq 3\end{cases}\] \[the\quad proof\] we see that it is satisfied at n=1,2. we know that \[\phi^2=\phi+1\longrightarrow \phi^n=\phi^{n-1}+\phi^{n-2}\] since \(\phi^{n-1}=F_{n-1}\phi+F_{n-2}, \phi^{n-2}=F_{n-2}\phi+F_{n-3}\), \[\begin{array} &\phi^n=\phi^{n-1}+\phi^{n-2}\\ \phi^n=F_{n-1}\phi+F_{n-2}+F_{n-2}\phi+F_{n-3}\\ \phi^n=(F_{n-1}+F_{n-2})\phi+(F_{n-2}+F_{n-3})\\ \phi^n=F_{n}\phi+F_{n-1} \end{array}\] since it satisfies all three at n,n-1,n-2.it must satisfy for all number. induction, hence proved.
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
Hello Aareyan,
Your proof is perfectly okay and completely free of any flaw.
You might also want to check out the articles we have on induction and its variants.
Good luck to you in your quest of proving things!
Log in to reply
thanks,sir. i was worried about 2 cases.
Log in to reply
You are using a variant called 'Strong induction' that uses more statements in the inductive hypothesis.
And 'sir' sounds really formal. You can call me Mursalin if you want.
Log in to reply