1) Equations for two lines L1 and L2 are given. Find the angle between L1 and...

1) Equations for two lines L1 and L2 are given. Find the angle between L1 and L2.

L1: ? = 7 + 2?, ? = 8 − 4?, ? = −9 + ?

L2: ? = −8 − ?, ? = 3 − 3?, ? = 4 + 3?

2) Find polar form of complex number z :

?) ? = 4√3 − 4?

?) ? = 2√3 − 2i

Expert Solution

milcah answered 2 years ago

(a) Find the cosine of the angle between the lines L1 and L2 whose vector equations are given below:

(a) Find the cosine of the angle between the lines L1 and L2 whose vector equations are given below: L1 : ~r1(t) = [1, 1, 1] + t[1, 2, 3] L2 : ~r2(t) = [1, 1, 1] + t[−1, 4, 2]. (b) Find the equation of the plane that contains both L1 and L2.

For the Poincare plane, find two lines L1 and L2 and a point P off each...

For the Poincare plane, find two lines L1 and L2 and a point P off each such that through P there are exactly two lines parallel to both L1 and L2.

Given two sorted lists L1 and L2, write a procedure to compute L1∪L2 using only the...

Given two sorted lists L1 and L2, write a procedure to compute L1∪L2 using only the basic list operations. Pseudo-code is acceptable.

Find the distance between the skew lines given by the following parametric equations: L1: x=2t y=4t...

Find the distance between the skew lines given by the following parametric equations: L1: x=2t y=4t z=6t L2: x=1-s y=4+s z=-1+s

The intersection of two lists L1 and L2, L1 ∩ L2, is defined as the list...

The intersection of two lists L1 and L2, L1 ∩ L2, is defined as the list containing elements in both L1 and L2 only. Given two sorted lists L1 and L2, write a function, called intersection, to compute L1 ∩ L2 using only the basic list operations. The intersection function is defined as follows template list intersection( const list & L1, const list & L2); C++

Given two sorted lists, L1 and L2, write an efficient C++ code to compute L1 ∩...

Given two sorted lists, L1 and L2, write an efficient C++ code to compute L1 ∩ L2 using only the basic STL list operations. What is the running time of your algorithm?

1. Write a Racket function (set-equal? L1 L2) that tests whether L1 and L2 are equal....

1. Write a Racket function (set-equal? L1 L2) that tests whether L1 and L2 are equal. Two sets are equal if they contain exactly the same members, ignoring ordering (or in other words, two sets are equal if they are a subset of each other). For example (set-equal? '(1 (2 3)) '((3 2) 1)) ---> #t (set-equal? '(1 2 3) '((3 2)1)) ---> #f (set-equal? '(1 2 3) '((1 2 3))) ---> #f 2. Two common operations on sets are...

Find the distance between the skew lines with the given parametric equations. x = 2 +...

Find the distance between the skew lines with the given parametric equations. x = 2 + t, y = 3 + 6t, z = 2t x = 1 + 4s, y = 5 + 15s, z = -2 + 6s.

Recall that given a line L1 in the plane with slope m, a second line L2...

Recall that given a line L1 in the plane with slope m, a second line L2 is perpendicular to L1 if and only if the slope of L2 is − 1 m . Now consider the function h(x) = x^2 + 3/2x + 3. Among all of the lines tangent to the graph of h(x), there is exactly one which is perpendicular to the line given by y = −2x + 7. Write the equation of that line tangent to...

Find the distance between the skew lines with parametric equations x = 1 + t, y...

Find the distance between the skew lines with parametric equations x = 1 + t, y = 3 + 6t, z = 2t, and x = 1 + 2s, y = 6 + 15s, z = −2 + 6s. Find the equation of the line that passes through the points on the two lines where the shortest distance is measured.

Question