跳转至

数列

知识点

等差数列与等比数列

定义 1. 等差数列

一般地,如果一个数列从第2项起,每一项与它的前一项的差都等于同一个常数,那么这个数列就叫做等差数列,这个常数叫做等差数列的公差,公差通常用字母\(d\)表示.

  1. 递推关系:\(a_{n + 1}-a_{n}=d \quad \text{(常数)} \quad \text{或} \quad a_{n}-a_{n - 1}=d \quad (n\in N^\ast \text{且} n\geq2)\)

  2. 通项公式:\(a_{n}=a_{1}+(n - 1)d\), 推广形式: \(a_{n}=a_{m}+(n - m)d \quad \text{(当} d\neq0 \text{时,} a_{n} \text{是关于} n \text{的一次函数)}\)

  3. 求和公式: \(S_{n}=\htmlClass{blank}{\dfrac{n(a_{1}+a_{n})}{2}}=\htmlClass{blank}{na_{1}+\dfrac{n(n - 1)}{2}d} \quad \text{(当} d\neq0 \text{时,} S_{n} \text{是关于} n \text{的二次函数,且常数项为零)}\)

求和公式推导(倒序相加法):因\(a_{1}+a_{n}=a_{2}+a_{n - 1}=\cdots=a_{n}+a_{1}\),将\(S_{n}\)正序、倒序各写一遍:

\[ \begin{aligned} S_{n} & = a_{1}+a_{2}+\cdots+a_{n}, \\ S_{n} & = a_{n}+a_{n - 1}+\cdots+a_{1}, \end{aligned} \]

两式相加得\(2S_{n}=\underbrace{(a_{1}+a_{n})+(a_{1}+a_{n})+\cdots+(a_{1}+a_{n})}_{n\text{个}}=n(a_{1}+a_{n})\),故\(S_{n}=\dfrac{n(a_{1}+a_{n})}{2}\); 再代入\(a_{n}=a_{1}+(n - 1)d\)即得\(S_{n}=na_{1}+\dfrac{n(n - 1)}{2}d\).

性质 1. 等差数列的性质

  1. 下标和性质:若\(n + m = p + q = 2r\),则\(a_n + a_m = a_p + a_q = 2a_r\).(反之不一定成立,如常数数列)

    推广:   \(a_{m_1}+a_{m_2}+a_{m_3}+\cdots+a_{m_n}=n a_{\frac{m_1+m_2+m_3+\cdots+m_n}{n}}\)

  2. 等差中项:\(a\)\(b\)\(c\)成等差数列,则称\(b\)\(a\)\(c\)的等差中项,即\(2b = a + c\).

  3. 片段和性质: 在等差数列中依次取出若干个\(n\)项,其和也构成等差数列,

    \(S_n\)\(S_{2n}-S_n\)\(S_{3n}-S_{2n}\)\(\cdots\)也为等差数列,公差为\(n^2d\)

    图示理解: \(\underbrace{a_1,a_2,\cdots,a_n}_{S_n},\underbrace{a_{n + 1},a_{n + 2},\cdots,a_{2n}}_{S_{2n}-S_n},\underbrace{a_{2n + 1},a_{2n + 2},\cdots,a_{3n}}_{S_{3n}-S_{2n}}\)

  4. \(n\)项和性质: 若数列\(\{a_{n}\}\)是等差数列,前\(n\)项和为\(S_{n}\),则\(\left\{\dfrac{S_{n}}{n}\right\}\)也是等差数列,其首项为\(a_{1}\),公差是\(\dfrac{d}{2}\)

  5. \(S_{\text{偶}}\)\(S_{\text{奇}}\)分别为该数列的所有偶数项之和与所有奇数项之和,则有:

    \(\{a_n\}\)共有\(2n - 1\)项(\(a_n\)为中间项),则\(S_{2n - 1}=\htmlClass{blank}{(2n - 1)a_n}\)

       \(S_{\text{奇}} = \dfrac{n(a_1 + a_{2n - 1})}{2} = na_n\)\(S_{\text{偶}} = \dfrac{(n - 1)(a_2 + a_{2n - 2})}{2} = (n - 1)a_n\)\(S_{\text{奇}}-S_{\text{偶}}=a_n\)\(\dfrac{S_{\text{奇}}}{S_{\text{偶}}}=\dfrac{n}{n - 1}\).

    \(\{a_n\}\)共有\(2n\)项(\(a_n\)\(a_{n + 1}\)为中间项),则\(S_{2n}=\htmlClass{blank}{n(a_n + a_{n + 1})}\)

       \(S_{\text{奇}} = \dfrac{n(a_1 + a_{2n - 1})}{2} = na_n\)\(S_{\text{偶}} = \dfrac{n(a_2 + a_{2n})}{2} = na_{n+1}\)\(S_{\text{奇}}-S_{\text{偶}}=-nd\)\(\dfrac{S_{\text{奇}}}{S_{\text{偶}}}=\dfrac{a_n}{a_{n + 1}}\).

    上述结论说明\(S_{2n-1}\text{与}a_{n}\)同号,\(S_{2n}\text{与}a_{n}+a_{n+1}\)同号,常用于最值问题

  6. 若等差数列\(\{a_{n}\}\)\(\{b_{n}\}\)的前\(n\)项和分别为\(S_{n}\)\(T_{n}\),则\(\dfrac{a_{n}}{b_{n}}=\dfrac{S_{2n - 1}}{T_{2n - 1}}\).

  7. 两个等差数列\(\{a_n\}\)\(\{b_n\}\)的和差的数列\(\{a_n\pm b_n\}\)\(\{pa_n\pm qb_n\}\)仍为等差数列

  8. 等差数列\(\{a_{n}\}\)中项数成等差数列,对应项也成等差数列.即\(a_k,a_{k + m},a_{k + 2m},\cdots\)构成以{\(md\)}为公差的等差数列

  9. \(\{a_n\}\) 是等差数列的充要条件是 \(S_n = An^2 + Bn\) (\(A\), \(B\) 可以为零).

  10. 若数列 \(\{a_n\}\) 的前 \(n\) 项和 \(S_n = An^2 + Bn + C\) \((A, B \text{是常数}, C\neq0)\),则数列 \(\{a_n\}\) 从第二项起是等差数列.

结论 1. 等差数列最值问题

\(a_1 {\gt} 0\)\(d {\gt} 0\),则\(S_n\)单调递增,\(S_1\)最小; 若\(a_1 {\lt} 0\)\(d {\lt} 0\),则\(S_n\)单调递减,\(S_1\)最大;

\(a_1 {\gt} 0\)\(d {\lt} 0\)\(S_n\)先增后减,有最大值,取到最大值的条件是\(\begin{cases}S_n \geq S_{n - 1} & (n \geq 2)\\ S_n \geq S_{n + 1}\end{cases}\),即\(\begin{cases}\htmlClass{blank}{a_n \geq 0}\\ \htmlClass{blank}{a_{n + 1} \leq 0}\end{cases}\ (n \geq 2)\)

\(a_1 {\lt} 0\)\(d {\gt} 0\)\(S_n\)先减后增,有最小值,取到最小值的条件是\(\begin{cases}S_n \leq S_{n - 1} & (n \geq 2)\\ S_n \leq S_{n + 1}\end{cases}\),即\(\begin{cases}a_n \leq 0\\ a_{n + 1} \geq 0\end{cases}\ (n \geq 2)\).

\(a_1 d \geq 0\), \(\left\{\dfrac{S_n}{a_n}\right\}\)最小值为\(\dfrac{S_1}{a_1}=1\); 若\(a_1 d {\lt} 0\),存在\(N_0 \geq 2\) 使得 \(a_{N_0-1} a_{N_0} {\lt} 0\)\(\left\{\dfrac{S_n}{a_n}\right\}\)最小值为\(\dfrac{S_{N_0}}{a_{N_0}}\).

\(S_m = S_n \implies S_{m + n} = 0\)

结论 2. 等差数列判定

  1. 定义法:\(a_{n + 1}-a_n = d\) (常数);

  2. 通项法:\(a_n = a_1+(n - 1)d\)

  3. 中项法:\(2a_{n + 1}=a_n + a_{n + 2}\)

  4. 求和法:\(S_n = \htmlClass{blank}{An^2 + Bn}\) (\(A\)\(B\)是常数 \(n\in N\))

定义 2. 等比数列定义

一般地,如果一个数列从第2项起,每一项与它的前一项的比都等于同一个常数,那么这个数列就叫做等比数列,这个常数叫做等比数列的公比,公比通常用字母\(q\)表示(显然\(q\neq0\)).

  1. 递推关系:\(\dfrac{a_{n + 1}}{a_n}=q\ (q \neq 0)\)\(\dfrac{a_n}{a_{n - 1}}=q\ (q \neq 0, n \in N^*\text{且}n \geq 2)\).

  2. 通项公式:\(a_n = a_1q^{n - 1}\ (a_1q \neq 0)\) ,推广形式:\(a_n = a_mq^{n - m}\)

  3. 求和公式: \(S_n = \begin{cases} \htmlClass{blank}{na_1}, & q = 1 \\ \htmlClass{blank}{\dfrac{a_1(1 - q^n)}{1 - q}} = \dfrac{a_1 - a_nq}{1 - q}, & q \neq 0\text{且}q \neq 1 \end{cases}\),推广形式:\(S_{m+n} = S_m + q^m S_n = S_n + q^n S_m.\)

求和公式推导(错位相减法):当\(q\neq1\)时,由通项\(a_n=a_1q^{n - 1}\)

\[ S_{n}=a_{1}+a_{1}q+a_{1}q^{2}+\cdots+a_{1}q^{n - 1}, \]

两边同乘公比\(q\)

\[ qS_{n}=a_{1}q+a_{1}q^{2}+\cdots+a_{1}q^{n - 1}+a_{1}q^{n}, \]

上两式相减、消去中间相同的项,得\((1 - q)S_{n}=a_{1}-a_{1}q^{n}=a_{1}(1 - q^{n})\), 故\(S_{n}=\dfrac{a_{1}(1 - q^{n})}{1 - q}\);又\(a_{n}=a_{1}q^{n - 1}\),亦可写成\(\dfrac{a_{1}-a_{n}q}{1 - q}\). 当\(q = 1\)时各项均为\(a_1\),故\(S_{n}=na_{1}\).

性质 2. 等比数列的性质

  1. 下标和性质: 若\(n + m = p + q = 2r\),则\(a_n \cdot a_m = a_p \cdot a_q = a_r^2\)(反之不一定成立,如非零常数数列)

    推广: \(a_{m_1}\cdot a_{m_2}\cdot a_{m_3}\cdot\cdots\cdot a_{m_n}=\left(a_{\frac{m_1+m_2+m_3+\cdots+m_n}{n}}\right)^n\),若\(m_n\)为等差数列,有\(a_{m_1}\cdot a_{m_2}\cdot a_{m_3}\cdot\cdots\cdot a_{m_n}=\left(a_{\frac{m_1+m_n}{2}}\right)^n\)

  2. 等比中项:若三个数\(a\)\(G\)\(b\)成等比数列,则称\(G\)\(a\)\(b\)的等比中项. \(ab \neq 0\)\(G^2 = ab\),即\(G = \pm\sqrt{ab}\)

    只有同号的两个数才有等比中项,等比中项有两个,它们互为相反数

    三个数\(a\)\(G\)\(b\)成等比数列的一个必要不充分条件是\(G^2 = ab\)

  3. 片段和性质: 当\(q \neq - 1\),或\(q = - 1\)\(n\)为奇数时,\(S_n\)\(S_{2n}-S_n\)\(S_{3n}-S_{2n}\)\(\cdots\)也为等比数列,公比为\(q^{n}\)

    图示理解: \(\underbrace{a_1,a_2,\cdots,a_n}_{S_n},\underbrace{a_{n + 1},a_{n + 2},\cdots,a_{2n}}_{S_{2n}-S_n},\underbrace{a_{2n + 1},a_{2n + 2},\cdots,a_{3n}}_{S_{3n}-S_{2n}}\)

  4. 片段积性质: 等比数列\(\{a_n\}\)的连续\(n\)项的积构成的数列,即\(T_n\)\(\dfrac{T_{2n}}{T_n}\)\(\dfrac{T_{3n}}{T_{2n}}\)\(\cdots\)为等比数列,公比为\(q^{n^2}\)

  5. \(q = 1\)时,\(\dfrac{S_{m}}{S_n}=\dfrac{m}{n}\);当\(q \neq \pm1\)时,\(\dfrac{S_{m}}{S_n}=\dfrac{1 - q^{m}}{1 - q^n}\)

  6. 数列\(\{\lambda a_n\}\)\(\lambda\)为不等于0的常数)仍是公比为\(q\)的等比数列;

    若数列\(\{b_n\}\)是公比为\(q'\)的等比数列,则数列\(\{a_n b_n\}\)是公比为\(qq'\)的等比数列;

    数列\(\left\{\dfrac{1}{a_n}\right\}\)是公比为\(\dfrac{1}{q}\)的等比数列; 数列\(\{|a_n|\}\)是公比为\(|q|\)的等比数列.

  7. 在数列\(\{a_n\}\)中,每隔\(k\)\(k \in N^*\))项取出一项,按原来的顺序排列,所得数列为等比数列,公比为\(q^{k + 1}\).

  8. 当数列\(\{a_n\}\)是各项均为正值的等比数列时,数列\(\{\ln a_n\}\)是公差为\(\ln q\)的等差数列

  9. 既是等差数列又是等比数列的数列是非零的常数列

  10. \(S_{\text{偶}}\)\(S_{\text{奇}}\)分别为该数列的所有偶数项之和与所有奇数项之和,

    若项数为\(2n\),则\(\dfrac{S_{\text{偶}}}{S_{\text{奇}}} = q\);   若项数为\(2n + 1\),则\(\dfrac{S_{\text{奇}}-a_{1}}{S_{\text{偶}}} = q\)

结论 3. 等比数列求\(S_n\)最值(等比数列的\(S_n\)通常是单调的)

\(q {\gt} 1\)\(a_1 {\gt} 0\)\(0 {\lt} q {\lt} 1\)\(a_1 {\lt} 0\)时,\(\{a_n\}\)是递增数列,\(S_n\)递增或递减;

\(q {\gt} 1\)\(a_1 {\lt} 0\)\(0 {\lt} q {\lt} 1\)\(a_1 {\gt} 0\)时,\(\{a_n\}\)是递减数列,\(S_n\)递减或递增;

\(q = 1\)时,\(\{a_n\}\)是常数列; 当\(q {\lt} 0\)时,\(\{a_n\}\)是摆动数列;

结论 4. 求前\(n\)项乘积\(T_n\)最值

类比等差数列的\(S_{n}\),等比数列前\(n\)项积\(T_{n}\)有如下性质:\(T_{2n-1} = \htmlClass{blank}{(a_{n})^{2n-1}}\)\(T_{2n} = \htmlClass{blank}{(a_na_{n+1})^n}\)

\(a_1 {\gt} 1\)\(q {\gt} 1\),则\(T_n\)单调递增,\(T_1\)最小; 若\(0 {\lt} a_1 {\lt} 1\)\(0{\lt} q {\lt} 1\),则\(T_n\)单调递减,\(T_1\)最大;

\(a_1 {\gt} 1\)\(0 {\lt} q {\lt} 1\)\(T_n\)先增后减,有最大值,取到最大值的条件是\(a_n \geq 1 \text{ 且 } a_{n + 1} \leq 1 \ (n \geq 2)\)

\(0 {\lt} a_1 {\lt} 1\)\(q {\gt} 1\)\(T_n\)先减后增,有最小值,取到最小值的条件是\(a_n \leq 1\text{ 且 } a_{n + 1} \geq 1 \ (n \geq 2)\).

结论 5. 等比数列的判定方法

  1. 定义法:\(\dfrac{a_{n + 1}}{a_n}=q(q \neq 0, n \in N^*)\)(常数);

  2. 通项法:\(a_n = a_1q^{n - 1}\)

  3. 中项法:\(a_{n + 1}^2 = a_n a_{n + 2}\)

  4. 求和法:\(S_n =\htmlClass{blank}{A(1 - q^n)}\)(其中 \(A = \dfrac{a_1}{1 - q}\))

结论 6. 等差等比数列常用设法

  1. 若三个数成等差数列,则可设为\(a-d,a,a+d\)

  2. 若四个数成等差数列,则可设为\(a-3d,a-d,a+d,a+3d.\)

  3. 若三个数成等比数列,则可设为\(\dfrac{a}{q},a,aq.\)

数列求通项

结论 1. 公式法求数列通项

  1. \(\{a_n\}\) 是等差数列,首项为 \(a_1\),公差为 \(d\),则其通项公式为 \(a_n = a_1+(n - 1)d\)

  2. \(\{a_n\}\) 是等比数列,首项为 \(a_1\),公比为 \(q\),则其通项公式为 \(a_n = a_1q^{n-1}\)

  3. 若数列的前 \(n\) 项和为 \(S_n\),则 \(a_n = \begin{cases} S_1, & n = 1 \\ S_n - S_{n-1}, & n \geq 2 \end{cases}\)

  4. 若已知\(a_n\)\(S_n\)的关系,如\(S_n = f(a_n)\)

      求\(a_n\)利用\(S_{n-1} = f(a_{n-1}), n \geq 2\),作差可消去\(S_n\)

      求\(S_n\)利用\(a_n = S_n - S_{n-1}, n \geq 2\),消去\(a_n\)

  5. 特别地:当出现 \(a_{n + 1}-a_{n-1}=d\)\(\dfrac{a_{n + 1}}{a_{n-1}}=q(n \geq 2)\) 时,数列通项需要分奇数项和偶数项讨论.

结论 2. 累加法与累乘法

  1. 已知 \(a_1\)\(a_{n + 1} = a_n + f(n)\),求通项 \(a_n\). 累加得\(a_n=(a_n - a_{n - 1})+(a_{n - 1}-a_{n - 2})+\cdots+(a_2 - a_1)+a_1\)

    \(f(n)\) 是关于 \(n\) 的一次函数,累加后可转化为等差数列求和

    \(f(n)\) 是关于 \(n\) 的二次函数,累加后可分组求和

    \(f(n)\) 是关于 \(n\) 的指数函数,累加后可转化为等比数列求和

    \(f(n)\) 是关于 \(n\) 的分数函数,累加后可裂项求和

  2. 已知 \(a_1\)\(a_{n + 1} = f(n)a_n\),求通项 \(a_n\).累乘得\(a_n = \dfrac{a_n}{a_{n - 1}} \cdot \dfrac{a_{n - 1}}{a_{n - 2}} \cdots \dfrac{a_2}{a_1} \cdot a_1 (a_n \neq 0)\)

    \(f(n)\) 一般是关于 \(n\) 的分式函数,累乘后可消去

结论 3. 构造法求数列通项

下面总结常见的构造法求通项的方法,即通过递推公式求通项公式

  1. \(a_{n+1} = pa_{n} + q\)

    1. 待定系数法:设 \(a_{n+1} - x = p(a_{n} - x)\),解得 \(x = \dfrac{q}{1 - p}\),构造等比数列 \(\{a_n - x\}\),公比为\(p\).

      注意到\(x\) 为方程 \(x = px + q\) 的解,称为数列的不动点

    2. 阶差法:由 \(a_{n + 1} = pa_n + q\)\(a_n = pa_{n - 1} + q\),相减得 \(a_{n + 1} - a_n = p(a_n - a_{n - 1})\),故 \(\{a_{n + 1} - a_n\}\) 为等比数列,再累加得 \(a_n\)

  2. \(a_{n+1} = pa_{n}+qn + r\)

    待定系数法:设 \(a_{n+1}+x(n+1) + y = p(a_{n}+xn+y)\),求解\(x,y\),构造等比数列\(\{a_n+xn + y\}\),公比为\(p\).

    推广:对于\(a_{n+1} = p a_n + f(n)\), 都可构造 \(a_{n+1} + g(n+1) = p\left(a_n + g(n)\right)\),其中\(f(n)\)\(g(n)\)是同形式函数.

  3. \(a_{n + 1} = pa_n + q^n\)

    1. 两边同时除以\(q^{n + 1}\)\(\dfrac{a_{n + 1}}{q^{n + 1}}=\dfrac{p}{q}\cdot\dfrac{a_n}{q^{n}}+\dfrac{1}{q}\),同 1

    2. 两边同时除以\(p^{n + 1}\)\(\dfrac{a_{n + 1}}{p^{n + 1}}=\dfrac{a_n}{p^{n}}+\dfrac{1}{p}\cdot\left(\dfrac{q}{p}\right)^n\),累加得\(\dfrac{a_n}{p^{n}}\),从而求出\(a_n\)

  4. \(a_{n+1}^p = a_n^q\)

    \(a_n\)非负的前提下,两边取对数得到\(p \ln a_{n+1} = q \ln a_n\),则\(\{ln a_n\}\)为等比数列.

  5. \(a_{n + 1} = \dfrac{pa_{n}}{qa_{n} + r}\)

    \(a_{n + 1} = \dfrac{pa_{n}}{qa_{n} + r}\)等式取倒数得: \(\dfrac{1}{a_{n + 1}} = \dfrac{qa_{n} + r}{pa_{n}} = \dfrac{r}{p}\dfrac{1}{a_{n}} + \dfrac{q}{p}\), 令\(b_{n} = \dfrac{1}{a_{n}}\),则\(b_{n + 1} = \dfrac{r}{p}b_{n} + \dfrac{q}{p}\),同 1

  6. \(a_{n + 1} = \dfrac{pa_{n} + q}{ra_{n} + s}\)

    考虑方程\(x = \dfrac{px + q}{rx + s} \implies rx^{2} + (s - p)x - q = 0\),解该方程

    (1)若该方程无解,数列可能为周期数列

    (2)若该方程有一个解\(x_1=x_2\),则构造等差数列\(\left\{\dfrac{1}{a_{n} - x_1}\right\}\),解出\(a_{n}\)

    (3)若该方程有两个解\(x_1\)\(x_2\),则构造等比数列\(\left\{\dfrac{a_{n} - x_1}{a_{n} - x_2}\right\}\),解出\(a_{n}\)

结论 4. 特征根法

对于三项递推式\(a_{n + 1} = pa_{n} + qa_{n - 1}\), 构造 \(a_{n+1} - x_1 a_n = x_2 (a_n - x_1 a_{n-1}) \implies a_{n+1} = (x_1 + x_2) a_n - x_1 x_2 a_{n-1}\)

对比系数得 \(\begin{cases} x_1 + x_2 = p \\ x_1 x_2 = -q \end{cases}\)\(x_1,x_2\) 是方程 \(x^2 - p x - q = 0\) 的两个解(称为特征方程)

  1. 若该方程无解,数列可能为周期数列.

  2. 若该方程有一个解\(x_1=x_2\), 构造等比数列\(\{a_{n + 1} - x_{1} a_{n}\}\)

    \[ a_{n+1} - x_1 a_n = x_1^{n-1} (a_2 - x_1 a_1) \implies \dfrac{a_{n+1}}{x_1^{n+1}} - \dfrac{a_n}{x_1^n} = \dfrac{a_2 - x_1 a_1}{x_1^2} \]
    \[ \left\{\dfrac{a_n}{x_1^n}\right\} \text{为等差数列,即\; } \dfrac{a_n}{x_1^n} = \dfrac{a_1}{x_1} + \dfrac{a_2 - x_1 a_1}{x_1^2} (n - 1) \]
    \[ a_n = \left[ x_1 a_1 + (a_2 - x_1 a_1)(n - 1) \right] x_1^{n-2} = \left[ 2x_1 a_1 - a_2 + (a_2 - x_1 a_1)n \right] x_1^{n-2} = \htmlClass{blank}{(c_1 + c_2 n) x_1^n}\text{,可待定系数求解} \]
  3. 若该方程有两个解\(x_1\)\(x_2\), 构造两个等比数列:\(\{a_{n + 1} - x_{1} a_{n}\}\)\(\{a_{n + 1} - x_{2}a_{n}\}\)

    \[ a_{n+1} - x_1 a_n = x_2^{n-1} (a_2 - x_1 a_1) \quad \text{①} \qquad \qquad a_{n+1} - x_2 a_n = x_1^{n-1} (a_2 - x_2 a_1) \quad \text{②} \]
    \[ \text{①} - \text{②} \text{ 得\; } (x_2 - x_1) a_n = x_2^{n-1} (a_2 - x_1 a_1) - x_1^{n-1} (a_2 - x_2 a_1) \]
    \[ a_n = \dfrac{a_2 - x_1 a_1}{x_2 - x_1} \cdot x_2^{n-1} + \dfrac{a_2 - x_2 a_1}{x_1 - x_2} \cdot x_1^{n-1} = \htmlClass{blank}{c_1 x_1^n + c_2 x_2^n}\text{,可待定系数求解} \]

结论 5. 平方式的递推

对于\(a_{n+1}=\dfrac{a_n^2 + p}{2a_n + q} \ (q^2 + 4p \neq 0)\), 将\(a_{n+1}=\dfrac{a_n^2 + p}{2a_n + q}\)变成\(\dfrac{a_{n+1} - x_1}{a_{n+1} - x_2} = \left( \dfrac{a_n - x_1}{a_n - x_2} \right)^2\),因为

\[ \dfrac{a_{n+1} - x_1}{a_{n+1} - x_2} = \dfrac{\dfrac{a_n^2 + p}{2a_n + q} - x_1}{\dfrac{a_n^2 + p}{2a_n + q} - x_2} = \dfrac{a_n^2 - 2x_1a_n + p - x_1q}{a_n^2 - 2x_2a_n + p - x_2q} = \left( \dfrac{a_n - x_1}{a_n - x_2} \right)^2 \text{则有方程组:} \begin{cases} p - x_1q = x_1^2 \\ p - x_2q = x_2^2 \end{cases} \]

所以\(x_1, x_2\)是方程\(x^2 + qx - p = 0\)的两根,即\(x_1, x_2\)是方程\(x = \dfrac{x^2 + p}{2x + q}\)的两根.

(1)迭代法: 求出\(x_1, x_2\),则 \(\dfrac{a_n - x_1}{a_n - x_2} = \left( \dfrac{a_{n-1} - x_1}{a_{n-1} - x_2} \right)^2 = \left[ \left( \dfrac{a_{n-1} - x_1}{a_{n-1} - x_2} \right)^2 \right]^2 = \cdots = \left( \dfrac{a_1 - x_1}{a_1 - x_2} \right)^{2^{n-1}}\)

因此 \(a_n = \dfrac{x_1 - x_2 \left( \dfrac{a_1 - x_1}{a_1 - x_2} \right)^{2^{n-1}}}{1 - \left( \dfrac{a_1 - x_1}{a_1 - x_2} \right)^{2^{n-1}}}\)

(2)对数代换法: \(\ln \dfrac{a_{n+1} - x_1}{a_{n+1} - x_2} = 2\ln \dfrac{a_n - x_1}{a_n - x_2}\), 所以\(\left\{ \ln \dfrac{a_n - x_1}{a_n - x_2} \right\}\)是以\(\ln \dfrac{a_1 - x_1}{a_1 - x_2}\)为首项,2为公比的等比数列.

\(\ln \dfrac{a_n - x_1}{a_n - x_2} = 2^{n-1} \ln \dfrac{a_1 - x_1}{a_1 - x_2} = \ln \left( \dfrac{a_1 - x_1}{a_1 - x_2} \right)^{2^{n-1}}\)

因此 \(\dfrac{a_n - x_1}{a_n - x_2} = \left( \dfrac{a_1 - x_1}{a_1 - x_2} \right)^{2^{n-1}}\) 进而 \(a_n = \dfrac{x_1 - x_2 \left( \dfrac{a_1 - x_1}{a_1 - x_2} \right)^{2^{n-1}}}{1 - \left( \dfrac{a_1 - x_1}{a_1 - x_2} \right)^{2^{n-1}}}\)

数列求和

结论 1. 公式法

\[ 1^{2}+2^{2}+3^{2}+\cdots+n^{2}=\htmlClass{blank}{\dfrac{n(n + 1)(2n + 1)}{6}}\qquad \quad 1^{3}+2^{3}+3^{3}+\cdots+n^{3}=\htmlClass{blank}{\left[\dfrac{n(n + 1)}{2}\right]^{2}} \]
\[ \ln (1+n) {\lt} 1 + \dfrac{1}{2} + \dfrac{1}{3} + \cdots + \dfrac{1}{n} {\lt} \ln n + 1 \quad \quad 1 + \dfrac{1}{2^2} + \dfrac{1}{3^2} + \cdots + \dfrac{1}{n^2} + \cdots= \dfrac{\pi ^ 2}{6} \]
\[ 1 - \dfrac{1}{2} + \dfrac{1}{3} - \dfrac{1}{4} + \cdots + \dfrac{{(-1)}^{n+1}}{n} + \cdots = \ln 2 \quad \quad 1 - \dfrac{1}{3} + \dfrac{1}{5} - \dfrac{1}{7} + \cdots + \dfrac{{(-1)}^{n+1}}{2n-1} + \cdots = \dfrac{\pi}{4} \]

结论 2. 等差乘等比求和错位相减法

错位相减法:以\(c_{n}=(an + b)q^{n - 1}\)为例

\[ \begin{aligned} S_n & = (a + b)q^0 + (2a + b)q^1 + (3a + b)q^2 + \cdots + (an + b)q^{n-1} \quad \text{①} \\ \text{两边同乘} \, q \, \text{得:} qS_n & = \qquad \qquad \quad (a + b)q^1 + (2a + b)q^2 + \cdots + \left[(n-1)a + b\right]q^{n-1} + (an + b)q^n \quad \text{②} \\ \text{\text{①}} - \text{\text{②} \;得:} (1 - q)S_n & = (a + b) + aq^1 + aq^2 + \cdots + aq^{n-1} - (an + b)q^n \\ \text{其中:} & a + aq^1 + aq^2 + \cdots + aq^{n-1} = \dfrac{a(1 - q^{n})}{1 - q} \quad (q \neq 1) \\ \text{代入得:} (1 - q)S_n & = b + \dfrac{a(1 - q^{n})}{1 - q} - (an + b)q^n = \left(-an - \dfrac{a+b(1-q)}{1-q} \right)q^n + \dfrac{a+b(1-q)}{1-q} \\ \text{则:} S_n & = \left(\dfrac{a}{q-1}n + \dfrac{b(q-1)-a}{(q - 1)^2}\right)q^n - \dfrac{b(q-1)-a}{(q-1)^2} \quad (q \neq 1) \end{aligned} \]

结论:若一个数列为\(c_{n}=\htmlClass{blank}{(an + b)q^{n - 1}}\),则其前\(n\)项和\(S_{n}=\htmlClass{blank}{(An + B)q^{n}-B}\)

     其中,\(A=\htmlClass{blank}{\dfrac{a}{q - 1}}\)\(B=\htmlClass{blank}{\dfrac{b - A}{q - 1}}\),也可由\(S_{1},S_{2}\)的值,待定系数确定\(A,B\).

结论 3. 常规裂项相消法

裂项相消就是找到\(f(n)\)使得\(a_{n} = f(n+1) - f(n)\)

  1. 等差数列型

    \(\dfrac{1}{n(n + 1)}=\htmlClass{blank}{\dfrac{1}{n}-\dfrac{1}{n + 1}}\),  \(\dfrac{1}{(2n - 1)(2n + 1)}=\htmlClass{blank}{\dfrac{1}{2}\left(\dfrac{1}{2n - 1}-\dfrac{1}{2n + 1}\right)}\),  \(\dfrac{1}{\sqrt{n}+\sqrt{n + 1}}=\htmlClass{blank}{\sqrt{n + 1}-\sqrt{n}}\)

    \(\{a_{n}\}\)为等差数列,公差为\(d\),则有:

    \(\dfrac{1}{a_{n}a_{n + 1}}=\htmlClass{blank}{\dfrac{1}{d}\left(\dfrac{1}{a_{n}}-\dfrac{1}{a_{n + 1}}\right)}\),  \(\dfrac{1}{a_{n}a_{n + m}}={\dfrac{1}{md}\left(\dfrac{1}{a_{n}}-\dfrac{1}{a_{n + m}}\right)}\),  \(\dfrac{1}{\sqrt{a_{n}}+\sqrt{a_{n + 1}}}=\dfrac{1}{d}\left(\sqrt{a_{n + 1}}-\sqrt{a_{n}}\right)\)

    裂和:\((-1)^{n - 1}\dfrac{a_{n}+a_{n + 1}}{a_{n}a_{n + 1}}=(-1)^{n - 1}\left(\dfrac{1}{a_{n}}+\dfrac{1}{a_{n + 1}}\right)\); 例如:\(\dfrac{(-1)^{n-1}(2n+1)}{n(n+1)} = \htmlClass{blank}{(-1)^{n-1}\left(\dfrac{1}{n}+\dfrac{1}{n+1}\right)}\)

  2. 指数型,其中\(a_n\)为等差数列,公差为\(d\)

    \[ \begin{aligned} & \dfrac{q^{n}}{(q^{n}+m)(q^{n + 1}+m)}=\dfrac{1}{q - 1}\left(\dfrac{1}{q^{n}+m}-\dfrac{1}{q^{n + 1}+m}\right)\text{,}\quad \dfrac{(q - 1)q^{n}+d}{(q^{n}+a_{n})(q^{n + 1}+a_{n + 1})}=\dfrac{1}{q^{n}+a_{n}}-\dfrac{1}{q^{n + 1}+a_{n + 1}} \\ & \dfrac{a_{n + 1}-\frac{1}{d}\cdot a_{n}}{a_{n}\cdot a_{n + 1}}\cdot\dfrac{1}{d^{n}}=\dfrac{1}{a_{n}\cdot d^{n}}-\dfrac{1}{a_{n + 1}\cdot d^{n+1}} \text{,} \quad \dfrac{q^{2^{n}}}{1 - q^{2^{n + 1}}}=\dfrac{1}{1 - q^{2^{n}}}-\dfrac{1}{1 - q^{2^{n + 1}}} \\ & \dfrac{(a_{n + 1}-q\cdot a_{n})\cdot q^{n}}{a_{n}\cdot a_{n + 1}}=\dfrac{q^{n}}{a_{n}}-\dfrac{q^{n + 1}}{a_{n + 1}}\text{,}\quad \dfrac{q^{n}[1+(1 - q)n]}{n(n + 1)}={\dfrac{q^{n}}{n}-\dfrac{q^{n + 1}}{n + 1}}\text{,}\quad \dfrac{q^{n}[k+(1 - q^{k})n]}{n(n + k)}=\dfrac{q^{n}}{n}-\dfrac{q^{n + k}}{n + k} \end{aligned} \]

    \(\dfrac{2^{n}}{(2^{n}+1)(2^{n + 1}+1)}=\htmlClass{blank}{\dfrac{1}{2^{n}+1}-\dfrac{1}{2^{n + 1}+1}}\);  \(\dfrac{n+2}{n(n+1)2^{n+1}}=\htmlClass{blank}{\dfrac{1}{n\cdot 2^n}-\dfrac{1}{(n+1)2^{n+1}}}\);  \(\dfrac{(1-n)2^n}{n(n+1)}=\htmlClass{blank}{\dfrac{2^n}{n}-\dfrac{2^{n+1}}{n+1}}\)

  3. 阶乘型: \(\dfrac{n}{(n + 1)!}=\htmlClass{blank}{\dfrac{1}{n!}-\dfrac{1}{(n + 1)!}}\),  \(n\cdot n!=(n + 1)!-n!\),  \(\dfrac{k + 2}{k!+(k + 1)!+(k + 2)!}=\dfrac{1}{(k + 1)!}-\dfrac{1}{(k + 2)!}\)

  4. 三项型,其中\(a_n\)为等差数列,公差为\(d\)

    \(\dfrac{1}{n(n + 1)(n + 2)}=\htmlClass{blank}{\dfrac{1}{2}\left(\dfrac{1}{n(n + 1)}-\dfrac{1}{(n + 1)(n + 2)}\right)}\)   \(\dfrac{1}{a_na_{n+1}a_{n+2}}\) \(=\dfrac{1}{2d}\left(\dfrac{1}{a_na_{n+1}}-\dfrac{1}{a_{n+1}a_{n+2}}\right)\)

  5. 对数型:\(\log_{b}\dfrac{a_{n + 1}}{a_{n}}=\log_{b}a_{n + 1}-\log_{b}a_{n}\),例如 \(\log_{a}\dfrac{n}{n + 1}=\log_{a}n-\log_{a}(n + 1)\)

结论 4. 非常规裂项

  1. 多项式型:\(a_n\)为关于\(n\)的多项式函数,

    若有\(a_{n} = f(n+1) - f(n)\)\(f(n)\)为多项式函数,次数比\(a_n\)高一次,可用待定系数法确定\(f(n)\)

    若有\(a_{n}q^{n} = f(n+1)q^{n+1} - f(n)q^{n}\)\(f(n)\)为多项式函数,次数与\(a_n\)次数相同,可用待定系数法确定\(f(n)\)

  2. 平方式递推裂项

    \(a_{n + 1}=a_{n}(a_{n}+1)\Rightarrow\dfrac{1}{a_{n + 1}}=\dfrac{1}{a_{n}}-\dfrac{1}{a_{n}+1}\Rightarrow\dfrac{1}{a_{n}+1}=\dfrac{1}{a_{n}}-\dfrac{1}{a_{n + 1}}\Rightarrow\sum\limits_{i = 1}^{n}\dfrac{1}{a_{i}+1}=\dfrac{1}{a_{1}}-\dfrac{1}{a_{n + 1}}\)

    \(a_{n + 1}=\dfrac{a_{n}^{2}}{m}+a_{n}\Rightarrow\dfrac{a_{n + 1}}{m}=\dfrac{a_{n}}{m}\left(\dfrac{a_{n}}{m}+1\right)\Rightarrow\dfrac{1}{a_{n}+m}=\dfrac{1}{a_{n}}-\dfrac{1}{a_{n + 1}}\Rightarrow\sum\limits_{i = 1}^{n}\dfrac{1}{a_{i}+m}=\dfrac{1}{a_{1}}-\dfrac{1}{a_{n + 1}}\)

    \(a_{n + 1}-1=a_{n}(a_{n}-1)\Rightarrow\dfrac{1}{a_{n + 1}-1}=\dfrac{1}{a_{n}-1}-\dfrac{1}{a_{n}}\Rightarrow\dfrac{1}{a_{n}}=\dfrac{1}{a_{n}-1}-\dfrac{1}{a_{n + 1}-1}\Rightarrow\sum\limits_{i = 1}^{n}\dfrac{1}{a_{i}}=\dfrac{1}{a_{1}-1}-\dfrac{1}{a_{n + 1}-1}\)

    \(a_{n + 1}=\dfrac{a_{n}^{2}}{2m}+\dfrac{m}{2}\Rightarrow\dfrac{1}{a_{n + 1}-m}=\dfrac{2m}{(a_{n}-m)(a_{n}+m)}\Rightarrow\dfrac{1}{a_{n}+m}=\dfrac{1}{a_{n}-m}-\dfrac{1}{a_{n + 1}-m}\Rightarrow\sum\limits_{i = 1}^{n}\dfrac{1}{a_{i}+m}=\dfrac{1}{a_{1}-m}-\dfrac{1}{a_{n + 1}-m}\)

  3. 三角函数型, 设\(\{a_{n}\}\)为等差数列,公差为\(d\),则

    \(\dfrac{\sin d}{\cos a_{n}\cdot\cos a_{n + 1}}=\dfrac{\sin(a_{n + 1}-a_{n})}{\cos a_{n}\cdot\cos a_{n + 1}}=\dfrac{\sin a_{n + 1}\cos a_{n}-\cos a_{n + 1}\sin a_{n}}{\cos a_{n}\cdot\cos a_{n + 1}}=\dfrac{\sin a_{n + 1}}{\cos a_{n + 1}}-\dfrac{\sin a_{n}}{\cos a_{n}}=\tan a_{n + 1}-\tan a_{n}\)

    \(\dfrac{\sin d}{\sin a_{n}\cdot\sin a_{n + 1}}=\dfrac{\sin(a_{n + 1}-a_{n})}{\sin a_{n}\cdot\sin a_{n + 1}}=\cot a_{n }-\cot a_{n+ 1}\),例如\(\dfrac{1}{\sin n\sin(n + 1)}=\dfrac{1}{\sin 1}\left(\cot n-\cot(n + 1)\right)\)

    \(\tan a_{n + 1}\cdot\tan a_{n}=\dfrac{\tan a_{n + 1}-\tan a_{n}}{\tan d}-1\),例如: \(\tan n\cdot\tan(n + 1)=\dfrac{\tan(n + 1)-\tan n}{\tan 1}-1\)

    \[ 2^{n}\cos\dfrac{n\pi}{3}=\dfrac{\sqrt{3}}{3}\left[2^{n + 1}\sin\dfrac{(n + 1)\pi}{3}-2^{n}\sin\dfrac{n\pi}{3}\right] \quad , \quad 2^{n}\sin\dfrac{n\pi}{3}=\dfrac{\sqrt{3}}{3}\left[2^{n}\cos\dfrac{n\pi}{3}-2^{n + 1}\cos\dfrac{(n + 1)\pi}{3}\right] \]
    \[ 2\sin x\cos2nx=\sin(2n + 1)x-\sin(2n - 1)x \quad , \quad 2\sin x\sin2nx=\cos(2n - 1)x-\cos(2n + 1)x \]
    \[ \dfrac{1}{\sin2^{n}x}=\cot2^{n - 1}x-\cot2^{n}x\quad , \quad \dfrac{1}{2^{n}}\tan\dfrac{\theta}{2^{n}}=\dfrac{1}{2^{n}}\cot\dfrac{\theta}{2^{n}}-\dfrac{1}{2^{n - 1}}\cot\dfrac{\theta}{2^{n - 1}} \]
    \[ 3^{n - 1}\sin^{3}\dfrac{\theta}{3^{n}}=\dfrac{3^{n}\sin\dfrac{\theta}{3^{n}}}{4}-\dfrac{3^{n - 1}\sin\dfrac{3\theta}{3^{n}}}{4} =\dfrac{1}{4}\left[3^{n}\sin\dfrac{\theta}{3^{n}}-3^{n - 1}\sin\dfrac{\theta}{3^{n - 1}}\right] \]
  4. 组合数型

    \(C_{n}^{m + 1}=C_{n + 1}^{m - 1}-C_{n}^{m - 2}\),   \(nA_{n}^{n}=A_{n + 1}^{n}-A_{n}^{n}\),   \(\dfrac{1}{C_{n + 1}^{1}C_{n}^{2}}=\dfrac{2}{(n + 1)n(n - 1)}=\dfrac{1}{n(n - 1)}-\dfrac{1}{n(n + 1)}\)

    \(\left(1+\dfrac{1}{n}\right)^{n}{\lt}1 + 1+\dfrac{1}{1\times2}+\dfrac{1}{2\times3}+\cdots+\dfrac{1}{(n - 1)n}{\lt}3\)

    注:事实上,当 \(n\rightarrow+\infty,\left(1+\dfrac{1}{n}\right)^{n}\) 存在极限为自然常数 \(e\).

结论 5. 倒序相加(乘)法

  1. 对于某个数列\(\{a_n\}\),若满足\(a_1 + a_n = a_2 + a_{n-1} = \dots = a_k + a_{n-k+1}\),则求前\(n\)项和\(S_n\)可使用倒序相加法.

    具体解法:设\(S_n = a_1 + a_2 + \dots + a_{n-1} + a_n\)

    把①反序可得\(S_n = a_n + a_{n-1} + \dots + a_2 + a_1\)

    由①\(+\)②得\(2S_n = (a_1 + a_n) + (a_2 + a_{n-1}) + \dots + (a_{n-1} + a_2) + (a_n + a_1) \Rightarrow S_n = \frac{(a_1+a_n)n}{2}.\)

  2. 对于某个数列\(\{a_n\}\),若满足\(a_1a_n = a_2a_{n-1} = \dots = a_k a_{n-k+1}\),则求前\(n\)项积\(T_n\)可使用倒序相乘法.具体解法类同倒序相加法.

结论 6. 绝对值数列求和

数列\(\{a_n\}\)的前\(n\)项和\(S_n\)\(\{|a_n|\}\)的前\(n\)项和\(T_n\)的关系.

\(\{a_n\}\)的前\(k\)项均为非负数,则\(T_n = \begin{cases} S_n, n \leq k \\ S_k - (S_n - S_k) = 2S_k - S_n,\ n {\gt} k \end{cases}\)

\(\{a_n\}\)的前\(k\)项均为非正数,则\(T_n = \begin{cases} -S_n, n \leq k \\ -S_k + (S_n - S_k) = S_n - 2S_k,\ n {\gt} k \end{cases}\)

结论 7. 奇偶数列求和

数列\(a_n=\begin{cases} f(n), & n\text{为奇数} \\ g(n), & n\text{为偶数} \end{cases}\),要求其前\(n\)项和\(S_n\).

\(n\)为偶数时, \(S_n = f(1) + f(3) + \cdots + f(n - 1) + g(2) + g(4) + \cdots + g(n)\),将其记为\(h(n)\).

\(n\)为奇数时,\(n+1\)为偶数, \(S_n = S_{n+1} - a_{n+1} = \htmlClass{blank}{h(n+1) - g(n+1)}\).

注:对于奇偶数列可以使用如下方法合二为一:

   若\(a_n=\begin{cases} f(n), & n = 2k - 1 \\ g(n), & n = 2k \end{cases},k\in N^*\),则\(a_n=\dfrac{f(n)+g(n)}{2}+(-1)^{n - 1}\dfrac{f(n)-g(n)}{2}\)

结论 8. 四分组求和

若数列\(\{a_n\}\)满足\(a_{n+1} + (-1)^n a_n = An + B\)\(S_n\)为其前\(n\)项和,则数列\(\{S_4, S_8 - S_4, S_{12} - S_8, \cdots\}\)是以\(6A + 2B\)为首项,\(8A\)为公差的等差数列.

证明: \(\begin{cases} a_2 - a_1 = A + B \quad (1) \\ a_3 + a_2 = 2A + B \quad (2) \\ a_4 - a_3 = 3A + B \quad (3) \end{cases}\) \((2) - (1) + (2) + (3)\)得:\(a_1 + a_2 + a_3 + a_4 = 6A + 2B\)

同理 \(\begin{cases} a_6 - a_5 = 5A + B \quad (4) \\ a_7 + a_6 = 6A + B \quad (5) \\ a_8 - a_7 = 7A + B \quad (6) \end{cases}\) \((5) - (4) + (5) + (6)\)得:\(a_5 + a_6 + a_7 + a_8 = 14A + 2B\).

故数列\(\{S_4, S_8 - S_4, S_{12} - S_8, \cdots\}\)是以\(6A + 2B\)为首项,\(8A\)为公差的等差数列. 此类型题可以求出通项,但花的时间太多,显然每4项为一个整体操作更简单.

其他常考数列

定义 1. 斐波那契数列(人教A选修二P10)

(Fibonacci sequence),又称黄金分割数列, 因数学家莱昂纳多·斐波那契(Leonardo Fibonacci)以兔子繁殖为例子而引入,故又称为“兔子数列”, 指的是这样一个数列:0、1、1、2、3、5、8、13、21、34、……在数学上,斐波那契数列以如下被以递推的方法定义: \(F(0)=0\)\(F(1)=1\)\(F(n)=\htmlClass{blank}{F(n - 1)+F(n - 2)}\)\(n\geq 2\)\(n\in N^{*}\)).

性质 1. 通项公式

递推关系:\(a_{n}=a_{n - 1}+a_{n - 2}\ (n\geq3)\)      通项公式:\(a_{n}=\dfrac{1}{\sqrt{5}}\left[\left(\dfrac{1+\sqrt{5}}{2}\right)^{n}-\left(\dfrac{1-\sqrt{5}}{2}\right)^{n}\right]\)

证明1: 由递推关系,其特征方程为\(x^{2}-x - 1=0\), 解特征方程得\(x_{1}=\dfrac{1+\sqrt{5}}{2}\)\(x_{2}=\dfrac{1-\sqrt{5}}{2}\).

设通项公式为\(a_{n}=c_{1}x_{1}^{n}+c_{2}x_{2}^{n}\),其中\(c_{1}\)\(c_{2}\)为待定系数. 利用初始条件\(a_{1}=1\)\(a_{2}=1\), 解得\(c_{1}=\dfrac{1}{\sqrt{5}}\)\(c_{2}=-\dfrac{1}{\sqrt{5}}\).

所以斐波那契数列的通项公式为\(a_{n}=\dfrac{1}{\sqrt{5}}\left[\left(\dfrac{1+\sqrt{5}}{2}\right)^{n}-\left(\dfrac{1-\sqrt{5}}{2}\right)^{n}\right]\)

证明2:设\(a_{n}-x_{1}\cdot a_{n - 1}=x_{2}(a_{n - 1}-x_{1}\cdot a_{n - 2})\),展开可得\(a_{n}=(x_{1}+x_{2})a_{n - 1}-x_{1}x_{2} a_{n - 2}\).

对比斐波那契数列的递推关系\(a_{n}=a_{n - 1}+a_{n - 2}\),得到方程组\(\begin{cases}x_{1}+x_{2} = 1\\x_{1}\cdot x_{2}=-1\end{cases}\).

根据上述方程组构造方程\(x^{2}-x - 1=0\),利用求根公式解得\(x_{1,2}=\dfrac{1\pm\sqrt{5}}{2}\)

代入\(a_{n}-x_{1}\cdot a_{n - 1}=x_{2}(a_{n - 1}-x_{1}\cdot a_{n - 2})\),得到:

\[ a_{n}-\dfrac{1-\sqrt{5}}{2}a_{n - 1}=\dfrac{1+\sqrt{5}}{2}\left(a_{n - 1}-\dfrac{1-\sqrt{5}}{2}a_{n - 2}\right)\quad(1) \]
\[ a_{n}-\dfrac{1+\sqrt{5}}{2}a_{n - 1}=\dfrac{1-\sqrt{5}}{2}\left(a_{n - 1}-\dfrac{1+\sqrt{5}}{2}a_{n - 2}\right)\quad(2) \]

由(1),(2)可构造等比数列:

\[ a_{n}-\dfrac{1-\sqrt{5}}{2}a_{n - 1}=\left(\dfrac{1+\sqrt{5}}{2}\right)^{n - 2}\left(a_{2}-\dfrac{1-\sqrt{5}}{2}a_{1}\right) \quad(3) \]
\[ a_{n}-\dfrac{1+\sqrt{5}}{2}a_{n - 1}=\left(\dfrac{1-\sqrt{5}}{2}\right)^{n - 2}\left(a_{2}-\dfrac{1+\sqrt{5}}{2}a_{1}\right) \quad(4) \]

\((3)\times\dfrac{1+\sqrt{5}}{2}-(4)\times\dfrac{1-\sqrt{5}}{2}\),化简可得: \(a_{n}=\dfrac{1}{\sqrt{5}}\left[\left(\dfrac{1+\sqrt{5}}{2}\right)^{n}-\left(\dfrac{1-\sqrt{5}}{2}\right)^{n}\right]\)

定义 2. 斐波那契螺旋

\begin{minipage} {0.6\textwidth} 斐波那契数列有很多有趣的性质.例如,斐波那契数列满足等式

\[ F_1^2+F_2^2+\cdots+F_n^2=\htmlClass{blank}{F_nF_{n+1}} \]

可以用图形来表示这个等式.图中小正方形的边长等于斐波那契数 \(1,\,1,\,2,\,3,\,5,\,8,\dots\) 若干小正方形构成的长方形的边长依次是两个斐波那契数的乘积 \(1\times2,\;2\times3,\;3\times5,\;\dots\) ,从内到外依次连接通过小正方形的四分之一圆弧,就得到了一条被称为“斐波那契螺旋”的弧线. 如果在图上不断增加边长是斐波那契数的正方形,那么“斐波那契螺旋”也将不断向外延伸,而且它的形状将越来越接近“黄金比例螺旋”.

图

性质 2. 常考求和

  1. 斐波那契数列的奇数项之和:\(a_{1}+a_{3}+a_{5}+\cdots+a_{2n-1}=\htmlClass{blank}{a_{2n}}\)

  2. 斐波那契数列的偶数项之和:\(a_{2}+a_{4}+a_{6}+\cdots+a_{2n}=\htmlClass{blank}{a_{2n + 1}-1}\)

  3. 斐波那契数列的前\(n\)项之和:\(S_{n}=a_{1}+a_{2}+a_{3}+\cdots+a_{n}=\htmlClass{blank}{a_{n + 2}-1}\)

  4. 斐波那契数列的前\(n\)项的平方和:\(a_{1}^{2}+a_{2}^{2}+a_{3}^{2}+\cdots+a_{n}^{2}=\htmlClass{blank}{a_{n}a_{n + 1}}\)

证明:\(a_1 + a_3 + a_5 + \cdots + a_{2n-1} = a_1 + (a_4 - a_2) + (a_6 - a_4) + \cdots + (a_{2n} - a_{2n - 2}) = a_1 - a_2 + a_{2n} = a_{2n}\)

\(a_2 + a_4 + a_6 + \cdots + a_{2n} = (a_3 - a_1) + (a_5 - a_3) + (a_7 - a_5) + \cdots + (a_{2n+1} - a_{2n - 1}) = a_{2n+1} - a_1 = a_{2n+1} - 1\)

\(S_{n}=a_{1}+a_{2}+\cdots+a_{n}=(a_{3}-a_{2})+(a_{4}-a_{3})+\cdots+(a_{n + 2}-a_{n + 1})=a_{n + 2}-a_2=a_{n + 2}-1\)

\(a_{n + 1}=a_{n}+a_{n - 1}\)\(n\geq2\)),则\(a_{n}=a_{n + 1}-a_{n - 1}\),即\(a_{n}^{2}=a_{n}a_{n + 1}-a_{n - 1}a_{n}\).

\(a_{1}^{2}+a_{2}^{2}+\cdots+a_{n}^{2}=a_{1}^{2}+(a_{2}a_{3}-a_{1}a_{2})+(a_{3}a_{4}-a_{2}a_{3})+\cdots+(a_{n}a_{n + 1}-a_{n - 1}a_{n})={a_1}^2 - a_1a_2 + a_{n}a_{n + 1} = a_{n}a_{n + 1}\)

性质 3. 其他性质

  1. \(\text{分式求和问题:}\dfrac{1}{a_{1}a_{3}}+\dfrac{1}{a_{2}a_{4}}+\cdots+\dfrac{1}{a_{2n - 3}a_{2n - 1}}+\dfrac{1}{a_{2n - 2}a_{2n}}\)

    \(=\dfrac{1}{a_{2}}\left(\dfrac{1}{a_{1}}-\dfrac{1}{a_{3}}\right)+\dfrac{1}{a_{3}}\left(\dfrac{1}{a_{2}}-\dfrac{1}{a_{4}}\right)+\cdots+\dfrac{1}{a_{2n - 2}}\left(\dfrac{1}{a_{2n - 3}}-\dfrac{1}{a_{2n - 1}}\right) +\dfrac{1}{a_{2n - 1}}\left(\dfrac{1}{a_{2n - 2}}-\dfrac{1}{a_{2n}}\right)=\dfrac{1}{a_{1}a_{2}}-\dfrac{1}{a_{2n - 1}a_{2n}}\)

  2. 连续三项斐波那契数后两项乘积与前两项乘积的差,是中间项的平方,即\(a_{n+1}a_n - a_n = a_n^2(n\geq 2).\)

  3. 连续两项斐波那契数的平方和仍是斐波那契数,即\(a_n^2 + a_{n+1}^2 = a_{2n+1}\)

  4. 连续两项斐波那契数的平方差仍是斐波那契数,即\(a_{n+1}^2 - a_{n-1}^2 = a_{2n}(n\geq 2)\)

  5. 连续三项斐波那契数后两项的平方和与第一项的平方之差仍是斐波那契数,即\(a_{n+1}^2 + a_n^2 - a_{n-1}^2 = a_{3n}(n\geq 2).\)

  6. 下标为\(3k\)的前\(n\)项斐波那契数之和满足:\(a_3 + a_6 + \dots +a_{3n} = \dfrac{1}{2}(a_{3n+2} - 1).\)

  7. 斐波那契数列前\(n\)项相邻两项乘积之和, 当\(n\)是奇数时等于第\(n+1\)项的值的平方, 当\(n\)是偶数时等于第\(n\)项和第\(n+2\)项的值之积.

    即:\(a_1a_2 + a_2a_3 + \dots \dots +a_n a_{n+1}\),当\(n\)是奇数时等于\(a_{n+1}^2\),当\(n\)是偶数时等于\(a_n a_{n+2}.\)

性质 4. 与集合的关系

斐波那契数列的第\(n + 2\)项同时也代表了集合\(\{1,2,\cdots,n\}\)中所有不包含相邻正整数的子集.

证明: 设\(F_n\)为斐波那契数列的第\(n\)项,满足\(F_1 = 1\)\(F_2=1\)\(F_{n}=F_{n - 1}+F_{n - 2}\)\(n\geq3\)).

\(a_n\)为集合\(\{1,2,\cdots,n\}\)中所有不包含相邻正整数的子集的个数.

\(n = 1\)时,集合\(\{1\}\)中不包含相邻正整数的子集为\(\varnothing\)\(\{1\}\),共\(2\)个,而\(F_{3}=2\),所以\(a_1 = F_{3}\).

\(n = 2\)时,集合\(\{1,2\}\)中不包含相邻正整数的子集为\(\varnothing\)\(\{1\}\)\(\{2\}\),共\(3\)个,而\(F_{4}=3\),所以\(a_2 = F_{4}\).

假设对于\(n = k - 1\)\(n = k\)\(k\geq3\))时,有\(a_{k - 1}=F_{k + 1}\)\(a_{k}=F_{k + 2}\).

对于集合\(\{1,2,\cdots,k + 1\}\),考虑其中不包含相邻正整数的子集.这些子集可以分为两类:

(1)不包含\(k + 1\)的子集,其个数为\(a_{k}\),根据归纳假设为\(F_{k + 2}\).

(2)包含\(k + 1\)的子集,那么就不能包含\(k\),其个数为\(a_{k - 1}\),根据归纳假设为\(F_{k + 1}\).

所以\(a_{k + 1}=a_{k}+a_{k - 1}=F_{k + 2}+F_{k + 1}=F_{k + 3}\).

由数学归纳法可知,对于任意的正整数\(n\),集合\(\{1,2,\cdots,n\}\)中所有不包含相邻正整数的子集的个数\(a_n\)等于斐波那契数列的第\(n + 2\)\(F_{n + 2}\).

性质 5. 整除问题

\(3,6,9\)等项的数字能被\(2\)整除;

\(4,8,12\)等项的数字能被\(3\)整除;

\(5,10,15\)等项的数字能被\(5\)整除;其余以此类推.

定义 3. 欧拉函数(人教A选修二P8)

欧拉函数 \(\varphi(n)\ (n\in\mathbb{N}^*)\) 的函数值等于所有不超过正整数 \(n\) 且与 \(n\) 互素的正整数的个数,例如 \(\varphi(1)=1,\ \varphi(4)=2\).

定义 4. 标准分解式

将质因数分解的结果,按照质因数大小由小到大排列,并将相同质因数的连乘积以指数形式表示,此种表示法称为标准分解式. 例如,2024 的标准分解式是 \(2024=2^3\times11\times23\)

结论 1. 质数与欧拉函数

\(n\) 为合数且不知道 \(n\) 的标准因数分解时,很难求出 \(n\) 的欧拉函数值 \(\varphi(n)\);但对于质数,则有:

  1. \(p\) 为质数,则 \(\varphi(p)=p-1\)

  2. \(p\) 为质数,且 \(n=p^k\),则 \(\varphi(n)=\varphi(p^k)=p^{k-1}(p-1)\).因此当幂次 \(k\) 增加时形成了一个等比数列

结论 2. 欧拉函数的计算公式

对于一个数\(n\),先化为标准分解式:令 \(n=p_1^{\alpha_1}p_2^{\alpha_2}\cdots p_r^{\alpha_r}.\) 再依照下面的公式计算:

\[ \varphi(n)=\prod_{i=1}^r p_i^{\alpha_i-1}(p_i-1) = n\prod_{i=1}^r\Bigl(1-\frac{1}{p_i}\Bigr), \]

其中 \(p_i\)\(n\) 的所有不重复的质因数.

例如, \(\varphi(2024)=2^{3-1}\times(2-1)\times11^{1-1}\times(11-1)\times23^{1-1}\times(23-1) =2024\Bigl(1-\dfrac{1}{2}\Bigr)\Bigl(1-\dfrac{1}{11}\Bigr)\Bigl(1-\dfrac{1}{23}\Bigr)=880.\)

定义 5. 跳跃等差数列

满足\(a_{n+2} - a_{n} = d\)的数列称为跳跃等差数列或隔项等差数列. 通项公式: \(a_{n}=\begin{cases} a_{1} + \dfrac{n-1}{2}d,n\text{为奇数} \\ a_{2} + \dfrac{n-2}{2}d,n\text{为偶数} \end{cases}\)

定义 6. 类等和数列

形如\(a_{n+1} + a_{n} = f(n)\)的数列称为类等和数列.若\(f(n) = c\),则为等和数列.

求通项思路:

  法1.与邻项递推式作差后讨论奇偶项

  法2.等号两边同乘\((-1)^{n+1}\),令 \(b_{n} = (-1)^{n+1}a_{n}\),再累加

\(f(n) = c\),数列\(\{a_{n}\}\)为周期数列,周期为2

\(f(n) = dn+b\),与邻项递推式作差可得\(a_{n+2} - a_{n} = d\),数列\(\{a_{n}\}\)是公差为\(d\)的跳跃等差数列

定义 7. 跳跃等比数列

\(a_{n + 2}\)\(a_{n}\)不是数列\(\{a_{n}\}\)中连续的项,因此我们称满足\(\dfrac{a_{n + 2}}{a_{n}} = q\)条件的数列\(\{a_{n}\}\)为跳跃等比数列.

通项公式:

①当\(n\)为奇数时,可令\(n = 2k - 1\)\(k\in N^{*}\)),反解得\(k=\dfrac{n + 1}{2}\),于是\(a_{n}=a_{2k - 1}=a_{1}\cdot q^{k - 1}=a_{1}\cdot q^{\frac{n + 1}{2}-1}=a_{1}\cdot q^{\frac{n - 1}{2}}\);

②当\(n\)为偶数时,可令\(n = 2k\)\(k\in N^{*}\)),反解得\(k=\dfrac{n}{2}\),于是\(a_{n}=a_{2k}=a_{2}\cdot q^{k - 1}=a_{2}\cdot q^{\frac{n}{2}-1}=a_{2}\cdot q^{\frac{n - 2}{2}}\).

综上所述,\(a_{n}=\begin{cases} a_{1}\cdot q^{\frac{n - 1}{2}} & ,n\text{为奇数} \\ a_{2}\cdot q^{\frac{n - 2}{2}} & ,n\text{为偶数} \end{cases}\).

定义 8. 类等积数列

形如\(a_{n+1}a_{n} = f(n)\)的数列称为类等积数列.若\(f(n) = c\),则为等积数列.

\(f(n) = c\),数列\(\{a_{n}\}\)为周期数列,周期为2

\(f(n) = pq^{n}\),与邻项递推式作商可得\(\dfrac{a_{n+2}}{a_{n}} = q\),数列\(\{a_{n}\}\)是公比为\(q\)的跳跃等比数列

定义 9. 二阶等差数列

在数列\(\{a_{n}\}\)中,从第二项起,每一项与它的前一项的差按照前后次序排成新的数列,即 \(a_{2}-a_{1},a_{3}-a_{2},a_{4}-a_{3},\cdots,a_{n}-a_{n - 1},\cdots\)成为一个等差数列,则称数列\(\{a_{n}\}\)为二阶等差数列,记\(d_{1}=a_{2}-a_{1}\)\(d_{2}=(a_{3}-a_{2})-(a_{2}-a_{1})\)

性质 6. 用累加法推导二阶等差数列的通项公式

\(a_{2}-a_{1}=d_{1}\)\(a_{3}-a_{2}=d_{1}+d_{2}\)\(\cdots\) \(a_{n-1}-a_{n-2}=d_{1}+(n - 3)d_{2}\)\(a_{n}-a_{n-1}=d_{1}+(n - 2)d_{2}\)

累加得: \(a_{n}-a_{1}=(n - 1)d_{1}+[1 + 2 + 3+\cdots+(n - 2)]d_{2}\) \(=(n - 1)d_{1}+\dfrac{(n - 1)(n - 2)}{2}d_{2}\)

故二阶等差数列的通项公式为 \(a_{n}=a_{1}+(n - 1)d_{1}+\dfrac{(n - 1)(n - 2)}{2}d_{2} = \htmlClass{blank}{An^2+Bn+C}\)(可用待定系数法求解)

性质 7. 用分组求和法求二阶等差数列的前\(n\)项和公式

\(S_{n}=na_{1}+[1 + 2+\cdots+(n - 1)]d_{1}+\dfrac{1}{2}\left[1^{2}+2^{2}+\cdots+n^{2}+\dfrac{n(-1 - 3n + 2)}{2}\right]d_{2}\)

\(\quad =na_{1}+\dfrac{n(n - 1)}{2}d_{1}+\dfrac{1}{2}\left[\dfrac{n(n + 1)(2n + 1)}{6}+\dfrac{n(1 - 3n)}{2}\right]d_{2}\)

\(\quad =na_{1}+\dfrac{n(n - 1)}{2}d_{1}+\dfrac{1}{2}\left[\dfrac{n(n + 1)(2n + 1)}{6}+\dfrac{n(3 - 9n)}{6}\right]d_{2}\)

\(\quad =na_{1}+\dfrac{n(n - 1)}{2}d_{1}+\dfrac{1}{2}\left[\dfrac{n(2n^{2}+3n + 1 + 3 - 9n)}{6}\right]d_{2}\) \(=na_{1}+\dfrac{n(n - 1)}{2}d_{1}+\dfrac{1}{2}\cdot\dfrac{n(2n^{2}-6n + 4)}{6}d_{2}\)

\(\quad =na_{1}+\dfrac{n(n - 1)}{2!}d_{1}+\dfrac{n(n - 1)(n - 2)}{3!}d_{2} = \htmlClass{blank}{An^3+Bn^2+Cn}\)

定义 10. 三阶等差数列

对于数列\(\{a_{n}\}\),从第二项起,每一项与它的前一项的差构成一个新的数列(称为一阶差数列),若这个一阶差数列是一个二阶等差数列,则原数列\(\{a_{n}\}\)称为三阶等差数列.

数列\(\{a_{n}\}\)为三阶等差数列,它的各阶等差数列的首项为\(d_{1}\)\(d_{2}\)\(d_{3}\),则三阶等差数列的通项公式为

\[ a_{n}=a_{1}+(n - 1)d_{1}+\dfrac{(n - 1)(n - 2)}{2!}d_{2}+\dfrac{(n - 1)(n - 2)(n - 3)}{3!}d_{3}=An^3+Bn^2+Cn+D \]

三阶等差数列的前\(n\)项和公式为

\[ S_{n}=na_{1}+\dfrac{n(n - 1)}{2!}d_{1}+\dfrac{n(n - 1)(n - 2)}{3!}d_{2}+\dfrac{n(n - 1)(n - 2)(n - 3)}{4!}d_{3}=An^4+Bn^3+Cn^2+Dn \]

定义 11. 周期数列

对于数列\(\{a_{n}\}\),如果存在一个常数\(T\ (T\in N^{+})\),使得对任意的正整数\(n {\gt} n_{0}\)恒有\(a_{n + T}=a_{n}\)成立,则称数列\(\{a_{n}\}\)是从第\(n_{0}\)项起的周期为\(T\)的周期数列.若\(n_{0}=1\),则称数列\(\{a_{n}\}\)为纯周期数列,若\(n_{0}\geq2\),则称数列\(\{a_{n}\}\)为混周期数列,\(T\)的最小值称为最小正周期,简称周期.

性质 8. 常见性质和结论

  1. 周期数列是无穷数列,且值域有限,必有最小正周期;若\(T\)是周期,则其倍数\(kT\)也是周期;若\(T\)是最小正周期,则其必能整除数列的任一周期\(M\).

  2. 若数列\(\{A_{n}\}\)周期为\(t\),且\(n = qt + r (0 \leq r {\lt} t)\),则其前\(n\)项和\(S_{n} = qS_{t} + S_{r}\),前\(n\)项积\(T_{n} = T_{t}^{q} T_{r}\).

{

\[ \begin{aligned} & a_{n} + a_{n-1} = s \Rightarrow T = \htmlClass{blank}{2} && a_{n}a_{n-1} = s \Rightarrow T = \htmlClass{blank}{2} && a_{n+1} = \frac{1 - a_{n}}{1 + a_{n}} \Rightarrow T = \htmlClass{blank}{2} \1ex] & a_{n+1} = \frac{xa_{n} + y}{ka_{n} + b} (x=b) \Rightarrow T = 2 && a_{n} + a_{n-1} + a_{n-2} = s \Rightarrow T = \htmlClass{blank}{3} && a_{n} a_{n-1} a_{n-2} = s \Rightarrow T = 3 \1ex] & a_{n+1} = -\frac{1}{1 + a_{n}} \Rightarrow T = 3 && a_{n+1} = 1 - \frac{1}{a_{n}} \Rightarrow T = 3 && a_{n+1} = \frac{1 + a_{n}}{1 - a_{n}} \Rightarrow T = 4 \1ex] & a_{n+1} = \frac{a_{n} - 1}{a_{n} + 1} \Rightarrow T = 4 && a_{n+2} = a_{n+1} - a_{n} \Rightarrow T = 6 && a_{n} = \frac{\sqrt{3}a_{n+1} - 1}{\sqrt{3} - a_{n+1}} \Rightarrow T = 6 \end{aligned} \]

}

不动点与蛛网图

定义 1. 递推数列

\(f: D \to R\), 其中 \(D\)\(R\)一个区间, 数列\(\{a_{n}\}\)\(a_{1}=a\)和递推关系\(a_{n + 1}=f\left(a_{n}\right)\)来确定, 则数列\(\{a_{n}\}\)称为递推数列.\(f(x)\)称为数列\(\{a_{n}\}\)的特征函数, \(x = f(x)\)称为数列\(\{a_{n}\}\)的特征方程, \(a_{1}=a\)称为初始值.

定义 2. 迭代数列定义

所谓迭代数列是指在已知数列的第一项\(a_{1}\), 后用递推公式\(a_{n + 1}=f(a_{n})(n\in N^{+})\)通过迭代生成的数列.

定义 3. 不动点

设数列\(\{a_{n}\}\)满足递推公式\(a_{n + 1}=f(a_{n})(n\in N^{+})\), 如果数列\(\{a_{n}\}\)收敛于\(x_{0}\), 而且有当\(n\rightarrow +\infty\)\(f(x_{n})=f(x_{0})\)成立, 则数列\(\{a_{n}\}\)的极限\(x_{0}\)必定是方程\(f(x)=x\)根, 这时\(x_{0}\)称为\(f(x)\)的不动点.

若数列\(\{a_n\}\)的递推公式为\(a_{n + 1}=f(a_n)\),把此式中的\(a_{n + 1}\)\(a_n\)均换成\(x\),得方程\(x = f(x)\),我们把函数\(f(x)\)的不动点\(x_0\)称为数列\(\{a_n\}\)的不动点.

结论 1. 不动点法求数列的通项公式

  1. \(f(x)=ax + b(a\neq0,a\neq1)\)\(x_0\)\(f(x)\)的不动点,\(\{a_n\}\)满足\(a_{n + 1}=f(a_n)\),则\(\{a_n - x_0\}\)是等比数列.

  2. \(f(x)=\dfrac{ax + b}{cx + d}(c\neq0,ad - bc\neq0)\)\(\{a_n\}\)满足\(a_{n + 1}=f(a_n)\)\(a_1\neq f(a_1)\)

    \(f(x)\)有两个相同的不动点\(x_0\),则\(\left\{\dfrac{1}{a_n - x_0}\right\}\)是等差数列.

  3. \(f(x)=\dfrac{ax + b}{cx + d}(c\neq0,ad - bc\neq0)\)\(\{a_n\}\)满足\(a_{n + 1}=f(a_n)\)\(a_1\neq f(a_1)\)

    \(f(x)\)有两个相异的不动点\(x_1,x_2\),则\(\left\{\dfrac{a_n - x_1}{a_n - x_2}\right\}\)是等比数列.

证明:“不动点法”求通项,基本原理就是“因式定理”!

设数列\(\{a_n\}\)的递推公式为\(a_{n + 1}=f(a_n)\),把此式中的\(a_{n + 1}\)\(a_n\)均换成\(x\),得方程\(x = f(x)\),记\(x_0\)是数列\(\{a_n\}\)的不动点,是方程\(x = f(x)\)的实数根,显然,\(x_0\)也是\(f(x) - x_0=0\)的实数根.

如果\(f(x) - x_0\)是多项式函数,那么由因式定理,\(f(x) - x_0\)必定含有因式\((x - x_0)\)

  1. \(f(x)\)是一次函数\(ax + b\),那么由因式定理,\(f(x) - x_0=ax + b - x_0=a (x - x_0)\)

    所以\(a_{n + 1} - x_0= f(a_n) - x_0= a (a_n - x_0)\), 所以\(\{ a_n - x_0 \}\)是一个以\(a\)为公比的等比数列.

  2. \(f(x)\)是一次分式函数\(f(x)=\dfrac{ax + b}{cx + d}\)\(x_1,x_2\)是方程\(x = f(x)\)的两个相等实根, 记为\(x_0\)

    由前述结论有:\(f(x) - x_0=\dfrac{(a - cx_0)(x - x_0)}{cx + d}\). 因为\(x_0\)\(x = f(x)\)的二重根,

    所以\(x_0\)\(x - x_0=f(x) - x_0\),即\(x - x_0=\dfrac{(a - cx_0)(x - x_0)}{cx + d}\)的二重根.

    所以\(x_0\)\(1=\dfrac{(a - cx_0)}{cx + d}\),即\(cx + d-(a - cx_0)=0\)的实根.由因式定理, \(cx + d-(a - cx_0)=c(x - x_0)\)

    所以 \(\dfrac{1}{f(x) - x_0}=\dfrac{cx + d}{(a - cx_0)(x - x_0)}=\dfrac{c(x - x_0)+(a - cx_0)}{(a - cx_0)(x - x_0)}=\dfrac{c}{a - cx_0}+\dfrac{1}{x - x_0}\)

    所以 \(\dfrac{1}{a_{n + 1} - x_0}=\dfrac{1}{f(a_n) - x_0}=\dfrac{c}{a - cx_0}+\dfrac{1}{a_n - x_0}\). 所以 \(\left\{\dfrac{1}{a_n - x_0}\right\}\)是一个以\(\dfrac{c}{a - cx_0}\)为公差的等差数列.

  3. \(f(x)\)是一次分式函数\(f(x)=\dfrac{ax + b}{cx + d}\)\(x_1,x_2\)是方程\(x = f(x)\)的两个不等实根.

    我们先讨论\(x_1\),显然,\(x_1\)也是\(f(x) - x_1=0\)的根. 而\(f(x) - x_1=\dfrac{ax + b}{cx + d}-x_1=\dfrac{ax + b-(cx + d)x_1}{cx + d}\)

    所以 \(x_1\)也是\(ax + b-(cx + d)x_1=0\)的根. 由因式定理,\(ax + b-(cx + d)x_1=(a - cx_1)(x - x_1)\)

    所以 \(f(x) - x_1=\dfrac{(a - cx_1)(x - x_1)}{cx + d}\), 同理 \(f(x) - x_2=\dfrac{(a - cx_2)(x - x_2)}{cx + d}\)

    两式相除得\(\dfrac{f(x) - x_1}{f(x) - x_2}=\dfrac{a - cx_1}{a - cx_2}\cdot\dfrac{x - x_1}{x - x_2}\)

    所以 \(\dfrac{a_{n + 1} - x_1}{a_{n + 1} - x_2}=\dfrac{f(a_n) - x_1}{f(a_n) - x_2}=\dfrac{a - cx_1}{a - cx_2}\cdot\dfrac{a_n - x_1}{a_n - x_2}\). 所以 \(\left\{\dfrac{a_n - x_1}{a_n - x_2}\right\}\)是一个以\(\dfrac{a - cx_1}{a - cx_2}\)为公比的等比数列.

定理 1. 函数的迭代图象(人教B选修三P13-4)

简称蛛网图或者折线图,函数\(y = f(x)\)和直线\(y = x\)共同决定. 其步骤如下:

(1)在同一坐标系中作出\(y = f(x)\)\(y = x\)的图象(草图),并确定不动点.

(2) 在找出不动点之后,确定范围,将不动点之间的图象放大,并找出起始点\(a_{1}\)

(3) 由\(a_{1}\)\(y = f(x)\)作垂直于\(x\)轴的直线与\(y = f(x)\)相交,并确定交点\((a_{1},a_{2})\)

(4) 由\((a_{1},a_{2})\)\(y = x\)作平行于\(x\)轴的直线与\(y = x\)相交,并确定交点\((a_{2},a_{2})\)

(5) 由\((a_{2},a_{2})\)\(y = f(x)\)作垂直于\(x\)轴的直线与\(y = f(x)\)相交,并确定交点\((a_{2},a_{3})\). 重复\(4\)\(5\),直至找到点\((a_{n},a_{n + 1})\)的最终去向

图

定理 2. 数列单调性1

如果数列\(\{a_{n}\}\)满足递推公式\(a_{n + 1}=f(a_{n})(n\in N^{+})\), \(f(x)\)单调增加函数, \(x_{0}\)是函数\(f(x)\)的唯一不动点, 则

(1)当\(a_{1}\leq x_{0}\)\(a_{1}\leq a_{2}\)时, 数列\(\{a_{n}\}\)是单调增加数列, 且\(a_{1}\leq a_{2}\leq a_{3}\cdots\leq x_{0}\)

(2)当\(a_{1}\geq x_{0}\)\(a_{1}\geq a_{2}\)时, 数列\(\{a_{n}\}\)是单调减少数列, 且\(a_{1}\geq a_{2}\geq a_{3}\cdots\geq x_{0}\)

定理 3. 数列单调性2

如果数列\(\{a_{n}\}\)满足递推公式\(a_{n + 1}=f(a_{n})(n\in N^{+})\), \(f(x)\)单调减少函数, \(x_{0}\)是函数\(f(x)\)的唯一不动点, 则

(1)当\(a_{1}\geq x_{0}\)\(a_{2}\leq x_{0}\)时, 数列\(\{a_{2n}\}\)是单调递增数列, 数列\(\{a_{2n - 1}\}\)是单调递减数列且

\[ a_{2}\leq a_{4}\leq a_{6}\leq\cdots\leq a_{2n}\leq a_{2n + 2}\leq\cdots\leq x_{0}\leq\cdots\leq a_{2n + 1}\leq a_{2n - 1}\leq\cdots\leq a_{3}\leq a_{1} \]

(2)当\(a_{1}\leq x_{0}\)\(a_{2}\geq x_{0}\)时, 数列\(\{a_{2n}\}\)是单调递减数列, 数列\(\{a_{2n - 1}\}\)是单调递增数列且

\[ a_{2}\geq a_{4}\geq a_{6}\geq\cdots\geq a_{2n}\geq a_{2n + 2}\geq\cdots\geq x_{0}\geq\cdots\geq a_{2n + 1}\geq a_{2n - 1}\geq\cdots\geq a_{3}\geq a_{1} \]

图

图

定理 4. 单调性总定理

设数列\(\{a_{n}\}\)满足\(a_{n + 1}=f(a_{n})(n\in N^{+})\), 其中\(f(x)\)在区间\(I\)上单调, 同时数列的每一项都在区间\(I\)中, 那么:

(1)当\(f(x)\)单调增加时, \(\{a_{n}\}\)为单调数列

(2)当\(f(x)\)单调减少时, \(\{a_{n}\}\)的子列\(\{a_{2n - 1}\}\)\(\{a_{2n}\}\)分别为单调数列, 且具有相反的单调性

定义 4. 吸引不动点与排斥不动点

吸引与排斥不动点定义: 在不动点\(x_{0}\)处,

\(\vert f^{\prime}(x_{0})\vert{\lt}1\), 则\(x_{0}\)称为\(y = f(x)\)的吸引不动点,

\(\vert f^{\prime}(x_{0})\vert{\gt}1\), 则称\(x_{0}\)\(y = f(x)\)的排斥不动点.

\(\vert f^{\prime}(x_{0})\vert=1\),吸引与排斥情况如图所示:

图

图

图

定理 5. 不动点个数

\(y = f(x)\)定义在\(D\)上的连续可导函数, 有且只有两个不动点\(\alpha,\beta\)\(f^{\prime}(\alpha)\neq1,f^{\prime}(\beta)\neq1\), 异于\(\alpha,\beta\)的初始值\(a_{1}=a\), 递推数列\(a_{n + 1}=f(a_{n}),n\in N^{+}\).则两个不动点\(\alpha,\beta\)至多只有一个吸引不动点.

数学归纳法

定义 1. 数学归纳法

一般地,证明一个与正整数 \(n\) 有关的命题,可按下列步骤进行:

  1. (归纳奠基)证明当 \(n=n_0\ (n_0\in\mathbb{N}^*)\) 时命题成立;

  2. (归纳递推)以“当 \(n=k\ (k\in\mathbb{N}^*,\ k\ge n_0)\) 时命题成立”为条件,推出“当 \(n=k+1\) 时命题也成立”.

只要完成这两个步骤,就可以断定命题对从 \(n_0\) 开始的所有正整数 \(n\) 都成立,这种证明方法称为数学归纳法.

数列放缩

结论 1. 拆项放缩

有些放缩问题直接比较通项和目标很困难, 这时可以先 把目标拆成若干项之和(或积), 再逐项比较.

  1. 和拆项法. 要证 \(a_1 + a_2 + \cdots + a_n {\gt} f(n)\), 可把 \(f(n)\) 也写成 \(n\) 项之和:

    \(b_1 = f(1)\), \(b_k = f(k)-f(k-1)\;(k\geq2)\), 则 \(b_1 + b_2 + \cdots + b_n = f(n)\)(累加).

    只需证每个 \(b_i {\lt} a_i\), 即得 \(a_1 + a_2 + \cdots + a_n {\gt} f(n)\).

  2. 积拆项法. 要证 \(a_1 \cdot a_2 \cdots a_n {\gt} f(n)\), 可把 \(f(n)\) 也写成 \(n\) 项之积:

    \(b_1 = f(1)\), \(b_k = \dfrac{f(k)}{f(k-1)}\;(k\geq2)\), 则 \(b_1 \cdot b_2 \cdots b_n = f(n)\)(累乘).

    只需证每个 \(b_i {\lt} a_i\), 即得 \(a_1 \cdot a_2 \cdots a_n {\gt} f(n)\).

结论 2. 裂项放缩

\(\dfrac {1}{n^2}{\lt}\dfrac {1}{n (n - 1)}=\dfrac {1}{n - 1}-\dfrac {1}{n}\)       \(\dfrac {1}{n^2} {\gt} \dfrac {1}{n (n + 1)} = \dfrac {1}{n}-\dfrac {1}{n + 1}\)

\(\dfrac{1}{n^2}{\lt}\dfrac{1}{n^2 - 1}=\dfrac{1}{2}\left(\dfrac{1}{n - 1}-\dfrac{1}{n + 1}\right)\)       \(\dfrac{1}{n^2}=\dfrac{4}{4n^2}{\lt}\htmlClass{blank}{\dfrac{4}{4n^2 - 1}=2\left(\dfrac{1}{2n - 1}-\dfrac{1}{2n + 1}\right)}\)

\(\dfrac{1}{(2n - 1)^2}{\lt}\dfrac{1}{4n(n - 1)}=\dfrac{1}{4}\left(\dfrac{1}{n - 1}-\dfrac{1}{n}\right)\ (n\geq 2)\)

\(\dfrac{1}{\sqrt{n}}=\dfrac{2}{2\sqrt{n}}{\lt}\htmlClass{blank}{\dfrac{2}{\sqrt{n}+\sqrt{n - 1}}=2(\sqrt{n}-\sqrt{n - 1})}\)    \(\dfrac{1}{\sqrt{n}} = \dfrac{2}{2\sqrt{n}} {\gt} \dfrac{2}{\sqrt{n + 1}+\sqrt{n}} = 2(\sqrt{n + 1}-\sqrt{n})\)

\(\dfrac{1}{\sqrt{n}}=\dfrac{2}{2\sqrt{n}}{\lt}\dfrac{2}{\sqrt{n + 1}+\sqrt{n - 1}}=\sqrt{n + 1}-\sqrt{n - 1}\)

\(\dfrac{1}{\sqrt{n}} = \dfrac{2}{2\sqrt{n}} {\lt} \dfrac{2}{\sqrt{n - \frac{1}{2}} + \sqrt{n + \frac{1}{2}}} = \dfrac{2\sqrt{2}}{\sqrt{2n - 1} + \sqrt{2n + 1}} = \sqrt{2}(\sqrt{2n + 1}-\sqrt{2n - 1})\)

\(\dfrac{1}{n^3}{\lt}\dfrac{1}{n^3-n}=\dfrac{1}{n(n - 1)(n + 1)}=\dfrac{1}{2}\left(\dfrac{1}{n(n - 1)}-\dfrac{1}{n(n + 1)}\right)\)

\(\dfrac{1}{\sqrt{n^3}} = \dfrac{2}{\sqrt{n^2 n} + \sqrt{n n^2}} {\lt} \dfrac{2}{n\sqrt{n-1} + (n-1)\sqrt{n}} = \dfrac{2}{\sqrt{(n-1)n}(\sqrt{n} + \sqrt{n-1})} = \dfrac{2(\sqrt{n} - \sqrt{n-1})}{\sqrt{(n-1)n}} = \dfrac{2}{\sqrt{n-1}} - \dfrac{2}{\sqrt{n}}\)

\(\dfrac {2^n}{(2^n - 1)^2}=\dfrac {2^n}{(2^n - 1)(2^n - 1)}{\lt}\dfrac {2^n}{(2^n - 1)(2^n - 2)}=\dfrac {2^{n - 1}}{(2^n - 1)(2^{n - 1} - 1)}=\dfrac {1}{2^{n - 1} - 1}-\dfrac {1}{2^n - 1}\ (n\geq 2)\)

可推广为:\(\dfrac{a^n}{(a^n - 1)^2}=\dfrac{a^n}{(a^n - 1)(a^n - 1)}{\lt}\dfrac{a^n}{(a^n - 1)(a^n - a)}=\dfrac{a^{n - 1}}{(a^n - 1)(a^{n - 1} - 1)}=\dfrac{1}{a - 1}(\dfrac{1}{a^{n - 1} - 1}-\dfrac{1}{a^n - 1})\)

\(\dfrac{1}{2^n - 1}=\dfrac{2^{n + 1}-1}{(2^n - 1)(2^{n + 1}-1)}{\lt}\dfrac{2^{n + 1}}{(2^n - 1)(2^{n + 1}-1)}=\dfrac{2}{2^n - 1}-\dfrac{2}{2^{n + 1}-1}\)

\(\dfrac{1}{3^n - 1}=\dfrac{3^{n + 1}-1}{(3^n - 1)(3^{n + 1}-1)}{\lt}\dfrac{3^{n + 1}}{(3^n - 1)(3^{n + 1}-1)}=\dfrac{3}{2}\left(\dfrac{1}{3^n - 1}-\dfrac{1}{3^{n + 1}-1}\right)\)

结论 3. 放缩成等比数列

\(a^{n - 1}\geq 1\ (a {\gt} 1)\),底数\(a\)的取值,根据题目具体调整即可

\(\dfrac{1}{3^n - 1}{\lt}\dfrac{1}{3^n - 3^{n - 1}}=\dfrac{1}{2\cdot 3^{n - 1}}\),  \(\dfrac{1}{a^n - b}\leq\dfrac{1}{a^{n - 1}(a - b)}(a {\gt} b\geq 1)\)\(\dfrac{1}{a^n - b^n}\leq\dfrac{1}{a^{n - 1}(a - b)}(a {\gt} b\geq 1)\)

对于\(n^2 + bn + c\)型放缩,有\(\dfrac{1}{n^2 + bn + c}\leq \dfrac{1}{(n+\lambda)(n + k+\lambda)}\), 其中\(n,k\in N^*\)\(b,c,\lambda\in R\)

\(n^2 + bn + c\geq(n+\lambda)(n + k+\lambda)\),得\((b - k - 2\lambda)n+(c-\lambda k-\lambda^2)\geq0\) 为了达到最好的放缩目的,应当使得不等式相等或接近, 令\(b - k - 2\lambda = 0\)\(c-\lambda k-\lambda^2\geq0\),连列得\(k\geq\sqrt{b^2 - 4c}\)\(\lambda=\dfrac{b - k}{2}\),让\(k\)取得不等式最小得正整数即可, 可尝试用上述方法放缩\(\dfrac{1}{2n^2 + n - 1}\)

结论 4. 放缩成二项式定理或糖水不等式

  1. 二项式定理

    \(\dfrac{1}{2^n -1}{\lt}\dfrac{2}{n(n + 1)}=2\left(\dfrac{1}{n}-\dfrac{1}{n + 1}\right)(n\geq 3)\),因为\(2^n -1=(C_n^0 + C_n^1+\cdots + C_n^n)-1{\gt} C_n^1 + C_n^2=\dfrac{n(n + 1)}{2}(n\geq 3)\)

    \(2^n{\gt}2n + 1(n\geq 3)\),因为\(2^n=(1 + 1)^n = C_n^0 + C_n^1+\cdots + C_n^{n - 1}+C_n^n{\gt} C_n^0 + 2C_n^1=2n + 1\)

    \(2^n\geq n^2 + n + 2(n\geq 5)\),因为\(2^n=(1 + 1)^n = C_n^0 + C_n^1 + C_n^2+\cdots + C_n^{n - 2}+C_n^{n - 1}+C_n^n\geq 2C_n^0 + 2C_n^1 + 2C_n^2=n^2 + n + 2\).

  2. 糖水不等式

    \(b{\gt}a{\gt}0\)\(m{\gt}0\),则\(\dfrac{a + m}{b + m}{\gt}\dfrac{a}{b}\);若\(b{\gt}a{\gt}m{\gt}0\),则\(\dfrac{a - m}{b - m}{\lt}\dfrac{a}{b}\).

    解释:\(b\)克不饱和糖水里含有\(a\)克糖,再往糖水里加入\(m\)克糖,则糖水变甜.

    如,\(\dfrac{1}{3^n -1}{\lt}\dfrac{1 + 1}{3^n -1 + 1}=\dfrac{2}{3^n}(n\geq 1)\).

结论 5. 放缩精度控制

  1. 裂项放缩精度控制

    对于放缩后,再裂项相消求和类型,通过放缩后的裂项公式的首项或前几项的和即可判断放缩的精度是否满足题设要求. 常见的题目无非是从第一项开始放缩、从第二项开始放缩或者从第三项开始放缩这三种. 比如:

    1. \(\dfrac{1}{n^2}=\dfrac{4}{4n^2}{\lt}\dfrac{4}{4n^2 -1}=2\left(\dfrac{1}{2n -1}-\dfrac{1}{2n +1}\right)\),从第一项开始放缩,放缩的精度为\(S_n{\lt}2\cdot\dfrac{1}{2 -1}=2\).

    2. \(\dfrac{1}{n^2}{\lt}\dfrac{1}{n^2 -1}=\dfrac{1}{2}\left(\dfrac{1}{n -1}-\dfrac{1}{n +1}\right)(n\geq 2)\),从第二项开始放缩,放缩的精度为\(S_n{\lt}1+\dfrac{1}{2}\cdot(1+\dfrac{1}{2})=\dfrac{7}{4}\)

      保留前两项,从第三项开始放缩,放缩的精度为\(S_n{\lt}1+\dfrac{1}{2^2}+\dfrac{1}{3 -1}=\dfrac{5}{3}\).

    3. \(\dfrac{1}{n^2}{\lt}\dfrac{1}{n(n -1)}=\dfrac{1}{n -1}-\dfrac{1}{n}(n\geq 1)\),从第二项开始放缩,放缩的精度为\(S_n{\lt}1+\dfrac{1}{2 -1}=2\);保留前两项,从第三项开始放缩,放缩的精度为\(S_n{\lt}1+\dfrac{1}{2^2}+\dfrac{1}{3 -1}=\dfrac{7}{4}\).

    注:事实上,\(\sum\limits_{n = 1}^{\infty}\dfrac{1}{n^2}=\dfrac{\pi^2}{6}=1.6449...\)\(\sum\limits_{n = 1}^{\infty}\dfrac{1}{n^4}=\dfrac{\pi^4}{90}\)\(\sum\limits_{n = 1}^{\infty}\dfrac{1}{(2n - 1)^2}=\dfrac{\pi^2}{6}-\dfrac{\pi^2}{24}=\dfrac{\pi^2}{8}\)

  2. 等比放缩

    含有\(\dfrac{1}{a^n -1}\)的数列,可放缩为等比数列,也可以放缩后进行裂项.

    1. 等比数列前\(n\)项和的极限:构造等比数列\(\{b_n\}\),其首项为\(b_1\),公比为\(q\). 等比数列\(\{b_n\}\)的前\(n\)项和 \(T_n=\dfrac{b_1(1 - q^n)}{1 - q}\). 当\(q\in(0,1)\)时,则数列\(\{T_n\}\)中的项\(T_n\)会趋向某一定值,有\(\lim_{n\rightarrow+\infty}T_n=\dfrac{b_1}{1 - q}\),也称数列\(\{T_n\}\)收敛于\(\dfrac{b_1}{1 - q}\).

    2. 证明\(a_1 + a_2+\cdots+a_n{\lt}m\)\(m\)为常数)型数列不等式的思路:当待证不等式的一端为常数时,只需将另一端对应的数列通项进行恰当的放缩,变成等比数列,再通过求和达到证明的目的.

      \(a_1 + a_2+\cdots+a_n{\lt}b_1 + b_2+\cdots+b_n=\dfrac{b_1(1 - q^n)}{1 - q}{\lt}\dfrac{b_1}{1 - q}\leq m\)\(m\)为常数),其中\(\{b_n\}\)为递缩等比数列.

      通过逆向思维,由\(m=\dfrac{b_1}{1 - q}\)出发操作,先尝试对\(q\)进行适当的赋值,其中\(q\in(0,1)\),再确定出\(b_1\),从而求出\(b_n\),构造出数列\(\{b_n\}\),再证明\(a_n {\lt} b_n\)即可. 上述中构造的\(\{b_n\}\)并非唯一,因为\(q\)是任取的. 一般找底数大的,因为这样赋值,数列的收敛性会越好,精度就会越高,能更好地避免放缩过度. 为了变形化简方便,通常取\(a_n\)中幂的底数.

    3. \(\dfrac{1}{a - b}+\dfrac{1}{a^2 - b^2}+\cdots+\dfrac{1}{a^n - b^n}{\lt}m\)\(a{\gt}b\geq1\))型精度公式

      构造等比数列\(\{c_n\}\),其首项为\(c_1\),公比为\(q\). 要使\(\dfrac{1}{a - b}+\dfrac{1}{a^2 - b^2}+\cdots+\dfrac{1}{a^n - b^n}{\lt}c_1 + c_2+\cdots+c_n\leq m\)成立,令 \(q=\dfrac{1}{a}\),且\(m=\dfrac{c_1}{1 - q}\),则\(c_1=(1 - q)m=(1-\dfrac{1}{a})m\),于是\(c_n=(1-\dfrac{1}{a})m(\dfrac{1}{a})^{n - 1}=\dfrac{(a - 1)m}{a^n}\)

      即有\(\dfrac{1}{a^n - b^n}\leq c_n=\dfrac{(a - 1)m}{a^n}\)成立,只需\(\dfrac{a^n}{a^n - b^n}\leq(a - 1)m\)成立,只需\(\dfrac{a^n - b^n + b^n}{a^n - b^n}\leq(a - 1)m\),只需\(\dfrac{b^n}{a^n - b^n}\leq(a - 1)m - 1\),只需 \(\dfrac{1}{(\frac{a}{b})^{n}-1}\leq(a - 1)m - 1\),故\((\dfrac{a}{b})^{n}-1\geq\dfrac{1}{(a - 1)m - 1}\),于是可以得到\((\dfrac{a}{b})^{n}\geq1+\dfrac{1}{(a - 1)m - 1}\). 令\(f(n)=(\dfrac{a}{b})^{n}\),当\(a{\gt}b\geq1\)时,\(f(n)\)单调递增,只需上式中\(n = 1\)时成立即可,即有\(\dfrac{a}{b}\geq1+\dfrac{1}{(a - 1)m - 1}\),化简得\(m\geq\dfrac{a}{(a - b)(a - b)}\). 同样地,也可以得到\(n\geq2\)情形下的精度公式.

      综上所述,对于\(\dfrac{1}{a - b}+\dfrac{1}{a^2 - b^2}+\cdots+\dfrac{1}{a^n - b^n}{\lt}m\)\(a{\gt}b\geq1\))型放缩,可以得到下面的放缩精度公式: \(\varepsilon=\begin{cases} \dfrac{a}{(a - b)(a - 1)}\leq m,n = 1 \\ \sum\limits_{k = 1}^{n - 1}\dfrac{1}{a^{k}-b^{k}}+\dfrac{a}{(a^{n}-b^{n})(a - 1)}\leq m,n\geq2 \end{cases}\)

题型

等差、等比数列

题型 1. 等差数列的通项与前\(n\)项和

题型识别: 已知等差数列的首项、公差、若干项或前\(n\)项和,要求通项、项数、前\(n\)项和或参数.

核心思路: 将条件统一代入\(a_n=a_1+(n-1)d\)\(S_n=na_1+\dfrac{n(n-1)}{2}d=\dfrac{n(a_1+a_n)}{2}\). 已知项的下标差优先消去\(a_1\)\(d\).

解题步骤:

  1. 标出已知的是项、项数还是前\(n\)项和;

  2. 选择通项公式或求和公式列方程;

  3. 联立求\(a_1,d,n\)等未知量;

  4. 对项数作正整数检验,代回复核.

易错点:\(a_n\)\(S_n\)混淆;漏掉\((n-1)\);求项数后不检验是否为正整数.

题型 2. 等比数列的通项与前\(n\)项和

题型识别: 已知等比数列的首项、公比、若干项或前\(n\)项和,要求通项、求和或参数.

核心思路:\(a_n=a_1q^{n-1}\)\(S_n=\dfrac{a_1(1-q^n)}{1-q}\)\(q\ne1\))翻译条件;必须对\(q=1\)单独讨论.

解题步骤:

  1. 先判断公比\(q\)是否可能为\(1\)

  2. 用两个项或项与和建立关于\(a_1,q\)的方程;

  3. 求和时按\(q=1\)\(q\ne1\)分别处理;

  4. 对求得的\(q\)回代检查原数列条件.

易错点: 等比求和公式漏除以\(1-q\);不讨论\(q=1\);负公比下误判数列单调.

题型 3. 等差、等比数列性质的应用

题型识别: 条件给出等距项、下标和相等、项的乘积或和,要求求项、判断性质或证明等式.

核心思路: 等差数列中下标和相等则项和相等,等比数列中下标和相等则项积相等. 先将条件改写为以中项为中心的对称下标,常能避免直接求通项.

解题步骤:

  1. 观察下标是否满足\(m+n=p+q\)或成等差;

  2. 等差数列用\(a_m+a_n=a_p+a_q\),等比数列用\(a_ma_n=a_pa_q\)

  3. 对连续若干项可设中项或公差、公比简化;

  4. 需要证明时写明所用性质的下标条件.

易错点: 把等差的“和”性质套到等比;等比数列含零项时随意开方或约分;下标不满足对称条件仍强用性质.

数列通项

题型 1. 累加法求通项

题型识别: 递推式给出\(a_{n+1}-a_n=f(n)\),或经变形能写成相邻两项的差.

核心思路: 从初始项累加:\(a_n=a_1+\sum_{k=1}^{n-1}(a_{k+1}-a_k)\). 关键是先把递推式整理成可望远镜求和的差分形式.

解题步骤:

  1. 将递推式改写为\(a_{n+1}-a_n=f(n)\)

  2. \(k=1\)\(n-1\)逐项求和;

  3. 左侧望远镜相消为\(a_n-a_1\)

  4. 计算右侧求和并代入初值.

易错点: 求和上限写成\(n\)导致多一项;忘记初值;递推式适用范围从\(n=2\)开始时仍从\(1\)累加.

题型 2. 累乘法求通项

题型识别: 递推式给出\(\dfrac{a_{n+1}}{a_n}=g(n)\),或能化为相邻项比值,且相关项非零.

核心思路: 从初始项连乘:\(a_n=a_1\prod_{k=1}^{n-1}\dfrac{a_{k+1}}{a_k}\). 先确认分母不为\(0\),再将连乘积化为阶乘、裂项或已知乘积.

解题步骤:

  1. 整理出相邻项的比值,并确认可除;

  2. 写出从\(1\)\(n-1\)的连乘;

  3. 左侧约去中间项得到\(\dfrac{a_n}{a_1}\)

  4. 化简右侧乘积并代入初值.

易错点: 未验证\(a_n\ne0\)便相除;连乘上下限错位;阶乘化简漏掉首尾因子.

题型 3. 构造等差、等比数列求通项

题型识别: 递推式并非直接的差分或比值,但题目给出“证明某新数列为等差/等比”提示,或出现线性、倒数、平方根等结构.

核心思路: 依据递推结构构造\(b_n=\alpha a_n+\beta\)\(b_n=\dfrac{1}{a_n}\)\(b_n=f(a_n)\)等新数列,使其相邻差或比为常数,再还原\(a_n\).

解题步骤:

  1. 观察递推式中的平移、倒数、平方或线性分式结构;

  2. 按题目提示或待定系数设新数列;

  3. 验证\(b_{n+1}-b_n\)\(\dfrac{b_{n+1}}{b_n}\)为常数;

  4. \(b_n\)通项并反解\(a_n\),检查定义域.

易错点: 只猜构造不验证;反解时漏掉分母非零条件;新数列首项计算错误.

题型 4. 特征根与二阶递推

题型识别: 递推式形如\(a_{n+2}=pa_{n+1}+qa_n\),要求通项或证明数列性质.

核心思路: 先解特征方程\(r^2-pr-q=0\). 有两个不同根时构造\(\lambda^n\)\(\mu^n\)的线性组合;重根时需引入\(n\lambda^n\),再由初值确定系数.

解题步骤:

  1. 写出特征方程并求根;

  2. 按根的情形设通项形式;

  3. 代入\(a_1,a_2\)求待定系数;

  4. 将通项代回递推式或初值验证.

易错点: 特征方程常数项符号写反;重根时漏掉\(n\)因子;初值下标与通项指数不一致.

题型 5. \(a_n\)\(S_n\)的相互转化

题型识别: 条件同时出现通项\(a_n\)和前\(n\)项和\(S_n\),要求求通项、递推式、数列类型或参数.

核心思路: 利用\(a_n=S_n-S_{n-1}\)\(n\ge2\))和\(a_1=S_1\). 转化后必须分开讨论\(n=1\),因为直接相减公式不含\(S_0\)的题设信息.

解题步骤:

  1. 单独求出\(a_1=S_1\)

  2. \(n\ge2\)\(a_n=S_n-S_{n-1}\)

  3. 代入给定的\(S_n\)表达式化简;

  4. 检查通项在\(n=1\)处是否也成立,必要时分段写出.

易错点: 漏掉\(n=1\)的讨论;把\(S_n-S_{n+1}\)写反;由通项反求\(S_n\)时不从\(1\)累加.

数列求和

题型 1. 错位相减法

题型识别: 求和项为“等差数列乘等比数列”,如\(\sum (an+b)q^n\),或相邻项相乘后可消去大部分项.

核心思路:\(S_n\)为原和,将等式乘以公比\(q\)后错位相减,使含\(n\)的系数降次,最后求出\(S_n\).

解题步骤:

  1. 写出\(S_n\)的各项排列,确定等比部分公比\(q\)

  2. 写出\(qS_n\)并与\(S_n\)对齐相减;

  3. 整理中间保留的等比和与首尾项;

  4. 解出\(S_n\),必要时讨论\(q=1\).

易错点: 错位方向不一致;首尾多项或少项;相减后未正确处理最后一项的指数.

题型 2. 裂项相消法

题型识别: 通项含\(\dfrac{1}{n(n+1)}\)\(\dfrac{1}{\sqrt n+\sqrt{n+1}}\)、分式差或能拆成相邻两项之差的结构.

核心思路: 把每一项改写为\(f(n)-f(n+1)\)\(f(n+1)-f(n)\),再利用连续相消. 裂项后先写出前三项和末两项,避免边界遗漏.

解题步骤:

  1. 因式分解、配凑或有理化,寻找相邻指标结构;

  2. 写出裂项式并验证与原项相等;

  3. 展开有限项观察相消规律;

  4. 保留首尾未消项并代入上下限.

易错点: 裂项常数系数漏写;只写“相消”不列边界项;根式有理化时漏绝对值或定义域.

题型 3. 分组求和与奇偶分组

题型识别: 数列按若干项成组有相同结构,或通项随奇偶性变化,要求前\(n\)项和、范围或极限性质.

核心思路: 先按结构分组:奇数项与偶数项分开,或每\(k\)项一组. 重点是分别计算完整组数与最后不完整组,必要时按\(n\)的奇偶性分类.

解题步骤:

  1. 根据通项或递推识别周期、奇偶或固定组长;

  2. \(S_n\)拆为各组的和;

  3. 分别讨论\(n\)为不同余数类时的最后一组;

  4. 合并化简并检查小下标情形.

易错点: 将奇偶项个数都写成\(\dfrac n2\);最后一组漏项;分段通项的下标起点判断错误.

题型 4. 倒序相加法

题型识别: 求和项关于首尾下标对称,或正序与倒序相加后每组为常数、等比或易化简结构.

核心思路:\(S_n\)倒序书写后与原式相加或相乘,构造\(a_k+a_{n+1-k}\)\(a_ka_{n+1-k}\)的对称结构. 等差数列求和是其基本模型.

解题步骤:

  1. 写出正序和倒序的两行;

  2. 观察对应项的和或积是否恒定;

  3. 对两式相加或相乘,得到关于\(S_n\)的新方程;

  4. 解出并验证奇数项中间项未被重复处理.

易错点: 倒序下标写成\(n-k\);奇数项时漏掉中项;将相加法与相乘法混用.

递推、最值与综合

题型 1. 递推式分奇偶与跳跃递推

题型识别: 递推式含\((-1)^n\),或只联系\(a_{n+2}\)\(a_n\),要求通项、求和或证明性质.

核心思路: 奇数项、偶数项往往各自形成独立数列. 分别令\(b_k=a_{2k-1}\)\(c_k=a_{2k}\),把跳跃递推转为普通相邻递推,再分别求解.

解题步骤:

  1. 先列出前几项,判断奇偶项是否分离;

  2. 定义奇数子列与偶数子列;

  3. 将原递推分别改写为两子列的递推;

  4. 求出两组通项后按\(n\)奇偶合并,求和时再分组.

易错点: 奇偶子列初值取错;\(a_{n+2}\)递推仍按普通累加处理;合并通项时漏掉下标换元.

题型 2. 数列单调性与最大最小项

题型识别: 给出通项或递推式,要求判断单调性、找最大最小项、求最值或比较相邻项.

核心思路: 优先研究\(a_{n+1}-a_n\)的符号;正项数列也可研究\(\dfrac{a_{n+1}}{a_n}\)\(1\)的大小. 若符号随\(n\)变化,先求临界下标,再逐段判断.

解题步骤:

  1. 计算相邻差或比;

  2. 化为关于\(n\)的符号判断;

  3. 找出符号改变的临界整数附近;

  4. 比较临界项及相邻项,确定最大最小项.

易错点: 比值法未确认各项为正;只找实数临界点不比较邻近整数项;递推数列未先证明正性或范围.

题型 3. 数列放缩与不等式求和

题型识别: 求和式难以精确计算,题目要求估值、证明不等式、求范围或极限相关结论.

核心思路: 将通项放缩为可求和的裂项、等比项或积分式结构. 放缩方向必须和目标一致,且尽量控制误差,使上、下界足够接近.

解题步骤:

  1. 判断需要上界还是下界;

  2. 寻找可裂项、可比较的等比数列或经典不等式;

  3. 对每项建立方向一致的不等式后求和;

  4. 检查取等条件和放缩是否对全部\(n\)成立.

易错点: 不等式方向随取倒数、乘负数改变却未处理;只验证个别项;放缩过粗无法推出题目所需结论.

题型 4. 数列综合大题的特值探路与去添项

题型识别: 递推、证明、求和和不等式混合的大题,结构复杂,直接推一般项困难.

核心思路: 先计算前几项寻找周期、单调、等差等比或可裂项规律;对缺项或多项的和,通过加减适当项构造完整的可求和结构. 特值探路用于猜想,正式解答仍需证明.

解题步骤:

  1. 在定义域内列出前若干项或前若干个递推关系;

  2. 观察可构造的辅助数列、周期或可消去项;

  3. 用归纳、递推或恒等变形严格证明猜想;

  4. 在求和中明确写出添去的项及其补偿.

易错点: 把前几项规律当作证明;添项后忘记补回;只给结论不说明递推范围和初始条件.