Start Learning Free

Before You Begin

Question #41082

Difficulty: 8/10 | 🟢 Free

The Question

Let X={1,2,3,4,5,6,7}X = \{1, 2, 3, 4, 5, 6, 7\} and Y={1,2,3}Y = \{1, 2, 3\}. A function f:X→Yf: X \to Y is chosen uniformly at random. Let PcP_c be the conditional probability that ff is surjective, given that f(1)+f(2)=cf(1) + f(2) = c, where c∈{2,3,4,5,6}c \in \{2, 3, 4, 5, 6\}. If MM and mm are the maximum and minimum values of PcP_c respectively, then M−mM - m is equal to

Options

  • A.

    31243\frac{31}{243}

  • B.

    62729\frac{62}{729}

  • C.

    1081\frac{10}{81}

  • D.

    32243\frac{32}{243}

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

De Morgan’s Laws in Probability|Surjective Mapping (Onto)|Arbitrary Constants vs Parameters

Why This Question Is Tricky

Common Mistakes

This question tests the application of De Morgan's Laws and the Inclusion-Exclusion Principle within a conditional probability space defined by a parameter cc.

The primary trap is the 'Arbitrary Constant' fallacy: students often assume the probability of surjectivity is independent of cc, calculating the unconditional probability (602/729602/729) and assuming it applies uniformly.

Furthermore, when evaluating specific cases, students frequently fail to recognize that the cardinality of the initial image set I={f(1),f(2)}I = \{f(1), f(2)\} dictates the structure of the complement events.

For c∈{2,6}c \in \{2, 6\}, II has only one element, forcing a full De Morgan's expansion 1−P(A∪B)1 - P(A \cup B) for the remaining domain elements, whereas c∈{3,5}c \in \{3, 5\} requires only a single complement.

Failing to adapt the set-theoretic complement to the parameter cc leads to incorrect bounds for MM and mm.

Quick Facts About This Question

Question Information

SubjectMathematics
ChapterProbability - Class 11
ConceptDe Morgan’s Laws in Probability
Difficulty8
Cognitive Load7
Target Solve Time160 sec
AccessFree