RankRizz
JEE MAIN 2025 · 04 APR S2+4 / −1MEDIUMTRANSCRIBED

JEE Main 2025 Mathematics question — Bayes' theorem

A card from a pack of 52 cards is lost. From the remaining 51 cards, n cards are drawn and are found to be spades. If the probability of the lost card to be a spade is 1150\frac{11}{50}, the n is equal to

SOLUTION

Let
A : the lost card is a spade,
B : all the nn cards drawn from the remaining 5151 cards are spades.

We are given P(A∣B)=1150P(A\mid B)=\dfrac{11}{50} and we have to find nn.

First write Bayes’ theorem:
P(A∣B)=P(B∣A) P(A)P(B∣A) P(A)+P(B∣A‾) P(A‾)   −(1)P(A\mid B)=\dfrac{P(B\mid A)\,P(A)}{P(B\mid A)\,P(A)+P(B\mid \overline{A})\,P(\overline{A})}\,\,\,-(1)

Initial probabilities before any card is lost:
Total spades in a full pack = 1313 out of 5252.
Hence P(A)=1352=14P(A)=\dfrac{13}{52}=\dfrac14 and P(A‾)=3952=34P(\overline{A})=\dfrac{39}{52}=\dfrac34.

Case 1 (event A happens): the lost card itself is a spade.
Spades left in the remaining 5151 cards = 1212.
So
P(B∣A)=12Cn51Cn   −(2)P(B\mid A)=\dfrac{{}^{12}C_{n}}{{}^{51}C_{n}}\,\,\,-(2)

Case 2 (event A‾\overline{A} happens): the lost card is not a spade.
Spades left in the remaining 5151 cards = 1313.
So
P(B∣A‾)=13Cn51Cn   −(3)P(B\mid \overline{A})=\dfrac{{}^{13}C_{n}}{{}^{51}C_{n}}\,\,\,-(3)

Substitute (2)(2) and (3)(3) into (1)(1):

P(A∣B)=12Cn51Cn⋅1412Cn51Cn⋅14+13Cn51Cn⋅34P(A\mid B)=\dfrac{\displaystyle \frac{{}^{12}C_{n}}{{}^{51}C_{n}}\cdot \frac14}{\displaystyle \frac{{}^{12}C_{n}}{{}^{51}C_{n}}\cdot \frac14+\frac{{}^{13}C_{n}}{{}^{51}C_{n}}\cdot \frac34}

Cancel the common factor 51Cn{}^{51}C_{n} and multiply numerator and denominator by 44 to simplify:

P(A∣B)=12Cn12Cn+3 13Cn   −(4)P(A\mid B)=\dfrac{{}^{12}C_{n}}{{}^{12}C_{n}+3\,{}^{13}C_{n}}\,\,\,-(4)

The question tells us that (4)=1150(4)=\dfrac{11}{50}, therefore

12Cn12Cn+3 13Cn=1150\dfrac{{}^{12}C_{n}}{{}^{12}C_{n}+3\,{}^{13}C_{n}}=\dfrac{11}{50}

Cross-multiply:

50 12Cn=11(12Cn+3 13Cn)50\,{}^{12}C_{n}=11\bigl({}^{12}C_{n}+3\,{}^{13}C_{n}\bigr)

50 12Cn=11 12Cn+33 13Cn50\,{}^{12}C_{n}=11\,{}^{12}C_{n}+33\,{}^{13}C_{n}

Subtract 11 12Cn11\,{}^{12}C_{n} from both sides:

39 12Cn=33 13Cn39\,{}^{12}C_{n}=33\,{}^{13}C_{n}

Divide by 33:

13 12Cn=11 13Cn   −(5)13\,{}^{12}C_{n}=11\,{}^{13}C_{n}\,\,\,-(5)

Use the identity relating the two combinations:
13Cn=1313−n 12Cn{}^{13}C_{n}=\dfrac{13}{13-n}\,{}^{12}C_{n}

Substitute this into (5)(5):

13 12Cn=11(1313−n 12Cn)13\,{}^{12}C_{n}=11\left(\dfrac{13}{13-n}\,{}^{12}C_{n}\right)

Cancel the common factor 12Cn{}^{12}C_{n}:

13=14313−n13=\dfrac{143}{13-n}

Multiply both sides by (13−n)(13-n):

13(13−n)=14313(13-n)=143

169−13n=143169-13n=143

13n=169−143=2613n=169-143=26

n=2n=2

Hence the number of cards drawn that turned out to be spades is n=2n=2.

Tagged Bayes' theorem. Machine-assigned, so read it as a strong shortlist rather than a verdict.

TopicBayes' theorem
TypeNumerical answer