8x-4=-32 so thats an equation that you can use
Answer:
B
Step-by-step explanation:
this is a rate of time, 60 must be multiplied by the hours to get the days
Answer:
a) ok, heres what u graph, and ur ordered pairs
graph the following points:
(0,0) (1,5) (2,10) (3,15) (4,20) (5,25) (6,30) (7,35), and so on
b) One of the ordered pairs I can use is (1,5). This is beacuse the ordered pair explains that for every video game (x), 5 will be the cost (y).
The variables are the number of handbags and the time.
By inspection, it's clear that the sequence must converge to

because

when

is arbitrarily large.
Now, for the limit as

to be equal to

is to say that for any

, there exists some

such that whenever

, it follows that

From this inequality, we get




As we're considering

, we can omit the first inequality.
We can then see that choosing

will guarantee the condition for the limit to exist. We take the ceiling (least integer larger than the given bound) just so that

.