Q.Find the shortest distance between the lines whose vector equations are r=(1−t)i^+(t−2)j^+(3−2t)k^ and r=(s+1)i^+(2s−1)j^−(2s+1)k^
🔒You're viewing a preview — the full solution, concept, methods & PYQ mapping are locked.
🔒 Start your 14-day free trial to unlock the full solution →Concept understanding — Skew Lines
Skew Lines
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.
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:
d=∣b1×b2∣∣(a2−a1)⋅(b1×b2)∣. …
Concept: Shortest distance between two skew lines — we rewrite each line in standard form r=a+λb, then apply the formula
d=∣b1×b2∣∣(b1×b2)⋅(a2−a1)∣.
Step 1: Identify direction vectors and points.
First line: r=i^−2j^+3k^+t(−i^+j^−2k^), so
a1=i^−2j^+3k^, b1=−i^+j^−2k^.
Second line: r=i^−j^−k^+s(i^+2j^−2k^), so
a2=i^−j^−k^, b2=i^+2j^−2k^.
Step 2: Compute b1×b2.
b1×b2=i^−11j^12k^−2−2=(−2+4)i^−(2+2)j^+(−2−1)k^=2i^−4j^−3k^.
Magnitude: ∣b1×b2∣=4+16+9=29. …
Writing each line as r=a+λd, the shortest distance =∣d1×d2∣∣(a2−a1)⋅(d1×d2)∣=298 units.
Rewrite each line in point–direction form:
L1: a1=i^−2j^+3k^,d1=−i^+j^−2k^,
L2: a2=i^−j^−k^,d2=i^+2j^−2k^.
Cross product of the direction vectors:
d1×d2=i^−11j^12k^−2−2=2i^−4j^−3k^,∣d1×d2∣=4+16+9=29.
Vector joining a point on each line:
a2−a1=0i^+j^−4k^. …
Method: Shortest distance when lines are given in collapsed parametric form
Sometimes a line is written as a single position vector whose components each contain the parameter, e.g. r=(1−t)i^+(t−2)j^+(3−2t)k^. Before any distance work, split it into the standard a+λb shape.
Steps
Step 1: Separate constants from the parameter. Group the parameter-free terms into the point a and the coefficients of the parameter into the direction b:
r=(1−t)i^+(t−2)j^+(3−2t)k^=(i^−2j^+3k^)+t(−i^+j^−2k^).
Do this for both lines to obtain a1,b1 and a2,b2.
Step 2: Cross the directions — b1×b2 and its magnitude. …
Common Mistakes
Mistake 1: Working directly with the collapsed form without splitting into point and direction.
Why it's wrong: r=(1−t)i^+(t−2)j^+(3−2t)k^ must first become (i^−2j^+3k^)+t(−i^+j^−2k^); reading a "vector" straight from the raw components mixes point and direction. Correct approach: group the parameter-free part as a and the t-coefficients as b.
Mistake 2: Mis-signing the second line's k^ coefficient. …
- AP EAPCET 2026Set eng-2026-05-13-FN1 markMCQQ.The shortest distance between the two lines r=(i−j)+s(j+2k) and r=(2i+k)+t(i−j+k) is (A) 4 (B) 5 (C) 56 (D) 78
›Reveal solutionSolution
Using the standard skew-line shortest-distance formula d=∣d1×d2∣∣(B−A)⋅(d1×d2)∣ gives d=8/7.
Concept and Intuition
For two skew (non-intersecting, non-parallel) lines, the shortest distance is the length of the projection of the vector joining any two points on the lines onto the common perpendicular direction d1×d2.
Step-by-Step Solution
- Line 1: point A=(1,−1,0), direction d1=(0,1,2) (coefficients of s).
- Line 2: point B=(2,0,1), direction d2=(1,−1,1) (coefficients of t).
- d1×d2=i01j1−1k21=i(1⋅1−2⋅(−1))−j(0⋅1−2⋅1)+k(0⋅(−1)−1⋅1)=(3,2,−1).
- ∣d1×d2∣=9+4+1=14.
- B−A=(1,1,1); (B−A)⋅(3,2,−1)=3+2−1=4. …
- AP EAPCET 2025Set eng-2025-05-23-FN1 markMCQQ.If iˉ+jˉ−kˉ, −iˉ+2jˉ+kˉ, jˉ+2kˉ, 2iˉ−jˉ+2kˉ are the position vectors of four points A, B, C, D respectively, then the shortest distance between the lines AB and CD is (A) 61 (B) 37 (C) 31 (D) 67
›Reveal solutionSolution
The shortest distance between two skew lines is ∣d1×d2∣∣(connecting vector)⋅(d1×d2)∣ — compute the two direction vectors, their cross product, and project the vector joining a point on each line onto that cross product's direction.
Concept and Intuition
Two lines in space that don't intersect and aren't parallel are "skew," and the shortest segment between them is perpendicular to both simultaneously — i.e. along their common perpendicular direction d1×d2. The formula projects the vector connecting any point on line 1 to any point on line 2 onto this common-perpendicular unit vector; the magnitude of that projection is the shortest distance.
Step-by-Step Solution
- Position vectors: A=iˉ+jˉ−kˉ, B=−iˉ+2jˉ+kˉ, C=jˉ+2kˉ, D=2iˉ−jˉ+2kˉ.
- Direction of line AB: d1=B−A=(−1−1,2−1,1−(−1))=(−2,1,2).
- Direction of line CD: d2=D−C=(2−0,−1−1,2−2)=(2,−2,0).
- Connecting vector: C−A=(0−1,1−1,2−(−1))=(−1,0,3).
- Cross product d1×d2: …
- AP EAPCET 2025Set eng-2025-05-24-FN1 markMCQQ.Assertion (A): For the lines rˉ=aˉ+tbˉ and rˉ=pˉ+sqˉ, if (aˉ−pˉ).(bˉ×qˉ)=0, then the two lines are coplanar Reason (R): ∣(aˉ−pˉ).(bˉ×qˉ)∣ is ∣bˉ×qˉ∣ times the shortest distance between the lines rˉ=aˉ+tbˉ and rˉ=pˉ+sqˉ. (A) (A) is true, (R) is true and (R) is correct explanation to (A) (B) (A) is true, (R) is true and (R) is not the correct explanation to (A) (C) (A) is true, (R) is false (D) (A) is false, (R) is true
›Reveal solutionSolution
Tests the coplanarity/skew-lines condition and the shortest-distance formula; (A) is false while (R) is true, so the answer is (D).
Concept and Intuition
For two lines rˉ=aˉ+tbˉ and rˉ=pˉ+sqˉ, the vector bˉ×qˉ is perpendicular to both direction vectors, so it points along the common perpendicular between the lines. Projecting the vector (aˉ−pˉ) joining a point on each line onto this common-perpendicular direction gives the shortest distance between the lines:
d=∣bˉ×qˉ∣∣(aˉ−pˉ)⋅(bˉ×qˉ)∣.
The lines are coplanar exactly when this shortest distance is zero, i.e. when (aˉ−pˉ)⋅(bˉ×qˉ)=0 — not when it's nonzero.
Step-by-Step Solution
- Recall the coplanarity criterion: lines are coplanar ⟺(aˉ−pˉ)⋅(bˉ×qˉ)=0.
- Assertion (A) states the lines are coplanar when this quantity is nonzero — this is the exact opposite of the correct criterion (a nonzero value signals skew lines). So (A) is false. …
- AP EAPCET 2024Set eng-2024-05-19-AN1 markMCQQ.The shortest distance between the skew lines rˉ=(−iˉ−2jˉ−3kˉ)+t(3iˉ−2jˉ−2kˉ) and rˉ=(7iˉ+4kˉ)+s(iˉ−2jˉ+2kˉ) is (A) 15 (B) 0 (C) 9 (D) 16
›Reveal solutionSolution
Apply the standard skew-line shortest-distance formula using the cross product of the direction vectors and the vector joining the two given points; the distance works out to 9.
Concept and Intuition
Two skew lines have a unique common perpendicular direction, given by dˉ1×dˉ2. The shortest distance between them is the length of the projection of the vector joining any point on one line to any point on the other, onto this common perpendicular direction.
Step-by-Step Solution
- Line 1: point aˉ1=(−1,−2,−3), direction dˉ1=(3,−2,−2).
- Line 2: point aˉ2=(7,0,4), direction dˉ2=(1,−2,2).
- dˉ1×dˉ2=iˉ31jˉ−2−2kˉ−22=iˉ(−4−4)−jˉ(6+2)+kˉ(−6+2)=−8iˉ−8jˉ−4kˉ.
- ∣dˉ1×dˉ2∣=64+64+16=144=12. …
- AP EAPCET 2024Set eng-2024-05-21-AN1 markMCQQ.The shortest distance between the skew lines rˉ=(2iˉ−jˉ)+t(iˉ+2kˉ) and rˉ=(−2iˉ+kˉ)+s(iˉ−jˉ−kˉ) is (A) 732 (B) 73 (C) 143 (D) 144
›Reveal solutionSolution
Using the standard skew-line shortest-distance formula with the given point/direction vectors gives 6/14, which simplifies to 32/7. Answer: (A).
Concept and Intuition
The shortest distance between two skew lines is measured along the unique common perpendicular to both direction vectors. If dˉ1×dˉ2 gives that common perpendicular direction, then projecting the vector joining any two points on the lines onto this direction gives the distance:
d=∣dˉ1×dˉ2∣∣(aˉ2−aˉ1)⋅(dˉ1×dˉ2)∣.
Step-by-Step Solution
- Read off the data: Line 1 passes through aˉ1=2iˉ−jˉ=(2,−1,0) with direction dˉ1=iˉ+2kˉ=(1,0,2). Line 2 passes through aˉ2=−2iˉ+kˉ=(−2,0,1) with direction dˉ2=iˉ−jˉ−kˉ=(1,−1,−1).
- Compute dˉ1×dˉ2=iˉ11jˉ0−1kˉ2−1=iˉ(0⋅(−1)−2⋅(−1))−jˉ(1⋅(−1)−2⋅1)+kˉ(1⋅(−1)−0⋅1)=(2,3,−1).
- ∣dˉ1×dˉ2∣=22+32+(−1)2=14.
- aˉ2−aˉ1=(−2−2,0−(−1),1−0)=(−4,1,1).
- Dot product: (−4)(2)+(1)(3)+(1)(−1)=−8+3−1=−6. …
- AP EAPCET 2021Set eng-2021-08-20-FN1 markMCQQ.If the lines 2x−3=3y−2=λz−1 and 3x−2=2y−3=3z−2 are coplanar, then Sin−1(sinλ)+Cos−1(cosλ)= (A) 8−2π (B) 6−π (C) 3π−8 (D) 4π−8
›Reveal solutionSolution
Coplanarity of the two lines forces λ=4; reducing sin−1(sin4)+cos−1(cos4) to principal ranges gives 3π−8.
Concept and Intuition
Two lines (given in symmetric form) are coplanar exactly when the vector joining a point on each is coplanar with (i.e., has zero scalar triple product with) their direction vectors. This yields a linear equation in λ. Once λ is a concrete number (in radians), sin−1(sinλ) and cos−1(cosλ) must be reduced to their principal-value ranges using the periodicity/reflection rules, since λ=4 radians lies outside [−π/2,π/2] and [0,π] respectively.
Step-by-Step Solution
- Points: P1=(3,2,1) on line 1, P2=(2,3,2) on line 2. Directions: d1=(2,3,λ), d2=(3,2,3).
- Coplanarity condition: (P2−P1)⋅(d1×d2)=0, where P2−P1=(−1,1,1).
- d1×d2=(3⋅3−λ⋅2, −(2⋅3−λ⋅3), 2⋅2−3⋅3)=(9−2λ, 3λ−6, −5).
- Dot with (−1,1,1): −1(9−2λ)+1(3λ−6)+1(−5)=−9+2λ+3λ−6−5=5λ−20.
- Set to zero: 5λ−20=0⇒λ=4 (radians, since it plays the role of an angle argument next). …
🎓Unlock everything free for 14 days
- ✓Full step-by-step solutions
- ✓Concept-first explanations
- ✓Methods, shortcuts & mistakes
- ✓PYQ mapping + timed mock tests
Full access for 14 days. No credit card required.