Start Learning Free

Before You Begin

Question #73284

Difficulty: 8/10 | 🟢 Free

The Question

Let n∈Nn \in \mathbb{N}. Consider the vectors a⃗=2n(n+1)i^\vec{a} = 2n(n+1)\hat{i} and b⃗=2n(n+1)i^+(2n+1)j^\vec{b} = 2n(n+1)\hat{i} + (2n+1)\hat{j}. Let LL be the line passing through the origin and parallel to the internal angle bisector of a⃗\vec{a} and b⃗\vec{b}. If the line LL intersects the plane x=4n(n+1)x = 4n(n+1) at the point P(x0,y0,z0)P(x_0, y_0, z_0), then the value of ⌊y0⌋\lfloor y_0 \rfloor is (where ⌊⋅⌋\lfloor \cdot \rfloor denotes the greatest integer function):

Options

  • A.

    2n−12n-1

  • B.

    2n2n

  • C.

    2n+12n+1

  • D.

    2n+22n+2

Check Your Answer

Correct Answer

Step-by-Step Solution

Explanation

How the Examiner Thinks

Monster

Ultra-high difficulty questions designed to test your limit, stamina, and deep conceptual understanding.

Concepts Behind This Question

Angle Bisector Direction|Line-Plane intersection logic|Greatest Integer Function Traps

Why This Question Is Tricky

Examiner Levers

Variable Manipulation

Algebraic solutions only (No numbers); tests pure symbolic logic.

Difficulty Boost : +4

Common Mistakes

This question tests the critical distinction between the sum of vectors (a⃗+b⃗\vec{a} + \vec{b}) and the true angle bisector direction (a^+b^\hat{a} + \hat{b}).

Students frequently bypass normalization to save time.

If they make this mistake, the direction becomes (4n2+4n)i^+(2n+1)j^(4n^2+4n)\hat{i} + (2n+1)\hat{j}, which intersects the plane exactly at y0=2n+1y_0 = 2n+1.

The Greatest Integer Function acts as a precision trap: the true normalized direction yields y0=2n+1−12n+1y_0 = 2n+1 - \frac{1}{2n+1}, which falls just below the integer boundary, shifting the correct answer to 2n2n.

The clean algebraic simplification of the wrong path creates a powerful false sense of security.

Quick Facts About This Question

Question Information

SubjectMathematics
ChapterVector Algebra - Class 12
ConceptAngle Bisector Direction
Difficulty8
Cognitive Load7
Target Solve Time160 sec
AccessFree