2024 H2 Mathematics Paper 1 Question 12

Vectors II: Lines and Planes

Answers

(a)
(i)

(5315,5215,115).

(ii)

No.

(b)

k∈ℝ+, k≠325.

(c)

θ=72.7∘.

(d)
(i)

2.35 km.

(ii)

Not the shortest distance.

Full Solutions

(a)
(i)

Let TT(0,0,0.1) denote the position of the control tower, A(4,3,1) denote a point on the path of the aircraft and F denote the point when the aircraft is at its closest point to the air traffic controllers.

AT→=OT→−OA→=(000.1)−(431)=(−4−3−0.9)
AF→=(AT→⋅𝐝^)𝐝^=((−4−3−0.9)⋅(1−12)|(1−12)|)(1−12)|(1−12)|=(−4)(1)+(−3)(−1)+(−0.9)(2)6(1−12)=−715(1−12)
AF→=OF→−OA→−715(1−12)=OF→−(431)OF→=−715(1−12)+(431)=115(53521)

Coordinates of F=(5315,5215,115)∎

(ii)
TF→=OT→−OF→=(000.1)−(53155215115)=130(106104−1)
|TF→|=|130(106104−1)|=13022053=4.9501>4

Hence the air traffic controllers will not see this aircraft.

(b)

Let l1 and l2 represent the paths of the aircraft and drone respectively.

l2:𝐫=(32−1k)+μ(321−1)

We observe that l1 and l2 are not parallel since their direction vectors are not scalar multiples of each other.

Now assuming that the paths intersect,

(4+λ3−λ1+2λ)=(32+32μ−1+μk−μ)

4+λ=32+32μ3−λ=−1+μ1+2λ=k−μ

From (1),

λ−32μ=−52

From (2),

λ+μ=4

Solving (4) and (5) with a GC,

λ=75,μ=135

Since the paths do not intersect, considering equation (3),

1+2(75)≠k−(135)k≠325

Hence the possible values of k are: k∈ℝ+, k≠325∎

(c)

Let θ denote the acute angle between the paths of the aircraft and the drone

|(1−12)⋅(321−1)|=|(1−12)||(321−1)|cos⁡θ|(1)(32)+(−1)(1)+(2)(−1)|=12617cos⁡θcos⁡θ=3617θ=72.7∘∎
(d)
(i)

Let B and C denote the points (4,3,1) and (4.2,0.8,0.2) respectively

BC→=OB→−OC→=(431)−(4.20.80.2)=(−0.22.20.8)
Distance=|BC→|=|(−0.22.20.8)|=2.3495=2.35 km (3 s.f.)∎
(ii)

Let 𝐝1 and 𝐝2 denote the direction vectors of the paths of the aircraft and the drone respectively

BC→⋅𝐝1=(−0.22.20.8)⋅(1−12)=(−0.2)(1)+(2.2)(−1)+(0.8)(2)=−0.8≠0
BC→⋅𝐝2=(−0.22.20.8)⋅(321−1)=(−0.2)(32)+(2.2)(1)+(0.8)(−1)=1.1≠0

Hence BC is not perpendicular to either l1 or l2, so the distance found in (d)(i) is not the shortest distance between the two paths ∎