PAIBOTLearn
Sign inSign up

Recurrence relations

Sequences

Japanese school year: Math B

What you learn

Learn methods for determining the general term of a sequence from recurrence relations connecting consecutive terms. This mathematical approach is vital for modeling discrete dynamic processes and analyzing algorithms. Familiarity with basic sequences, summation formulas, and equation-solving techniques will assist your progress.

Go to practice

Key points

Formula to find the nn-th term ana_n (n≥2n \ge 2) from first term a1a_1 by summing the differences bk=ak+1−akb_k = a_{k+1} - a_k between adjacent terms.

an=a1+∑k=1n−1bk(n≥2)a_n = a_1 + \sum_{k=1}^{n-1} b_k \quad (n \ge 2)

Subtracting a constant α\alpha from both sides transforms an+1=pan+qa_{n+1} = p a_n + q into a geometric sequence form to solve for ana_n.

an+1−α=p(an−α)(α=pα+q)a_{n+1} - \alpha = p(a_n - \alpha) \quad (\alpha = p\alpha + q)

Since the difference sequence formula applies only for n≥2n \ge 2, always verify that the resulting formula also holds true for the first term n=1n = 1.

Choose a set to practice.