Which is a recursive formula for the sequence 50, 54, 58, 62, …? A. an=4n+46
B. {a1=50an=an−1+4, where n≥2
C. an=4n+50
D. {a1=46an=an−1+4, where n≥2​

step-by-step explanation:

hans did not square the 40-unit side; he merely multiplied it by 2.   incorrect.

so firstly, we need to isolate the y variables to be able to solve these inequalities. firstly, add 0.5x on both sides of the first inequality and subtract 1.5x on both sides of the second inequality:

now since the slope is positive for the first inequality, this means that the line going upwards belongs to the first inequality, and the line going downwards belongs to the second inequality.

next, since y ≥ in the first inequality, this means that the shaded region will be above the first inequality's line, thus shading regions a and b.

next, since y ≤ in the second inequality, this means that the shaded region is going to be below this line, thus shading regions a and c.

since both lines shade region a, this means that region a is the solution.

step-by-step explanation:

mark brainliest!

answer:   b

step-by-step explanation:

x2 = 16

x can not be a negative number because 16 is positive

the only answer would be positive 8  

c

step-by-step explanation: