@openstem shared this flowchart

Mathematics · L3 · Recursive Sequences & Fibonacci

How a recursive rule like the Fibonacci recurrence is evaluated: keep breaking a term down into earlier terms until you hit a base case, then build the answer back up.

Mathematics
Updated
0
0
Read only
🐰 Fibonacci: F(n) = F(n-1) + F(n-2)n ≤ 2?🌱 Base case: F(1) = 1, F(2) = 1Break into F(n-1) and F(n-2)Keep breaking down until base case🔼 Add results back up✅ F(n)yesno

More in Mathematics

Browse Mathematics

We use privacy-friendly product analytics (no session recording, PII masked) to improve OpenStem. Load analytics? Privacy Policy