a. This recurrence is of order 2.
b. We're looking for a function
such that

Take the recurrence,

Multiply both sides by
and sum over all integers
:

Pull out powers of
so that each summand takes the form
:

Now shift the indices and add/subtract terms as needed to get everything in terms of
:


Solve for
:

c. Splitting
into partial fractions gives

Recall that for
, we have

so that for
and
, or simply
, we have

which means the solution to the recurrence is

d. I guess you mean
and
, in which case

e. We already know the general solution in terms of
and
, so just plug them in:

Hi there!
»»————- ★ ————-««
I believe your answer is:

»»————- ★ ————-««
Here’s why:
⸻⸻⸻⸻
I am assuming that '3=x divided by 3' is supposed to be
.
⸻⸻⸻⸻
The first, second, and fourth equations have x divided by a number. To isolate x, we would have to use the multiplication property of equality.
⸻⸻⸻⸻
For the third one (
), the variable 'x' is being subtracted by 6. We would have to use the addition property of equality to isolate x.
⸻⸻⸻⸻
»»————- ★ ————-««
Hope this helps you. I apologize if it’s incorrect.
Answer: <
Explantion:

, because you factor the 5 into 10 and 4 so

The second one you want will be integers.
I dont know the coordinates because i dont feel like putting them in right now buttttt........
main street bus equation is y=2x+40
County bus line equation is y=3x+20
thats all i've got.