Start Learning Free

Before You Begin

Question #41066

Difficulty: 8/10 | 🟢 Free

The Question

Let Ω\Omega be the set of all 66-letter words formed using the letters from the set {A,B,C,D}\{A, B, C, D\}. For k∈{1,2,3,4}k \in \{1, 2, 3, 4\}, let SkS_k be the subset of Ω\Omega consisting of words that contain exactly kk distinct letters. A subset SkS_k is chosen at random with probability 14\frac{1}{4}, and a word WW is drawn uniformly at random from it. Given that WW is a palindrome containing exactly two 'A's, what is the probability that WW belongs to S3S_3?

Options

  • A.

    31121\frac{31}{121}

  • B.

    23\frac{2}{3}

  • C.

    3161\frac{31}{61}

  • D.

    90121\frac{90}{121}

Check Your Answer

Correct Answer

Step-by-Step Solution

Explanation

How the Examiner Thinks

Specialist

Targeted practice for niche, high-difficulty concepts that frequently appear in JEE Advanced exams.

Concepts Behind This Question

Combinatorial Counting (P&C Integration)|Bayes' Theorem Reversal|The Empty Set Trap|Inclusion-Exclusion Principle

Why This Question Is Tricky

Common Mistakes

This problem tests the 'Empty Set Trap' within a Bayesian framework combined with the Inclusion-Exclusion Principle.

Students often blindly apply combinatorial formulas to find the intersection of events without verifying domain validity.

Here, forming a 6-letter palindrome with 4 distinct letters requires four positive even integers summing to 6, which is mathematically impossible.

Failing to recognize that the intersection with S_4 is an empty set leads to incorrect denominator terms in Bayes' theorem.

Furthermore, the problem distinguishes between a uniform draw from the entire sample space versus a two-step hierarchical selection, trapping students who ignore the varying sizes of the subsets when calculating conditional probabilities.

Quick Facts About This Question

Question Information

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