Question 4 of 5 Drag the tiles to the correct boxes to complete the pairs. Not all tiles will be used
Match each explicit formula to its corresponding recursive formula.
(8) = 5(5)(1-1)
(n) = 3 +5(n-1)
(3) = 5+3(1-1)
7(n) = 3(5)(n-1)
$(n) = 5 +5(n-1)
f(1) = 5
(*) = 3;(n - 1), for 3
(1) = 5
(n) = f(n-1) +5, for n?
f(1) = 5
f(n) = f(n-1) + 3, for n?

Given:

The recursive formulae.

To find:

The correct explicit formulae for the given recursive formulae.

Solution:

If the recursive formula of a GP is , then the explicit formula of that GP is:

Where, a is the first term and r is the common ratio.

The first recursive formula is:

for .

It is the recursive formula of a GP with a=5 and r=3. So, the required explicit formula is:

Therefore, the required explicit formula for the first recursive formula is .

If the recursive formula of an AP is , then the explicit formula of that AP is:

Where, a is the first term and d is the common difference.

The second recursive formula is:

for .

It is the recursive formula of an AP with a=5 and d=5. So, the required explicit formula is:

Therefore, the required explicit formula for the second recursive formula is .

The third recursive formula is:

for .

It is the recursive formula of an AP with a=5 and d=3. So, the required explicit formula is:

Therefore, the required explicit formula for the third recursive formula is .

f(x) is going down by 4

step-by-step explanation:

(its either that or its going left by 4)

can i know which language is this?