This sequence can be defined by the recursive
function a, = 1 and a, = an-1 + n. Assuming the
pattern continues, how many blocks will there be
when n = 7?

18

step-by-step explanation:

ik this stuph and i am smart donkey

deez nu tz

step-by-step explanation:

guess at question:

a vertical line intersects the graph of g(x,y) = 0 at two points. what conclusion follows about the function f(x) implicitly defined by g(x,f(x)) = 0?

the domain of f(x) cannot include the x coordinate of any such vertical line.

informally, f(x) is not a function, and

g(x,y)=0 cannot be solved for y uniquely.

the relation r = {(x,y) such that g(x,y) = 0} is a function if

for all (a,b) ∊ r and (c,d) ∊ r, a=c implies b=d.

step-by-step explanation: