Animated Solution for Mathematics - Three Dimensional Geometry: The shortest distance between the lines 4x−3=−11y+7=5z−1 and 3x−5=−6y−9=1z+2 is:
Select Answer:
Visualized Solution
Visualizing the Skew Lines
Shortest distance between two skew lines L1 and L2.
Skew lines are non-parallel and non-intersecting lines in 3D space.
The shortest distance is the length of the common perpendicular segment.
Extracting Parameters for Line 1
Line 1: 4x−3=−11y+7=5z−1
Point on L1: a1=(3,−7,1)
Direction of L1: b1=(4,−11,5)
Extracting Parameters for Line 2
Line 2: 3x−5=−6y−9=1z+2
Point on L2: a2=(5,9,−2)
Direction of L2: b2=(3,−6,1)
Vector Joining the Two Points
Vector joining points: a2−a1
=(5−3,9−(−7),−2−1)
=(2,16,−3)
The Common Perpendicular Direction
Shortest distance is along the common perpendicular vector n.
n=b1×b2
Setting up the Determinant
b1×b2=i^43j^−11−6k^51
Calculating the i^ component
i^ component: (−11)(1)−(5)(−6)
=−11+30=19
Calculating the j^ component
−j^ component: (4)(1)−(5)(3)
=−(4−15)=11
Calculating the k^ component
k^ component: (4)(−6)−(−11)(3)
=−24+33=9
b1×b2=19i^+11j^+9k^
Magnitude of the Normal Vector
∣b1×b2∣=192+112+92
=361+121+81
=563
The Shortest Distance Formula
S.D.=∣b1×b2∣∣(a2−a1)⋅(b1×b2)∣
Calculating the Dot Product
Numerator: ∣(2,16,−3)⋅(19,11,9)∣
=∣38+176−27∣
=187
Final Result
S.D.=563187
The correct option is (B).
00:00 / 00:00
The Sigma Insight: Shortest Distance Between Two Skew Lines
Solution Diagram
The Geometry of the Infinite
Conquering Skew Lines
Imagine you are standing in a vast, three-dimensional void. You see two infinite lines stretching out into the distance. They are not parallel, yet they never cross.
These are skew lines, and they represent one of the most elegant challenges in 3D geometry. Today, we are going to find the shortest distance between them using the vector tools that define our universe.
Phase 1
Extracting the DNA of the Lines
Every line in 3D space has a unique signature: a point it passes through and a direction it follows.
For our first line, L1:4x−3=−11y+7=5z−1, we extract a point a1=(3,−7,1) and a direction vector b1=(4,−11,5).
For our second line, L2:3x−5=−6y−9=1z+2, we find a point a2=(5,9,−2) and a direction vector b2=(3,−6,1).
Notice how we carefully flip the signs in the numerators to find the coordinates of the points. This is the foundation of our journey.
Phase 2
The Bridge Between Worlds
To find the shortest distance, we must bridge the gap between these two lines. We start by creating a vector that connects a point on L1 to a point on L2:
a2−a1=(5−3,9−(−7),−2−1)=(2,16,−3)
This vector represents the displacement between our two starting points. Now, we need the direction of the shortest path, which must be perpendicular to both lines.
We invoke the power of the cross product: n=b1×b2. We set up our determinant:
n=i^43j^−11−6k^51
Expanding this, we calculate the components:
i^ component: (−11)(1)−(5)(−6)=−11+30=19j^ component: −((4)(1)−(5)(3))=−(4−15)=11
* k^ component: (4)(−6)−(−11)(3)=−24+33=9
Thus, our normal vector is n=19i^+11j^+9k^.
Phase 3
The Final Projection
The shortest distance is the projection of our connecting vector a2−a1 onto the normal vector n. The formula is:
S.D.=∣n∣∣(a2−a1)⋅n∣
First, let's find the magnitude of the normal vector:
Putting it all together, the shortest distance is:
S.D.=563187
This is the precise, calculated gap between two infinite paths in space. You have successfully navigated the 3D landscape and emerged with the correct answer.