Converting Between Recursive and Explicit Formulas
Converting between recursive and explicit formulas for arithmetic sequences uses the relationship aₙ = a₁ + (n-1)d in enVision Algebra 1 Chapter 3 for Grade 11. To convert recursive a₁ = 3, aₙ = aₙ₋₁ + 5 to explicit: substitute a₁ = 3 and d = 5 to get aₙ = 3 + (n-1)·5 = 5n - 2. To convert explicit aₙ = 4n + 1 to recursive: the slope coefficient gives d = 4, and a₁ = 4(1) + 1 = 5, so the recursive formula is a₁ = 5 and aₙ = aₙ₋₁ + 4. Mastering both conversions allows flexibility in how sequences are defined and applied.
Key Concepts
To convert from recursive to explicit: Use $a n = a 1 + (n 1)d$ where $a 1$ is the first term and $d$ is the common difference from the recursive formula.
To convert from explicit to recursive: Extract $d$ as the coefficient of $n$, find $a 1$ by substituting $n=1$, then write $a 1 = \text{first term}$ and $a n = a {n 1} + d$.
Common Questions
How do you convert a recursive formula to an explicit formula?
Use aₙ = a₁ + (n-1)d. Take the first term a₁ and common difference d from the recursive formula and substitute. For a₁ = 3 and d = 5: aₙ = 3 + (n-1)·5 = 5n - 2.
How do you convert aₙ = 4n + 1 to a recursive formula?
Identify d as the coefficient of n: d = 4. Find a₁ by substituting n = 1: a₁ = 4(1) + 1 = 5. Write the recursive formula: a₁ = 5 and aₙ = aₙ₋₁ + 4.
Convert a₁ = -2 and aₙ = aₙ₋₁ - 3 to explicit form.
d = -3 and a₁ = -2. So aₙ = -2 + (n-1)(-3) = -2 - 3n + 3 = -3n + 1.
Why is it useful to convert between recursive and explicit forms?
Explicit formulas let you find any term directly (e.g., a₁₀₀) without computing all previous terms. Recursive formulas describe the pattern step-by-step and are useful for modeling iterative processes.
How do you check your conversion is correct?
Verify that both formulas produce the same terms. For a₁ = 3, aₙ = aₙ₋₁ + 5 and aₙ = 5n - 2: a₁ = 5(1)-2 = 3 ✓, a₂ = 5(2)-2 = 8 = 3+5 ✓.