H(n) = -10 + 12n
Complete the recursive formula of h(n).
h(1) =
h(n) = h(n-1)+

h(n) = h(n - 1) + 12

Step-by-step explanation:

Generate the first few terms using the explicit formula

h(1) = - 10 + 12 = 2

h(2) = - 10 + 24 = 14

h(3) = - 10 + 36 = 26

h(4) = - 10 + 48 = 38

This is an arithmetic sequence. To find a term in the sequence add 12 to the previous term, thus

h(n) = h(n - 1) + 12 with h(1) = 2

c

step-by-step explanation:

a.) list the factors of 40.

1/2/4/5/8/10/20/40

b.) list the factors of 40 that represent the number of cans that could be on each shelf.

5

c.) how many different arrangements of cans are possible?

just one because if you put more on one shelf you will go way over 40 and the cabinet will probably break.

d.) what are the possible arrangements of the cans?

put 5 cans on each self to reach 40 cans in total.

e.) which arrangement uses all the shelves?

5 because you can put 5 cans on each shelf, and since there are 8 shelfs you are equally going to get 40 cans.