General term formula of sequence

Mathematical calculation formula
Collection
zero Useful+1
zero
In a certain order array Is called series , while the sequence {a n }The nth term of is expressed by a specific formula (including parameter n), which is called General formula It's like function Of Analytic expression Similarly, the corresponding a can be obtained by substituting specific n values n The value of the item. The solution to the general term formula of the sequence is usually obtained through several transformations of its recursive formula [1]
Chinese name
General term formula of sequence
Foreign name
Sequence of general term formula
Category
formula
Scope of application
Mathematical calculation

Solution

Announce
edit

Arithmetical sequence

For a sequence {a n }, if the difference between any two adjacent terms is a constant, then the number sequence is an equal difference number sequence, and the difference of a certain value is called a tolerance, which is recorded as d; From the first item a one To item n a n Sum of, recorded as S n
Then, the general formula is
Its solution is very important, and the idea of "superposition principle" is used:
formula
Add the n-1 formulas above, and many related terms will be eliminated successively equation Remaining a on the left n On the right, a remains one And n-1 d, so we can get the general formula above.
In addition, the sum of the first n terms of the sequence
The specific derivation method is relatively simple. The above similar superposition method can be used, and the iterative method can also be used. I will not repeat it here.
It is worth noting that,
, that is, the sum S of the first n items n Divide by n to get a one It is a new sequence with d/2 as the first term and tolerance n The problem of sequence of numbers can be easily solved.

Proportional sequence

For a sequence {a n }, if the quotient of any two adjacent terms (that is, the ratio of the two) is a constant, then the number sequence is an equal ratio sequence, and this constant value quotient is called a common ratio q; From the first item a one To item n a n Sum of, recorded as T n
Then, the general formula is
(i.e. a one Multiply by the (n-1) power of q, which is derived as the idea of "the principle of continuous multiplication":
a two =a one * q,
a three = a two * q,
a four = a three * q,
````````
a n =a n-1 * q,
Multiply the above (n-1) terms, delete the corresponding terms from the left to the right, and the remaining a on the left n , remaining a on the right one And the product of (n-1) q, that is, the general term formula [2]
In addition, when q=1, the sum of the first n terms of the sequence
When q ≠ 1, the sum of the first n terms of the sequence
=

First order sequence

Announce
edit

concept

It is better to include a in the recurrence formula of the sequence n And a n+1 Is called first-order sequence. Obviously, the recurrence formula of the arithmetic sequence is
a n =a n-1 +D, while the recurrence formula of the proportional sequence is a n =a n-1 * q ; These two can be regarded as special cases of first order sequence. Therefore, the first order can be defined recursive sequence The form is: a n+1 = A *a n +B ···········⊙, where A and B are constant coefficients. So, Arithmetical sequence It is a special case of A=1, and Proportional sequence This is a special case of B=0.

thinking

Basic ideas and methods: compound deformation is a basic sequence (equal difference and equal ratio) model; Stacking elimination; Successive elimination [3]
Idea 1: Original formula composition (proportional form)
Can make a n+1 - ζ = A * (a n -ζ) ········· ① is the deformed form of the original formula ⊙, that is, the value of ζ is calculated by using the method of undetermined coefficient, and a is obtained after sorting out the formula ① n+1 = A*a n +ζ - A * ζ, this formula can be compared with the original formula,
ζ - A*ζ = B
That is, ζ=B/(1-A)
After replacement, order b n =a n -ζ. Then formula ① becomes b n+1 =A*b n , that is, it is converted into a one -ζ) As the first item, take A as Common ratio Of Proportional sequence , we can find b n The general term formula of {a n }The general formula of.
Idea 2: Elimination compound (elimination B)
By a n+1 = A *a n +B ···········⊙ Yes
a n = A* a n-1 +B ··········◎
Formula ⊙ minus formula ◎ gives a n+1 - a n = A *( a n - a n-1 )······③
Order b n = a n+1 - a n After that, formula ③ becomes b n = A*b n-1 Proportional sequence, b can be found n The general formula of, and then get a n - a n-1 =
(of which
Is a function of n), and then use the superposition method to find a n

Second order sequence

Announce
edit

concept

By analogy with the concept of first-order recursive sequence, we can define a n+2 、a n+1 、a n The recurrence formula of is a second order sequence, and it is obviously more difficult to find the general formula of such sequence than the first order sequence. In order to facilitate the transformation, we can first interpret the simple form of the second order sequence like this [4]
a n+2 = A * a n+1 +B * a n , (Similarly, A, B constant coefficients)

thinking

The basic idea is similar to the first order, except that the undetermined coefficient and the corresponding term should be observed when compounding
Original formula compounding: the original formula is deformed to form a n+2 - ψ * a n+1 = ω (a n+1 - ψ * a n )
Comparing this formula with the original formula, we can get
ψ+ω=A and - (ψ * ω)=B
The values of ψ and ω can be obtained by solving these two equations,
Order b n = a n+1 - ψ*a n , the original formula becomes b n+1 = ω *b n Proportional sequence, b can be found n General formula b n = f (n) ,
That is, a n+1 - ψ*a n =F (n) (where f (n) is a function of n), and this formula just combines the definition of first order sequence, that is, it only contains a n+1 And a n Two sequence variables, so as to achieve "order reduction", turn "second order" into "first order", and then solve.

Common types

Announce
edit

Summation

The recurrence formula is
, and f (n) can be summed
Example: sequence {a n }, meet a one =1/2,a n+1 = a n + 1/(4n two -1) , find {a n }General formula
Solution: a n+1 = a n + 1/(4n two -1)=an+[1/(2n-1)-1/(2n+1)]/2
∴a n = a one +(1-1/3+1/3-1/5+……+1/(2n-3)-1/(2n-1))
∴a n = 1/2+1/2 (1-1/(2n-1) )=

Cumulative multiplication

The recurrence formula is
And f (n) is quadratable
Example: sequence {a n }Satisfied
, and a one =4, find a n
Solution:
a n = 2n(n+1)

Tectonic method

Convert the unequal difference sequence and proportional sequence into related equal difference proportional sequence
  1. one
    Appropriate operation deformation example: {a n }Medium, a one =3 and a n+1 = a n two , find a n Solution: ln a n+1 = ln a n two = 2 ln a n ∴{ln a n }Is an equal ratio sequence, where the common ratio q=2, and the first term is ln3 ∨ ln a n = (2 n-1 )Ln3 fault
  2. two
    Reciprocal transformation method (applicable to a n+1 = A*a n / (B*a n +C), where A, B, C ∈ R) [5] Example: {a n }Medium, a one =1,a n+1 = a n / ( 2a n +1) Solution: 1/a n+1 = ( 2a n +1 ) / a n = 1/a n +2∴{1/a n }Is an arithmetic sequence, the first item is 1, and the tolerance is 2 ∨ a n = 1 / (2n-1)
  3. three
    Method of undetermined coefficient A. The recurrence formula is a n+1 = p*a n +Q (p, q are constants), and the recursive sequence {a n +X} is an equal ratio sequence with p as the common ratio, that is, a n+1 + x=p*(a n +x) Where x=q/(p-1) (or the set formula can be taken apart and equal to the original formula) Example: {a n }Medium a one =1,a n+1 = 3a n +4, find a n Solution: a n+1 + 2 = 3(a n +2)∴{a n +2} Is the first item of the proportional sequence is 3, and the common ratio is 3 ∨ a n = 3 n -2B. The recurrence formula is a n+1 = p*a n + q n (p, q are constants) Conventional deformation, divide both sides by q at the same time n+1 Get a n+1 / q n+1 = (p / q)*( a n /q n )+1/q re order b n = a n / q n , we can get b n+1 = k*b n +M (where k=p/q, m=1/q), then use the method mentioned in A above to solve C. The recurrence formula is a n+2 = p*a n+1 +q*a n , (p, q are constants) can make a n+2 =x two , a n+1 = x , a n =1 Solve x one And x two , we can get two formulas a n+1 - x 1 * a n = x 2 * (a n - x 1 * a n-1 )a n+1 - x 2 * a n =x 1* (a n - x 2* a n-1 )Then, subtract the two formulas, and the left side can be obtained (k is the coefficient). The right side can be obtained by using the method of proportional sequence, for example: {a n }Medium, a one =1, a two =2, a n+2 = (2/3)a n+1 =(1/3) a n Solution: x two = 2x/3 = 1/3x one =1,x two =-1/3 can get equation group a n+1 - a n = - (1/3)* (a n - a n-1 )a n+1 +(1/3)* a n = a n + (1/3)*a n-1 Solve a n =7/4 - 3/4 × (- 1/3) ^ (n-1) D. Recursive formula a n+1 = p* a n + a n +B (a, b, p are constants) can be transformed into a n+1 + x n+1 +y = p*(a n + x n +Y) Then compare with the original formula, we can get x, y, that is, we can get {a n +x n +y} It is an equal ratio sequence with p as the common ratio. For example: {a n }Medium, a one =4, a n =3a n-1 +2n-1 (n ≥ 2) solution: original formula=a n + n+1= 3 [a n-1 + (n-1)+1]∴{a n +N+1} is an equal ratio sequence, q=3, and the first term is 6 ∨ a n = 2×3 n - n - 1
  4. four
    The recurrence formula of characteristic root method is a n+1 = (A*a n +B) / (C*a n +D) (A, B, C, D are constants) Let a n+1 = a n =X, the original formula is x=(Ax+B)/(Cx+D) (1) If the solution is the same real root x zero , the sequence {1/(a n -x zero )}For example: {a n }Meet a one = 2,a n+1 = (2a n -1)/(4a n +6) , find a n Solution: x=(2x-1)/(4x+6) zero = - 1/21/(a n +1/2)=1/[(2a n-1 -1)/(4a n-1 +6) +1/2]=1/[a n-1 + 1/2] +1∴{1/(a n +1/2)} is an arithmetic sequence, d=1, the first term is 2/5 ∨ an=5/(5n-3) - 1/2 (2) If the solution yields two different real roots x one ,x two , construct {(a n - x one )/(a n - x two )}Is the proportional sequence (x one ,x two The position of is not in order, and can be changed) Example: {a n }Meet a one = 2,a n+1 = (a n +2)/(2a n +1) Solution: According to the question, (a n -1)/(a n +1)=-1/3 [a n-1 - 1]/[a n-1 +1] then {(a n -1)/(a n +1) } is an equal ratio sequence, q=- 1/3, the first term is 1/3 ∨ a n = [1 + (-1) n-1 (1/3) n ] / [1 - (-1) n-1 (1/3) n ](3) If there is no real root, this sequence may be a periodic sequence, for example: {a n }Medium, a one =2, meet a n+1 = a n-1 / a n (n ≥ 2) Solution: a one = 2 , a two = 1/2 , a three = -1 , a four = 2 , a five =1/2...... So a n =2 (n MOD 3=1), 1/2 (n MOD3=1), - 1 (n MOD3=0)

Add, subtract

Example: {a n }Meet a ₁+2a ₂+3a ∨+......+na n = n(n+1)(n+2)
Solution: Order b n = a₁+ 2a₂+ 3a₃+……+ na n = n(n+1)(n+2)
na n = b n - b n-1 = n(n+1)(n+2)-(n-1)n(n+1)
∴a n = 3(n+1)