Start Learning Free

Before You Begin

Question #41058

Difficulty: 8/10 | 🟢 Free

The Question

A real number xx is chosen uniformly at random from the interval [1,N)[1, N), where NN is an integer. The mapping f:[1,N)→{0,1,2,3}f: [1, N) \to \{0, 1, 2, 3\} defined by f(x)=[log⁡2x]f(x) = [\log_2 x] is surjective. Let AA be the event that f(x)f(x) is an even integer, and BB be the event that {log⁡2x}≥12\{ \log_2 x \} \ge \frac{1}{2}, where [⋅][\cdot] and {⋅}\{\cdot\} denote the greatest integer and fractional part functions respectively. If AA and BB are independent events, what is the probability of the event A∪BA \cup B?

Options

  • A.

    5−223\frac{5 - 2\sqrt{2}}{3}

  • B.

    4−23\frac{4 - \sqrt{2}}{3}

  • C.

    7−323\frac{7 - 3\sqrt{2}}{3}

  • D.

    5−23\frac{5 - \sqrt{2}}{3}

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

Mutually Exclusive vs Independent|Surjective Mapping (Onto)|Greatest Integer Function (GIF)

Why This Question Is Tricky

Common Mistakes

This problem tests the intersection of continuous probability, mutually exclusive interval partitioning via the Greatest Integer Function (GIF), and event independence.

The primary trap is conflating the discrete jumps of the GIF with continuous probability, leading students to incorrectly partition the sample space or miscalculate the lengths of valid intervals.

Furthermore, the surjectivity condition acts as a strict constraint on the sample space boundary NN.

Students often mistakenly assume that events defined by the same underlying function (here, log⁡2x\log_2 x) must be dependent, ignoring the specific fractal-like symmetry of the fractional part over powers of 2 that uniquely creates independence at N=16N=16.

Quick Facts About This Question

Question Information

SubjectMathematics
ChapterProbability - Class 11
ConceptMutually Exclusive vs Independent
Difficulty8
Cognitive Load7
Target Solve Time160 sec
AccessFree