Skip to content
Exercise 6.2 · Q18

Q.By computing the shortest distance, determine whether following lines intersect each other. r⃗=(i^−j^)+λ(2i^+k^)\vec{r} = (\hat{i} - \hat{j}) + \lambda(2\hat{i} + \hat{k}) and r⃗=(2i^−j^)+μ(i^+j^−k^)\vec{r} = (2\hat{i} - \hat{j}) + \mu(\hat{i} + \hat{j} - \hat{k})

Maharashtra MsbshseTextbookSubjectiveImportance★★★★★
12% · 18/145 Questions
🔒 Locked · start free trial →

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 →

Here a⃗1=i^−j^\vec a_1=\hat i-\hat j, b⃗1=2i^+k^\vec b_1=2\hat i+\hat k, a⃗2=2i^−j^\vec a_2=2\hat i-\hat j, b⃗2=i^+j^−k^\vec b_2=\hat i+\hat j-\hat k.

a⃗2−a⃗1=(2−1, −1+1, 0−0)=(1,0,0)\vec a_2-\vec a_1=(2-1,\ -1+1,\ 0-0)=(1,0,0)

b⃗1×b⃗2=∣i^j^k^20111−1∣=i^(0(−1)−1(1))−j^(2(−1)−1(1))+k^(2(1)−0(1))=−i^+3j^+2k^\vec b_1\times\vec b_2=\begin{vmatrix}\hat i&\hat j&\hat k\\2&0&1\\1&1&-1\end{vmatrix}=\hat i(0(-1)-1(1))-\hat j(2(-1)-1(1))+\hat k(2(1)-0(1))=-\hat i+3\hat j+2\hat k

(a⃗2−a⃗1)⋅(b⃗1×b⃗2)=1(−1)+0(3)+0(2)=−1≠0(\vec a_2-\vec a_1)\cdot(\vec b_1\times\vec b_2)=1(-1)+0(3)+0(2)=-1\ne0 …

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.