Define skew lines. Using only vector approach, find the shortest distance between the following two skew lines:
![]()
![]()
Two lines that are neither parallel or nor intersecting, i.e. non-co-planer are skew lines.
We know, distance between two skew lines
and ![]()
is

Here,
![]()
![]()
And
![]()
Here,
![]()
![]()
![]()
![]()
![]()
And
![]()
![]()
And
![]()
Therefore,
![]()