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
Answer:
They would never intersect because they are parallel lines. You can tell they are parallel lines because they have the same slope and they have a different y-intercept. However, this doesn't mean that there was no solutions, there were, thats how i was able to tell what their slopes and y-intercepts were. So if there is an answer that you can choose from that explains that they won't intersect because they are parallel then that is the correct answer. It may be C, but I would see if there is another option.
Formula:
x + 2(x+1) = 17
x + 2x + 2 = 17
3x + 2 = 17
3x = 15
x = 5
So, the answer is 5 and 6
Hope this helped!
Answer:
f(x) = x - 3
Step-by-step explanation:
y = mx + b
first let's find b, the y-intercept
based on the graph, the y-intercept is (0,-3), so b = -3
immediately, we can eliminate f(x) = 3 - x and f(x) = -3x
comment any questions pls
Answer:
10,404/334,084
Step-by-step explanation:
Given the polynomial
289r^2 - 102r + c
We are to find the value of c that will make it a perfect square
Divide through by 289
289r²/289 - 102r/289 + c/289
Half of the coefficient of r is 1/2(102/289)
Half of the coefficient of r = 102/578
Square the result
r² = (102/578)²
r² = 10,404/334,084
Hence the required constant is 10,404/334,084