In a plane, two straight lines have only two possibilities: they meet, or they are parallel. In three dimensions a third possibility appears — lines that neither meet nor run parallel. These are skew lines.
What Makes Lines Skew
Two lines in space are skew if they are not parallel and do not intersect. The deeper reason is that skew lines do not lie in the same plane — they are non-coplanar. Parallel lines and intersecting lines always share a plane; skew lines never do.
Note
A classic picture: one edge along the top of a room and a different edge along the floor, running in a different direction. Extend them forever and they still never touch, yet they are clearly not parallel.
The Three Cases in Space
Lines
Directions
Do they meet?
Coplanar?
Intersecting
different
yes, at one point
yes
Parallel
same (proportional)
no
yes
Skew
different
no
no
How to Test for Skew Lines
Take two lines r=a1+λb1 and r=a2+μb2.
Not parallel:b1 and b2 are not proportional (so b1×b2=0).
Do not intersect: no values of λ,μ make the points coincide.
Both conditions are captured by one scalar triple product. The lines are skew exactly when
(a2−a1)⋅(b1×b2)=0.
If this value is zero, the lines are coplanar (they intersect or are parallel); if it is non-zero, they are skew.
Shortest Distance Between Skew Lines
Because skew lines miss each other, there is a well-defined shortest distance between them, measured along their common perpendicular:
The shortest distance between two skew lines is the length of the common perpendicular. Using the formula d=∣b1×b2∣∣(b1×b2)⋅(a2−a1)∣, we find the distance is 14 units.
Concept First: Why This Formula Works
Two lines in 3D that are not parallel and do not intersect are called skew lines. The shortest distance between them is the length of the line segment that is perpendicular to both lines simultaneously — this is the common perpendicular.
Think of it geometrically:
Each line has a direction vector (b1 and b2).
The cross product b1×b2 gives a vector perpendicular to both directions.
If you take any point A on the first line and any point B on the second line, the vector AB will have a component along this perpendicular direction.
The length of that component is exactly the shortest distance.
d=∣b1×b2∣∣(b1×b2)⋅(a2−a1)∣
Where a1 and a2 are position vectors of points on the two lines, and b1, b2 are their direction vectors.
Step-by-Step Solution
1. Identify the vectors from the given equations
First line: r=(8+3λ)i^−(9+16λ)j^+(10+7λ)k^
Rewrite in standard form r=a1+λb1:
a1=8i^−9j^+10k^
b1=3i^−16j^+7k^
Second line: r=15i^+29j^+5k^+μ(3i^+8j^−5k^)
So:
a2=15i^+29j^+5k^
b2=3i^+8j^−5k^
2. Find the vector connecting a point on each line
Use this for the shortest distance between two lines that are neither parallel nor intersecting.
Steps
Step 1: Put both lines in point + direction form.
From each r=a+λb, read a point (a1,a2) and a direction (b1,b2). If a line is written as (8+3λ)i^−…, group the constant part and the λ-part component by component to recover a and b.
Step 2: Build the common-perpendicular direction.
Compute b1×b2; it is perpendicular to both lines. (If it is 0 the lines are parallel and this method does not apply — use the parallel-line formula instead.)
Mistake 1: Reading a and b wrongly from a line written as (8+3λ)i^−(9+16λ)j^+….
Why it's wrong: the constant parts form a1=(8,−9,10) and the λ-coefficients form b1=(3,−16,7); mixing them corrupts everything downstream. Correct approach: group constant vs λ terms component by component, minding the leading minus on j^.
Mistake 2: Dropping the modulus in the numerator.
Why it's wrong: the triple product can be negative, but a distance cannot. Correct approach: take ∣(a2−a1)⋅(b1×b2)∣, giving ∣1176∣/84=14. …