The recursive formula for an arithmetic sequence is f(n+1)=f(n)+4; f(0)=-2

which of the following equations are linear models for this sequence? select all that apply.

a
y=4x-2

b
y=-2x+4

c
f(n)=-2n+4

d
f(n)=4n-2

B

y=-2x+4

C

f(n)=-2n+4

Step-by-step explanation:

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

-3

step-by-step explanation:

a drawing really does here:

so i draw the horizontal line y=2 and the vertical line x=-2 at this intersection i put b (this is where my right angle is going to be).   so point b is at (-2,2).   point a is 5 units long and is also on y=2 so this point has to be (3,2) or (-7,2) -doesn't matter i will go with (3,2).

now we know c is at (-2,y) we don't know the y yet bet we know that c is on x=-2.

we have the area of the triangle is .5bh=12.5

we know the base length is 5 (ab)

we have the height is (2-y) if you look at your

plug in

.5(5)(2-y)=12.5

solve for y to get the y-coordinate for c

2.5(2-y)=12.5

divide both sides by 2.5 giving:

2-y=5

now subtract 2 on both sides

-y=3

y=-3