A bicycle chain is pulled tightly so that mn is a common tangent of the gears?
2 answers:
Answer: hi your question is incomplete here is the complete question and the diagram attached
A bicycle chain is pulled tightly so that mn is a common tangent of the gears?
find the distance between the centers of the gear
Answer : 17.8 inches
Explanation:
Applying Pythagorean theorem
considering MN a tangent we will have to find x from the schematic diagram attached
H = 4.3 - 1.8 = 2.5
=
therefore X ( distance between center of gears ) = ≈ 17.8 inches
attached to this solution is a free hand diagram of the bicycle chain illustration
Question: The question is incomplete. The bicycle chain diagram wasn't attached to your question. Find attached of the diagram and the answer.
A bicycle chain is pulled tightly so that mn is a common tangent of the gears. Find the distance between the centers of the gears.
Answer: The distance between the centers of the gears is 17.8 in
Explanation:
From the attached file, using Pythagoras theorem to find the value of x, we have;
h = 4.3 - 1.8
= 2.5
x² = MN² + h²
x² = 17.6² +2.5²
x² = 309.76 + 6.25
x² = 316.01
x = √316.01
x = 17.8
Therefore, the distance between the centre of the gear is 17.8 in
You might be interested in
Answer:
They should operate Mine 1 for 1 hour and Mine 2 for 3 hours to meet the contractual obligations and minimize cost.
Explanation:
The formulation of the linear programming is:
Objective function:
Restrictions:
- High-grade ore:
- Medium-grade ore:
- Low-grade ore:
- No negative hours:
We start graphing the restrictions in a M1-M2 plane.
In the figure attached, we have the feasible region, where all the restrictions are validated, and the four points of intersection of 2 restrictions.
In one of this four points lies the minimum cost.
Graphically, we can graph the cost function over this feasible region, with different cost levels. When the line cost intersects one of the four points with the lowest level of cost, this is the optimum combination.
(NOTE: it is best to start with a low guessing of the cost and going up until it reaches one point in the feasible region).
The solution is for the point (M1=1, M2=3), with a cost of C=$680.
The cost function graph is attached.
