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:
5 pounds
Step-by-step explanation:
Answer:
She needs to sell for 64 more hours
Step-by-step explanation:
Answer:
32 miles
Step-by-step explanation:
Given data
Let the total distance be x miles
Marks speed= 16miles per hour
Trisha's speed= 12 miles per hour
Trisha has covered 8 miles and has (x-8) miles to finish line
We know that
Speed= distance/time
time= distance/speed
Hence the time taken for Mark to finish is
time= x/16---------------1
The time taken for Trisha to finish is
time= (x-8)/12-----------2
equate 1 and 2 above
x/16= (x-8)/12
cross multiply
16(x-8)= 12*x
16x-128= 12x
collect like terms
16x-12x= 128
4x=128
x= 128/4
x= 32 miles
Hence they will meet at exactly 32 miles along the way
We can use Triangle Inequality Theorem, the length of the third side of a triangle must always be between (but not equal to) the sum and the difference of the other two sides.
4.1 - 1.3 < x < 4.1 + 1.3
2.8 < x < 5.7
so, the answer is 2.8 < x < 5.7
