Course home

3.7 Recurrence Relations

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24

Question 19

In a digital signal processing loop, the gain factors $G_n$ follow a recurrence relation defined by:

G_1 = 0.8 \quad \text{and} \quad G_{n+1} = \frac{2}{G_n}, \quad n \ge 1

Calculate the values of $G_2$ , $G_3$ , and $G_4$ .

[3]

Identify the period of this sequence.

[1]

Evaluate the sum of the first 61 gain factors, $∑n=161Gn\sum_{n=1}^{61} G_n$ .

[3]

Markscheme

3.7 Recurrence Relations Questions

A Level
Maths
3.7 Recurrence Relations

35 exam-style questions on Edexcel A Level Maths 3.7 Recurrence Relations. Each one has a worked solution and a mark scheme showing where the marks go.

3.7 Recurrence Relations

Question bank

3.7 Recurrence Relations

Easy Medium

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24

Question 19

In a digital signal processing loop, the gain factors $G_n$ follow a recurrence relation defined by:

G_1 = 0.8 \quad \text{and} \quad G_{n+1} = \frac{2}{G_n}, \quad n \ge 1

Calculate the values of $G_2$ , $G_3$ , and $G_4$ .

[3]

Identify the period of this sequence.

[1]

Evaluate the sum of the first 61 gain factors, $∑n=161Gn\sum_{n=1}^{61} G_n$ .

[3]

Markscheme

3.7 Recurrence Relations Questions

A Level
Maths
3.7 Recurrence Relations

35 exam-style questions on Edexcel A Level Maths 3.7 Recurrence Relations. Each one has a worked solution and a mark scheme showing where the marks go.