Answer:
1) How does "Abe" relate to the merry-go-round? (The problem doesn't seem to say.)
2) How many people did each person provide for? So how many dozens were brought? How many are in a dozen? So how many cookies were brought?
Step-by-step explanation:
nm the top
There are n seats on a merry- go-round. A boy takes n rides. Between each ride, he moves clockwise a certain number of places to a new horse. Each time he moves a different number of places. Find all n for which the boy ends up riding each horse.
2) So if there are n horses, first the boy could move by one place then he could move by n+1 places then by 2n+1 so on and so forth, until he moves (n−2)n+1 places, in which case he'd would have been ridden each horse only one time and taken unique number of steps, which implies that all n's satisfy given condition.
1) I don't know how to cancer this let me resheerch and ill get back to you
P>S let this be help only if you need to annotate or reword thx
Let’s make them both slope intercept equations (y = mx + b)
-5x + 2y = 5
2y = 5 + 5x
y = 5/2x + 5
5x - 2y = -5
5x = 2y - 5
2y = 5 + 5x
y = 5/2x + 5
Same results, therefore the equations are the same.
Solution: infinite solutions
Answer:
There is not enough info
Step-by-step explanation:
Answer:
Y= -2x - 1
Step-by-step explanation:
Substitute -2 for m, which is slope, and -1 for b, which is y intercept