A-Level Mathematics: Recurrence Relations | A-Level 数学：递推关系式

📚 A-Level Mathematics: Recurrence Relations | A-Level 数学：递推关系式

A recurrence relation is a formula that defines each term of a sequence in terms of one or more previous terms. Rather than giving an explicit formula for the n-th term, a recurrence relation describes how the sequence evolves step by step. This concept is central to the study of sequences and series in A-Level Mathematics and has powerful applications in everything from finance to population modelling.

递推关系式是一种通过前一项或前几项来定义数列中每一项的公式。它不是直接给出第 n 项的显式公式，而是描述数列如何一步一步地演变。这一概念是 A-Level 数学中数列与级数学习的核心，并在金融、人口建模等众多领域中有着强大的应用。

1. What is a Recurrence Relation? | 什么是递推关系式？

A recurrence relation expresses the term uₙ₊₁ (or a later term) in terms of uₙ (and possibly earlier terms). Formally, a recurrence relation has two essential components: the rule that connects successive terms, and one or more starting values called initial conditions.

递推关系式将第 n+1 项 uₙ₊₁（或更靠后的项）表示为第 n 项 uₙ（以及可能的更早项）的函数。形式化地说，递推关系式包含两个基本部分：连接相邻项的规则，以及一个或多个被称为初始条件的起始值。

For example, the sequence 3, 7, 11, 15, … can be defined by the recurrence relation uₙ₊₁ = uₙ + 4 with u₁ = 3. Once the rule and the initial value are known, every term of the sequence is uniquely determined.

例如，数列 3, 7, 11, 15, … 可以由递推关系式 uₙ₊₁ = uₙ + 4 以及 u₁ = 3 来定义。一旦规则和初始值已知，数列的每一项就被唯一确定了。

2. Notation and Initial Conditions | 符号与初始条件

In A-Level Mathematics, the terms of a sequence are typically denoted by uₙ, where n is a positive integer. A recurrence relation is usually written in the form uₙ₊₁ = f(uₙ). The initial condition tells us the value of u₁ (or u₀, depending on convention). Without an initial condition, a recurrence relation only describes a family of sequences, not one specific sequence.

在 A-Level 数学中，数列的项通常用 uₙ 表示，其中 n 为正整数。递推关系式通常写作 uₙ₊₁ = f(uₙ) 的形式。初始条件告诉我们 u₁（或根据约定为 u₀）的值。如果没有初始条件，递推关系式只能描述一族数列，而无法确定一个具体的数列

Published by TutorHao | A-Level Mathematics Revision Series | aleveler.com

更多咨询请联系16621398022（同微信）