Home
Class 11
MATHS
.Find out whether the following pairs of...

.Find out whether the following pairs of lines are parallel, non-parallel & intersecting, or non-parallel & non-intersecting `hati_1 =hat i +hat j + 2hat k + lambda (3hat i-2hat j+4hat k) and r_2 =hat i +hat j + 3hat k + mu (-6hat i +4hat j-8hat k) `

Promotional Banner

Similar Questions

Explore conceptually related problems

Find out whether the following pairs of lines are parallel, non parallel, & intersecting, or non-parallel & non-intersecting. vec(r_(1)) = hat(i) - hat(j) + 3hat(k) + lambda(hat(i) - hat(j)+hat(k)) vec(r_(2)) = hat(i) - hat(j) + 3hat(k) + lambda(hat(i) - hat(j) + hat(k)) vec(r_(2)) = 2hat(i) + 4hat(j) + 6hat(k) + mu (2hat(i) + hat(j) + 3hat(k))

Find out whether the following pairs of lines are parallel, non parallel, & intersecting, or non-parallel & non-intersecting. vec(r_(1)) = hat(i) - hat(j) + lambda(hat(i) + 3hat(j) + 4hat(k)) vec(r_(2)) = 2hat(i) + 3hat(j) + mu(4hat(i) - hat(j) + hat(k))

vec r=(4hat i-hat j)+lambda(hat i+2hat j-3hat k) and vec r=(hat i-hat j+2hat k)+mu(2hat i+4hat j-5hat k)

Find the shortest distance between the lines vec r = (hat i + 2 hat j + hat k) + lambda (hat i - hat j + hat k) and vec r = ( 2 hat i - hat j - hat k) + mu ( 2 hat i + hat J + 2 hat k)

Find the shortest distance between the lines -> r=( hat i+2 hat j+ hat k)+lambda( hat i- hat j+ hat k) and -> r=2 hat i- hat j- hat k+mu(2 hat i+ hat j+2 hat k)

Find the shortest distance between the lines vec r=( hat i+2 hat j+ hat k)+lambda( hat i- hat j+ hat k) and vec r=2 hat i- hat j- hat k+mu(2 hat i+ hat j+2 hat k)

Find the shortest distance between the lines vec r=( hat i+2 hat j+ hat k)+lambda( hat i- hat j+ hat k) and vec r=(2 hat i- hat j- hat k)+mu(2 hat i+ hat j+2 hat k)

Find the shortest distance between lines -> r=6 hat i+2 hat j+ hat k+lambda( hat i-2 hat j+2 hat k) and -> r=-4 hat i- hat k+mu(3 hat i-2 hat j-2 hat k) .

Shortest distance between the lines: vec r=(4hat i-hat j)+lambda(hat i+2hat j-3hat k) and vec r=(hat i-hat j+2hat k)+u(2hat i+4hat j-5hat k)

Find the shortest distance (S.D.) between the lines : vec r = hat i + hat j + lambda (2 hat i- hat j + hat k) and vec r = 2 hat i + hat j- hat k + mu (3 hat i - 5 hat j + 2 hat k) .