Recursive vs. Explicit Rules: Two Ways to Define a Sequence
They are fundamentally different.
- Recursive Rule — Defines each term using previous term(s). Requires initial value(s).
Example: Fibonacci — F(n) = F(n-1) + F(n-2), with F(1)=1, F(2)=1.
- Explicit Rule — Defines each term as a direct function of its position n. No prior terms needed.
Example: Arithmetic sequence 3, 7, 11, 15… → aₙ = 4n − 1.
Recursive = "look back." Explicit = "jump straight there." Both describe the same sequence; explicit is faster for distant terms, recursive often simpler to discover.