Lesson 8.01a-c
8.01a-c Recurrence relations and properties of sequences Quiz: OCR Further Maths, Unit 5
20 questions
In partnership with Revision Ninja
Lesson 8.01a-c, Recurrence relations and properties of sequences: 20 multiple choice questions for the OCR Further Maths (H245), Unit 5: Additional Pure Mathematics (Y545), written with Revision Ninja.
Host it live on the board and students join with a game code on their own devices, or revise alone with Free Play. The answers are revealed in the game.
The 20 questions
-
What is the auxiliary equation for the recurrence relation u_{n+2} - 5u_{n+1} + 6u_n = 0?
- λ² - 5λ + 6 = 0
- λ² + 5λ + 6 = 0
- λ² - 5λ - 6 = 0
- 6λ² - 5λ + 1 = 0
-
What is the general solution if an auxiliary equation has distinct real roots α and β?
- (A + Bn) αⁿ
- A αⁿ βⁿ
- A αⁿ + B n βⁿ
- A αⁿ + B βⁿ
-
What is the general solution if an auxiliary equation has a repeated real root α?
- (A + B) αⁿ
- (A + Bn) αⁿ
- A αⁿ + B n²
- A αⁿ + B αⁿ
-
What form does the real solution take when auxiliary roots are complex numbers r e^{±iθ}?
- rⁿ (A cos nθ + B sin nθ)
- (A + Bn) rⁿ cos nθ
- rⁿ (A cos θ + B sin θ)
- A rⁿ cos nθ
-
What is the general solution to the recurrence relation u_{n+2} - 4u_{n+1} + 4u_n = 0?
- (A + Bn) 4ⁿ
- (A + Bn) 2ⁿ
- A 4ⁿ + B 1ⁿ
- A 2ⁿ + B (-2)ⁿ
-
Given the recurrence relation u_{n+1} = 3u_n + 2 with u_1 = 1, what is u_3?
- 17
- 53
- 14
- 5
-
Which condition defines a sequence u_n as periodic with period k?
- u_{n+1} = k u_n
- u_{n+k} = 0
- u_{n+k} = u_n
- u_{nk} = u_n
-
What is the period of the sequence defined by u_1 = 2 and u_{n+1} = 1/u_n?
- 2
- 1
- 3
- 4
-
For u_{n+1} - 2u_n = 5(3ⁿ), what trial particular solution should be used?
- k 2ⁿ
- k n 3ⁿ
- k + 3ⁿ
- k 3ⁿ
-
Which inequality defines a strictly increasing sequence u_n for all positive integers n?
- u_{n+1} < u_n
- u_{n+1} ≥ u_n
- u_{n+1} = u_n + 1
- u_{n+1} > u_n
-
What are the roots of the auxiliary equation for u_{n+2} - u_{n+1} - 6u_n = 0?
- 1 and -6
- -3 and 2
- 3 and -2
- 6 and -1
-
What is the general solution of the recurrence relation u_{n+2} - 7u_{n+1} + 12u_n = 0?
- A 7ⁿ + B 12ⁿ
- (A + Bn) 3ⁿ
- A 3ⁿ + B 4ⁿ
- A (-3)ⁿ + B (-4)ⁿ
-
For u_{n+2} - 5u_{n+1} + 6u_n = 2n + 1, what trial particular solution form is appropriate?
- kn + c
- kn² + c
- k
- k 2ⁿ + c
-
What condition on auxiliary roots α and β ensures u_n → 0 as n → ∞?
- α β < 1
- α < 1 and β < 1
- α + β < 0
- |α| < 1 and |β| < 1
-
What trial particular solution should be used for u_{n+1} - 2u_n = 2ⁿ?
- k 2ⁿ
- k n 2ⁿ
- k 2ⁿ⁺¹
- k n + 2ⁿ
-
What is the constant particular solution to the recurrence relation u_{n+1} - 3u_n = 8?
- -2
- 8
- -4
- 4
-
What is the least upper bound of the sequence u_n = n/(n+1) for n ≥ 1?
- 0
- Infinity
- 1
- 2
-
What is the general solution of the recurrence relation u_{n+2} + u_n = 0?
- A cos(nπ/2) + B sin(nπ/2)
- (A + Bn) iⁿ
- A 1ⁿ + B (-1)ⁿ
- A cos(nπ) + B sin(nπ)
-
What is the explicit formula for u_n given u_1 = 2 and u_{n+1} = u_n + 5?
- 5ⁿ⁻¹ + 2
- 5n + 2
- 2n + 3
- 5n - 3
-
If u_n = kn satisfies u_{n+1} - u_n = 4 for all n, what is k?
- 2
- 1
- 8
- 4
Related quizzes
- Fibonacci numbers, solving recurrences and modelling Quiz · 8.01e-i · 20 questions
- Number bases and divisibility Quiz · 8.02a-d · 20 questions
- Finite (modular) arithmetic and prime numbers Quiz · 8.02e-i · 20 questions
- Euclid's lemma, Fermat's little theorem and the binomial theorem Quiz · 8.02k-o · 20 questions
- Binary operations and the definition of a group Quiz · 8.03a-c · 20 questions
- Orders of elements, subgroups, cyclic groups and generators Quiz · 8.03e-h · 20 questions
- Structure of finite groups, Lagrange's theorem and isomorphism Quiz · 8.03i-m · 20 questions
- Vector product Quiz · 8.04a · 20 questions
- Surfaces, sections, contours and partial derivatives Quiz · 8.05a-d · 20 questions
- Stationary points and tangent planes Quiz · 8.05e-g · 20 questions