9514 1404 393
Answer:
solve for f(n) in terms of f(n-1)
Step-by-step explanation:
In general, you solve for f(n) in terms of f(n-k) for k = 1, 2, 3, ....
__
Usually, such questions arise in the context of arithmetic or geometric sequences.
<u><em>Arithmetic sequence</em></u>
The explicit formula for an arithmetic sequence has the general form ...
a(n) = a(1) +d(n -1) . . . . . . . first term a(1); common difference d
The recursive formula for the same arithmetic sequence will look like ...
a(1) = a(1) . . . . . . . the first term is the first term
a(n) = a(n-1) +d . . . the successive terms are found by adding the common difference to the term before
__
Note: The explicit formula may be given as the linear equation a(n) = dn +b. Then the first term is a(1) = d+b.
__
<em><u>Geometric sequence</u></em>
The explicit formula of a geometric sequence has the general form ...
a(n) = a(1)·r^(n -1) . . . . . . first term a(1); common ratio r
The recursive formula for the same geometric sequence will be ...
a(1) = a(1) . . . . . . the first term is the first term
a(n) = a(n-1)·r . . . the successive terms are found by multiplying the term before by the common ratio
__
Note: The explicit formula may be given as the exponential equation a(n) = k·r^n. Then the first term is a(1) = kr.
__
<em><u>Other sequences</u></em>
Suppose you're given the quadratic sequence ...
a(n) = pn^2 +qn +r
Since the sequence is known to be quadratic (polynomial <em>degree 2</em>), we expect that we will only need the <em>two</em> previous terms a(n-1) and a(n-2). Effectively, we want to solve ...
a(n) = c·a(n-1) +d·a(n-2) +e
for the values c, d, and e. Doing that, we find ...
(c, d, e) = (2, -1, 2p)
So, the recursive relation is ...
a(1) = p +q +r
a(2) = 4p +2q +r
a(n) = 2a(n-1) -a(n-2) +2p
__
<em>Additional comment</em>
The basic idea is to write the expression for a(n) in terms of terms a(n-1), a(n-2) and so on. That will be easier for polynomial sequences than for sequences of arbitrary form.
There are some known translations between explicit and recursive formulas for different kinds of sequences, as we have shown above. If you recognize the sequence you have as being of a form with a known translation, then you would make use of that known translation. (For example, Fibonacci-like sequences are originally defined as recursive, but have explicit formulas of a somewhat complicated nature. If you recognize the form, translation from the explicit formula may be easy. If you must derive the recursive relation from the explicit formula, you may be in for a lot of work.)
