Asequence is defined by the recursive function f(n + 1) = one-halff(n). if f(3) = 9 , what is f(1) ?

81

Step-by-step explanation:

For the recursive function, f(n+1) = one-half(n)

Thus, when n = 2,

f(3) = 9

If n = 1,

f(2) = 9×3

f(2) = 27

If n = 0,

f(1) = 27 ×3

f(1) = 81

walter needs to make at least 5 more cookies but no more than 40. 5 ≥ x ≥ 40;

step-by-step explanation:

walter has to make a minimum of 20 cookies. he already has 15 cookies made, so he must make 5 more to meet the minimum.

the maximum amount of cookies he can make is 55. he already has 15, so he has to make no more than 40 more cookies to meet the maximum.

14.3

step-by-step explanation:

add all the numbers together.

9 + 12 + 15 + 16 + 17 + 17 = 86

now, divide 86 by how many numbers we have: 6.

86 / 6 = 14.3