Start Learning Free

Before You Begin

Question #40726

Difficulty: 8/10 | 🟢 Free

The Question

A point PP with position vector p⃗\vec{p} moves in space such that p⃗×(i^+j^+k^)=i^−2j^+k^\vec{p} \times (\hat{i} + \hat{j} + \hat{k}) = \hat{i} - 2\hat{j} + \hat{k}. Let MM and NN be two points with position vectors 2i^+2j^−k^2\hat{i} + 2\hat{j} - \hat{k} and 10i^+10j^−5k^10\hat{i} + 10\hat{j} - 5\hat{k} respectively. Let QQ be the orthogonal projection of PP onto the line passing through MM and NN. If the locus of PP is restricted such that QQ lies strictly on the line segment MNMN, find the maximum value of ∣p⃗∣2|\vec{p}|^2.

Options

  • A.

    590

  • B.

    434

  • C.

    588

  • D.

    225

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

Locus of a Moving Point|Orthogonal projection of a line|Parametric form pitfalls

Why This Question Is Tricky

Common Mistakes

This question tests the precise handling of parametric bounds under orthogonal projection constraints.

A common trap is assuming the parameter tt of the moving point shares the same domain as the length of the target segment (e.g., t∈[0,12]t \in [0, 12]), or ignoring the spatial offset between the lines.

By forcing candidates to map the scalar projection s=(p⃗−m⃗)⋅u^s = (\vec{p} - \vec{m}) \cdot \hat{u} to the geometric bounds 0≤s≤∣MN∣0 \le s \le |MN|, the problem reveals that tt is shifted (t−2t-2).

Failing to establish this exact bounded domain for tt leads to incorrect maximization of the distance function.

Quick Facts About This Question

Question Information

SubjectMathematics
ChapterStraight Lines - Class 11
ConceptLocus of a Moving Point
Difficulty8
Cognitive Load7
Target Solve Time160 sec
AccessFree