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:
Step-by-step explanation:
we know that
The area of the shaded region is equal to the area of the sector minus the area of the triangle
step 1
Find the area of the circle
the area of the circle is equal to
we have
substitute
step 2
Find the area of the sector
we know that
The area of the circle subtends a central angle of 360 degrees
so
by proportion find out the area of a sector by a central angle of 72 degrees
step 3
Find the area of triangle
The area of the triangle is equal to
step 4
Find the area of the shaded region
Subtract the area of the triangle from the area of the sector
Answer:
3 hours and 21 miinutes
Step-by-step explanation:
Answer:
400 < m< 430 kg
Step-by-step explanation:
the mass of horse is 429 kg
estimated to the nearest hundred is 400 kg
estimated to the nearest tens is 430 kg
thus the value of m mass lies between 400 to 430
therefore
400 < m< 430 kg
Step-by-step explanation:
take the base square. find the diagonal
16^2+16^2 = 2*16^2= d^2
d= 16√2
half of the diagonal will form the baSe of right triangle of hypotenuse 10. but the base will be 8√2 which is greater than 10. so I feel the slant hr has to be different and more than 10
