Answer is (n + 3) + (n - 7)
Simplified to 2n - 4
Using “n” for number
T = 4
divide each term by 2 and simplify
2(t+1)/2 = 10/2
t+1 = 10/2
t+1=5
t=5-1
t=4
The 1st choice (x - 9, y - 3) is the correct answer.
Take any of the corresponding coordinate points to find the rule that represents the translation:
D —> D’
(3, 5) —> (-6, 2)
(3 - 9, 5 - 3) = (-6, 2)
Counting the units from graph also shows this translation rule, seeing that hexagon DEFGHI moved 9 units to the left and 3 units down.
Hope this helps :)
7+13+1.5=21.5
If he did it again the way back, it's 21.5 times 2.
He went a total of 43 blocks.
An Euler path, in a graph or multi graph, is a walk through the graph which uses every edge exactly once. An Euler circuit is an Euler path which starts and stops at the same vertex. Our goal is to find a quick way to check whether a graph (or multi graph) has an Euler path or circuit.
hope it helps
