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

answer: what if i dont want to show my work boi.

step-by-step explanation: im watching dbz and eating popcorn leave meh alone

answer: evaluate the objective function at each vertex to determine which - and -values, if any, maximize or minimize the function. example: find the minimum value and maximum value of the objective function f ( x , y ) = 4 x + 5 y , subject to the following constraints