Describe an algorithm to compute the smallest tiling path of x.
1 answer:
You might be interested in
Answer:
(C)x=11.6, y=23.2
Step-by-step explanation:
Using Theorem of Intersecting Secant and Tangent
Applying this theorem in the diagram, we have:
Next, we apply Theorem of Intersecting Chords
PV X VQ=SV X VR
4 X x= 2 X y
Recall earlier we got: x=11.6
2y=4 X 11.6
2y=46.4
Divide both sides by 2
y=46.4/2=23.2
Therefore: x=11.6, y=23.2
The slope of the given line is -2, and since perpendicular lines have negative reciprocal slopes, the slope of the line we want to find is 1/2.
Substituting into point-slope form,
