If a sequence is defined recursively by f (0) = 2 and

f (n + 1) = - 2f (n) + 3 for n ≥ 0, then f (2) is equal to

Question

Kale Mahoney

Mathematics

Today, 01:36

If a sequence is defined recursively by f (0) = 2 and

f (n + 1) = - 2f (n) + 3 for n ≥ 0, then f (2) is equal to

+1

Answers (1)

Know the Answer?

Dangelo Mann · Answer 1

If you would like to know how much is f (2), you can calculate this using the following steps:

f (0) = 2

f (n+1) = - 2 * f (n) + 3

f (1) = - 2 * f (0) + 3 = - 2 * 2 + 3 = - 4 + 3 = - 1

f (2) = - 2 * f (1) + 3 = - 2 * (-1) + 3 = 2 + 3 = 5

The correct result would be f (2) = 5.

If a sequence is defined recursively by f (0) = 2 andf (n + 1) = - 2f (n) + 3 for n ≥ 0, then f (2) is equal to

If a sequence is defined recursively by f (0) = 2 and

f (n + 1) = - 2f (n) + 3 for n ≥ 0, then f (2) is equal to