MCQEasyJEE 2023Probability Basics

JEE Mathematics 2023 Question with Solution

Let N denote the sum of the numbers obtained when two dice are rolled. If the probability that 2N<N!2N < N! is m/nm/n, where m and n are coprime, then 4m3n4m - 3n is equal to:

  • A

    1212

  • B

    88

  • C

    1010

  • D

    66

Answer

Correct answer:B

Step-by-step solution

Standard Method

Given: N denotes the sum obtained when two dice are rolled.

Find: The value of 4m3n4m - 3n, where the probability of 2N<N!2N < N! is mn\frac{m}{n}.

We are given that 2N<N!2N < N! is satisfied for N4N \geq 4. So the required probability is

P(N4)=1P(N<4)P(N \geq 4) = 1 - P(N < 4)

For N<4N < 4:

  • N=1N = 1: not possible.
  • N=2N = 2: only outcome is (1,1)(1,1), so probability is 136\frac{1}{36}.
  • N=3N = 3: outcomes are (1,2)(1,2) and (2,1)(2,1), so probability is 236\frac{2}{36}.

Therefore,

P(N<4)=P(N=2)+P(N=3)=136+236=336P(N < 4) = P(N=2) + P(N=3) = \frac{1}{36} + \frac{2}{36} = \frac{3}{36}

Using the complement rule,

P(N4)=1336=3336=1112P(N \geq 4) = 1 - \frac{3}{36} = \frac{33}{36} = \frac{11}{12}

Hence,

m=11,n=12m = 11, \quad n = 12

Now,

4m3n=4(11)3(12)=4436=84m - 3n = 4(11) - 3(12) = 44 - 36 = 8

Therefore, the correct option is B.

Common mistakes

  • Assuming 2N<N!2N < N! must be checked separately for every sum without noticing the threshold N4N \geq 4. This makes the counting longer than necessary. First identify from the inequality when it becomes true, then count sums accordingly.

  • Forgetting that the smallest possible sum of two dice is 22, not 11. Counting N=1N = 1 as a possible case gives an incorrect probability. Always list the actual range of sums before counting outcomes.

  • Using the number of favorable sums instead of the number of favorable outcomes. Different sums do not have equal probability for two dice. Count ordered pairs such as (1,2)(1,2) and (2,1)(2,1) separately.

Practice more Probability Basics questions

Get unlimited AI-adaptive practice, mastery tracking, and an AI tutor that explains every step — free to start.

Related questions