Answer:
Time machine one = 3.56
Time machine two = 4.56
Step-by-step explanation:
Let machine 2 do the job in x hours
Let machine 1 do the job in x - 1 hours.
The general formula for this problem is
Time = A*B/(A + B)
Givens
Time = 2 hours
B = x hours alone
A = x - 1 hours alone.
#################
x *( x - 1)
======= = 2
(x + x - 1)
(x^2 - x)/(2x - 1) = 2
x^2 - x = 2(2x - 1)
x^2 - x = 4x - 2
x^2 - 5x + 2 = 0
a = 1
b = - 5
c = 2
This gives 2 roots
x = 4.56
x = 0.43
The second root will not work because when 1 is subtracted from 0.43 the time give will be minus, which won't work.
Time for machine 2 is 4.56
The time for machine 1 is 3.56
Check
(A * B)/(A + B) = 2
A = 4.56
B = 3.56
Time = 4.56*3.56/(4.56 + 3.56)
Time = 16.2336/(8.12)
Time = 1.9992
The rounding error in the check comes from the rounding error in the times.
Answer:
x = 16
Step-by-step explanation:
The sum of measures of these three angles of any triangle is equal to 180 °
54 + 90 + (2x + 4) = 180
144 + 2x + 4 = 180
148 + 2x = 180
2x = 180 - 148
2x = 32
Answer:
The height of the spanning tree is one by the breadth-first search at the central vertex of Wn.
Step-by-step explanation:
The graph is connected and has a spanning tree where the tree can build using a depth-first search of the graph. Start with chosen vertex, the graph as the root, and root add vertices and edges such as each new edge is incident with vertex and vertices are not in path. If all vertices are included, it will do otherwise, move back to the next level vertex and start passing. It is for depth-first search. For breadth-first search, start with chosen vertex add all edges incident to a vertex. The new vertex is added and becomes the vertices at level 1 in the spanning tree, and each vertex at level 1 adds each edge incident to vertex and other vertex connected to the edge of the tree as long as it does not produce.
Answer:
8(3-(-1)) = 32
Step-by-step explanation:
I can't see the following you miss of didn't pin it I think....
