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: {11, -11}
Step-by-step-explanation: To solve for <em>x</em> in this equation, since <em>x</em> is squared, we simply take the square root of both sides of the equation to get <em>x</em> by itself.
It's important to remember however that when taking the square root of both sides of an equation, we always use <em><u>plus</u></em> or <em><u>minus</u></em>.
In other words in this problem, since x² = 121,
<em>x = + or - 11</em>.
A common mistake is to say that <em>x</em> is just equal to 11. But notice that if you plug a -11 back into the original equation, it also checks.
So our answer to this problem is {11, -11}.
It should be 8 < n < 11
I hope it helps
YOU'RE WELCOME :D
b = 21
In this problem, we aren't finding the hypotenuse, but a side...
Using Pythagoras' theorem
side² = hyp² – side²
b² = 29² – 20²
b² = 841 – 400
b² = 441
b² = √441
b = 21
Therefore b = 21