Start Learning Free

Before You Begin

Question #41729

Difficulty: 8/10 | 🟢 Free

The Question

Let LL be a line passing through the point P(1,2,3)P(1, 2, 3) with direction cosines l,m,nl, m, n. Let Q(x,y,z)Q(x, y, z) be any point on LL and rr be the distance between PP and QQ. Suppose that for all points QQ on LL, the coordinates satisfy the relation ∣x−1∣+2∣y−2∣+2∣z−3∣=3r|x - 1| + 2|y - 2| + 2|z - 3| = 3r Let SS be the set of all such lines LL. If a line L∈SL \in S intersects the plane x+2y+2z=20x + 2y + 2z = 20 at a point RR, let dLd_L be the distance PRPR. Find the maximum value of dLd_L as LL varies over SS.

Options

  • A.

    27

  • B.

    277\frac{27}{7}

  • C.

    9

  • D.

    3

Check Your Answer

Correct Answer

Step-by-Step Solution

Explanation

How the Examiner Thinks

Bridge

Practice problems that bridge the gap between foundational theory and advanced practical application.

Concepts Behind This Question

Parametric form pitfalls|Direction Cosines constraint|Triangle Inequality Mind Games

Why This Question Is Tricky

Common Mistakes

This question tests the intersection of parametric line constraints with vector inequalities.

The primary trap is that students might assume the relation ∣x−1∣+2∣y−2∣+2∣z−3∣=3r|x-1| + 2|y-2| + 2|z-3| = 3r is a general property of the distance and fail to realize it acts as a strict constraint on the direction cosines via the Cauchy-Schwarz inequality.

Without determining the specific discrete set of allowed direction cosines, a student might attempt to minimize the denominator l+2m+2nl+2m+2n continuously, incorrectly concluding that the distance can approach infinity (since l+2m+2nl+2m+2n could theoretically be arbitrarily close to 0 for a general line).

Recognizing the geometric boundary constraints imposed by the direction cosine limitation is crucial.

Quick Facts About This Question

Question Information

SubjectMathematics
ChapterThree-Dimensional Geometry - Class 12
ConceptParametric form pitfalls
Difficulty8
Cognitive Load7
Target Solve Time160 sec
AccessFree