Start Learning Free

Before You Begin

Question #41024

Difficulty: 8/10 | 🟢 Free

The Question

A light ray travels along the line L:x3=y4=z12L: \frac{x}{3} = \frac{y}{4} = \frac{z}{12} and intersects a series of parallel glass plates. The surfaces of the plates lie on the planes Πk:3x+4y=25k\Pi_k: 3x + 4y = 25k for k=1,2,…,40k = 1, 2, \dots, 40. Let the intersection points of the ray with these planes be P1,P2,…,P40P_1, P_2, \dots, P_{40} respectively. A subset of 7 points is to be chosen from these 40 points such that the spatial distance between the orthogonal projections of any two chosen points on the plane Π:3x+4y=0\Pi: 3x + 4y = 0 is at least 39. Find the number of ways to choose these 7 points.

Options

  • A.

    (227)\binom{22}{7}

  • B.

    (287)\binom{28}{7}

  • C.

    (347)\binom{34}{7}

  • D.

    (247)\binom{24}{7}

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

Combinatorial Counting|Gap Method|Distance Formula in 3D|Angle between line and plane

Why This Question Is Tricky

Common Mistakes

This problem fuses 3D Coordinate Geometry with Combinatorics.

The core trap lies in the spatial orientation of the points: students often calculate the distance along the line of intersection (d=13d=13) and apply the distance constraint directly, yielding an incorrect index gap of ∣i−j∣≥3|i-j| \ge 3 (leading to the trap answer (287)\binom{28}{7}).

By forcing the constraint onto the orthogonal projections, the effective distance between points changes (d′=12d'=12), which alters the combinatorial threshold to ∣i−j∣≥4|i-j| \ge 4.

This tests whether the student can successfully translate a 3D geometric projection into a 1D discrete combinatorial sequence before applying the Gap Method.

Quick Facts About This Question

Question Information

SubjectMathematics
ChapterProbability - Class 11
ConceptCombinatorial Counting (P&C Integration)
Difficulty8
Cognitive Load7
Target Solve Time160 sec
AccessFree