Question

Find the recursive definition for this sequence:

11, 24, 37, 50, 63, ...
A. f(0) = 13. f(n) = f(n + 11)

Answer 1

D. f(0) = 11, f(n) = f(n-1) +13

Explanation:

You want the recursive definition for the sequence ...

11, 24, 37, 50, 63, ...

First term

The first term is 11. This means the initial value for the recursive definition will be 11:

f(0) = 11 . . . . . eliminates choices A and B

Common difference

Each term of a recursive sequence is defined in terms of previous terms. That is, f(n) will be defined in terms of f(n-1). Here, the previous term has 13 added to it. (11 +13 = 24, for example).

The remaining part of the recursive definition is ...

f(n) = f(n -1) +13 . . . . . eliminates choice C

The recursive definition is ...

• f(0) = 11
• f(n) = f(n-1) +13

<95141404393>