Timeline for How do I use induction to show that the $n$th term in the Fibonacci sequence is always less than or equal to $\left(\frac{1+\sqrt 5}{2}\right)^{n-1}$?
Current License: CC BY-SA 4.0
1 event
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 25, 2022 at 9:30 | history | answered | Lutz Lehmann | CC BY-SA 4.0 |