Q.Three cards are drawn successively, without replacement from a pack of 52 well shuffled cards. What is the probability that first two cards are kings and the third card drawn is an ace?
🔒You're viewing a preview — the full solution, concept, methods & PYQ mapping are locked.
🔒 Start your 14-day free trial to unlock the full solution →Concept understanding — Conditional Probability
Conditional Probability
Roll a die and ask "what is the chance of an even number?" — that is 3/6. But suppose someone tells you the result is greater than 3. Now you are no longer looking at all six faces, only at {4,5,6}, and two of those (4 and 6) are even, so the probability becomes 2/3. That change — from the probability of A to the probability of A given that B has already occurred — is conditional probability.
The Idea: Shrink the Sample Space
Conditioning on B throws away every outcome where B is false and treats B as the new "whole world." You measure A only against what is still possible.
Think of filtering a table of data: unconditional probability uses every row; conditional probability keeps only the rows where the condition is true.
The Definition
For events A and B with P(B)>0,
P(A∣B)=P(B)P(A∩B).
We divide by P(B) to rescale so that B itself has probability 1; the surviving part of A is the overlap A∩B. Checking the die: P(A∩B)=P({4,6})=62 and P(B)=63, so P(A∣B)=3/62/6=32, matching the intuition.
Rearranging gives the multiplication rule P(A∩B)=P(A∣B)P(B), which is usually the easier way to compute a joint probability when a problem says "given that."
Two Cautions
- P(A∣B) and P(B∣A) are generally not equal; swapping them is the classic mistake. They are linked by Bayes' theorem, P(A∣B)=P(B)P(B∣A)P(A). …
Concept: Conditional Probability — the probability of a sequence of dependent events is the product of the conditional probabilities at each step.
Step 1: Probability first card is a king:
524=131.
Step 2: Given first is a king, probability second is also a king (3 kings left in 51 cards):
513=171. …
The problem is a conditional probability chain: the chance of drawing a king first, then another king given the first was a king, then an ace given two kings are gone. Multiplying these dependent probabilities gives 524×513×504=55252.
The key here is that the draws are without replacement — each draw changes the deck. So the probability of the second event depends on what happened first, and the third depends on both previous draws. This is exactly what conditional probability handles: P(A∩B∩C)=P(A)⋅P(B∣A)⋅P(C∣A∩B).
Let’s walk through it.
- First card is a king. There are 4 kings in a deck of 52 cards.
P(first king)=524=131
- Second card is a king, given the first was a king. After removing one king, 3 kings remain in a deck of 51 cards.
P(second king∣first king)=513=171
- Third card is an ace, given the first two were kings. Two kings are gone, but no aces have been drawn yet — all 4 aces remain. The deck now has 50 cards.
P(third ace∣first two kings)=504=252
- Multiply the chain.
P=524×513×504=52⋅51⋅504⋅3⋅4
Simplify step by step: …
Method: The chain multiplication rule for successive dependent draws
Use this for three or more cards/objects drawn without replacement, where you need a specific outcome at each position.
Steps
Step 1: Expand the joint probability as a full chain.
P(A∩B∩C)=P(A)P(B∣A)P(C∣A∩B).
Each conditional is evaluated after the earlier draws have been removed.
Step 2: Track how each draw changes both numerator and denominator. …
Common Mistakes
Mistake 1: Reusing the same fractions as if the deck were replaced.
Why it's wrong: the draws are without replacement, so the deck shrinks from 52 to 51 to 50 and counts change each time. Correct approach: use 524×513×504.
Mistake 2: Reducing the ace count after drawing the kings. …
Showing the 12 most recent of 45 on this concept.
- COMEDK 2024Set 2024-M1 markMCQQ.An urn contains 2 white and 2 black balls. A ball is drawn at random. If it is white it is not replaced into the urn. Otherwise it is replaced along with another ball of the same colour. The process is repeated. The probability that the third ball drawn is black is (A) 3017 (B) 6037 (C) 6031 (D) 3023
›Reveal solutionSolution
Conditioning on the first two draws (white -> not replaced; black -> replaced plus one extra black) and using total probability gives P(3rd black)=3023 — option (D).
Rules. Start with 2 white, 2 black (total 4). Drawing white removes it (whites −1, total −1). Drawing black puts it back and adds one more black (blacks +1, total +1).
First two draws and the composition just before the 3rd draw
- WW: 42⋅31=61; urn becomes W0, B2 (total 2) ⇒P(black)=1.
- WB: 42⋅32=31; urn becomes W1, B3 (total 4) ⇒P(black)=43.
- BW: 42⋅52=51; urn becomes W1, B3 (total 4) ⇒P(black)=43.
- BB: 42⋅53=103; urn becomes W2, B4 (total 6) ⇒P(black)=32. …
- COMEDK 2024Set 2024-E1 markMCQQ.Suppose we have three cards identical in form except that both sides of the first card are coloured red, both sides of the second are coloured black, and one side of the third card is coloured red and the other side is coloured black. The three cards are mixed and a card is picked randomly. If the upper side of the chosen card is coloured red, what is the probability that the other side is coloured black. (A) 61 (B) 21 (C) 0 (D) 31
›Reveal solutionSolution
This is a classic conditional probability problem (often called the "three cards" or "Bertrand's box" variant). The key is that seeing a red side updates the probability space to only the red sides, and among those, only one belongs to the mixed card. The answer is 1/3.
We are asked: given that the visible side is red, what is the probability that the other side is black? This is not simply "one of the two remaining cards has a black other side" because the cards are not equally likely once we condition on the observation.
Concept and Intuition
The pitfall is to think: "We see red, so the card is either the all-red or the mixed card. That's two possibilities, so the chance is 1/2." But this ignores that the all-red card has two red sides, while the mixed card has only one red side. When we pick a card at random and then look at a random side, each of the six sides is equally likely to be the one we see. Seeing red eliminates the three black sides, leaving only the three red sides. Among those three red sides, two belong to the all-red card and only one belongs to the mixed card. So the probability that the other side is black is 1/3.
Step-by-step reasoning
-
Label the sides.
Let the cards be:
- Card A: both sides red (sides R1,R2)
- Card B: both sides black (sides B1,B2)
- Card C: one red, one black (sides R3,B3)
-
Count equally likely outcomes.
When we pick a card uniformly at random and then look at a random side, there are 3×2=6 equally likely side-views. Each of the six sides has probability 1/6 of being the one we see.
-
Condition on seeing a red side.
The red sides are: R1,R2 (from card A) and R3 (from card C). That's 3 red sides. So the conditional space has 3 equally likely possibilities. …
-
- KCET 2020Set A-11 markMCQQ.The probability of solving a problem by three persons A, B and C independently is 21, 41 and 31 respectively. Then the probability of the problem is solved by any two of them is (A) 121 (B) 41 (C) 241 (D) 81
›Reveal solutionSolution
The problem asks for the probability that exactly two of the three persons solve it. We compute the sum of probabilities for each pair solving while the third fails, giving 81.
The key idea: "solved by any two of them" means exactly two solve it, not at least two. The third person must fail. Since A, B, and C work independently, we multiply their individual probabilities for each specific outcome and then add the three possible cases.
A common mistake is to include the case where all three solve it. That would be "at least two", not "any two". The phrase "any two" in probability problems almost always means exactly two.
Let’s denote:
- P(A)=21, so P(A fails)=1−21=21
- P(B)=41, so P(B fails)=1−41=43
- P(C)=31, so P(C fails)=1−31=32
We want exactly two successes. There are three mutually exclusive ways this happens:
-
A and B solve, C fails
Probability = P(A)×P(B)×P(C fails)
=21×41×32=242=121
-
A and C solve, B fails
Probability = P(A)×P(C)×P(B fails)
=21×31×43=243=81
-
B and C solve, A fails
Probability = P(B)×P(C)×P(A fails) …
- KCET 2021Set A-11 markMCQQ.If A, B and C are three independent events such that P(A)=P(B)=P(C)=p then P(at least two of A, B, C occur)= (A) p3−3p (B) 3p−2p2 (C) 3p2−2p3 (D) 3p2
›Reveal solutionSolution
Split "at least two" into the mutually exclusive cases exactly two and exactly three, use independence to multiply probabilities, and add.
Step 1 — Why independence lets us multiply.
For independent events the probability of a joint occurrence is the product of the individual probabilities, and this extends to complements: P(A∩B∩Cˉ)=P(A)P(B)P(Cˉ). Here
P(A)=P(B)=P(C)=p,P(Aˉ)=P(Bˉ)=P(Cˉ)=1−p.
Step 2 — Decompose the event.
P(at least two)=P(exactly two)+P(all three)
These two cases are disjoint, so their probabilities simply add.
Step 3 — Exactly two.
The pair that occurs can be chosen in (23)=3 ways (ABCˉ, ABˉC, AˉBC), and each has probability p⋅p⋅(1−p):
P(exactly two)=3p2(1−p)=3p2−3p3
Step 4 — All three.
P(all three)=P(A∩B∩C)=p3
Step 5 — Add.
P(at least two)=(3p2−3p3)+p3=3p2−2p3 …
- COMEDK 2026Set 2026-M1 markMCQQ.Samhita faces a three-headed dragon. She wins a "Tactical medal" if she manages to defeat exactly one of the three heads. The battle proceeds head-by-head under the following conditions: The probability of defeating the first head is 31. After a win: if she defeats a head, the probability of defeating the next head is 32. After a loss: if she fails to defeat a head, the probability of defeating the next head is 41. What is the probability that Samhita earns the "Tactical medal"? (A) 7223 (B) 365 (C) 7217 (D) 7219
›Reveal solutionSolution
Summing the three disjoint "exactly one win" paths gives 121+181+81=7219 — option (D).
Set up the conditional probabilities. Let Wi mean "defeats head i" and Li mean "fails":
- P(W1)=31, so P(L1)=32.
- After a win: next-head win probability =32, so next-head loss probability =31.
- After a loss: next-head win probability =41, so next-head loss probability =43.
Earning the medal means exactly one of the three heads is defeated. The three disjoint sequences are W1L2L3, L1W2L3, and L1L2W3.
Path 1 — W1L2L3 (win, then loss after a win, then loss after a loss):
P=31⋅31⋅43=363=121
Path 2 — L1W2L3 (loss, then win after a loss, then loss after a win): …
- KCET 2022Set C-41 markMCQQ.If A and B are two events such that P(A)=21, P(B)=31 and P(A∣B)=41, then P(A′∩B′) is (A) 3/16 (B) 1/12 (C) 3/4 (D) 1/4
›Reveal solutionSolution
Get P(A∩B) from the conditional probability, use the addition rule for P(A∪B), then apply De Morgan: P(A′∩B′)=1−P(A∪B).
Step 1 — Recover the joint probability from the conditional.
Conditional probability is defined by P(A∣B)=P(B)P(A∩B) — it re-scales the probability of A to the reduced sample space B. Rearranging gives the multiplication rule:
P(A∩B)=P(A∣B)P(B)=41×31=121.
Step 2 — Addition rule for the union.
P(A∪B)=P(A)+P(B)−P(A∩B)=21+31−121.
Taking LCM 12: …
- KCET 2021Set A-11 markMCQQ.Two dice are thrown. If it is known that the sum of numbers on the dice was less than 6 the probability of getting a sum as 3 is (A) 181 (B) 185 (C) 51 (D) 52
›Reveal solutionSolution
We use conditional probability: reduce the sample space to only those outcomes where the sum is less than 6, then find the fraction of those that give a sum of exactly 3. The answer is 51.
The key idea here is conditional probability — the probability of one event given that another event has already occurred. When we say "if it is known that the sum was less than 6", we are no longer considering all 36 possible outcomes of throwing two dice. Instead, we restrict ourselves to only those outcomes that satisfy the condition, and then ask: within this smaller set, what fraction gives a sum of 3?
Let’s work it out step by step.
-
List all possible outcomes when two dice are thrown.
Each die shows a number from 1 to 6. The total number of ordered pairs (a,b) is 6×6=36.
-
Identify the condition: sum less than 6.
The possible sums are 2, 3, 4, and 5 (since sum = 1 is impossible with two dice). Let’s list all ordered pairs that give each sum:
- Sum = 2: (1,1) → 1 outcome
- Sum = 3: (1,2),(2,1) → 2 outcomes
- Sum = 4: (1,3),(2,2),(3,1) → 3 outcomes
- Sum = 5: (1,4),(2,3),(3,2),(4,1) → 4 outcomes
Total outcomes with sum < 6: 1+2+3+4=10.
Watch outA common mistake is to forget that (1,2) and (2,1) are different outcomes. Dice are distinct, so order matters. Always count ordered pairs unless the problem explicitly says "identical dice" (which is rare in such problems).
-
Identify the event of interest: sum = 3. …
-
- COMEDK 2025Set 2025-M1 markMCQQ.Three fair dice are thrown. What is the probability of getting a total of 15 given that they exhibit three different numbers that are in arithmetic progression? (A) 81 (B) 61 (C) 41 (D) 21
›Reveal solutionSolution
The problem asks for the conditional probability that three dice sum to 15, given that the three numbers shown are distinct and form an arithmetic progression. By listing all such triples and counting those summing to 15, the probability is found to be 1/2.
Concept and intuition
We need P(sum=15∣distinct AP). The condition restricts the outcomes to only those triples (a,b,c) with a<b<c (since dice are fair, order matters but we can treat ordered rolls; however the condition “three different numbers” and “arithmetic progression” is symmetric). The key is to enumerate all possible ordered triples of distinct numbers from {1,2,3,4,5,6} that are in arithmetic progression, then count how many of those sum to 15. Because the dice are fair, each ordered triple is equally likely, so the conditional probability is just the ratio of favorable ordered triples to total ordered triples satisfying the condition.
Step-by-step reasoning
- Characterize arithmetic progressions of three distinct numbers from 1 to 6. Three numbers x,y,z (with x<y<z) are in AP iff 2y=x+z. Since they are distinct and from 1 to 6, the possible triples (unordered) are:
(1,2,3), (1,3,5), (2,3,4), (2,4,6), (3,4,5), (4,5,6).
Check: For (1,2,3): 2⋅2=1+3; (1,3,5): 2⋅3=1+5; etc. That’s all.
-
Count ordered triples satisfying the condition.
For each unordered triple, the three numbers are distinct, so they can appear in any order on the three dice. That gives 3!=6 permutations per triple.
Total ordered triples satisfying the condition = 6×6=36.
-
Identify which of these triples sum to 15.
Compute sums of the unordered triples:
(1,2,3)(1,3,5)(2,3,4)(2,4,6)(3,4,5)(4,5,6)→6,→9,→9,→12,→12,→15. …
- COMEDK 2025Set 2025-E1 markMCQQ.A pot contains 5 red and 2 green balls. A ball is drawn at random from this pot. If a drawn ball is green, then a red ball is added to the pot. If a drawn ball is red, then a green ball is added to the pot, while the original ball drawn is not replaced in the pot. Now a second ball is drawn at random from the pot, what is the probability that the second ball drawn is a red ball? (A) 4912 (B) 4932 (C) 73 (D) 4927
›Reveal solutionSolution
Condition on the first draw: P(2nd red)=72⋅76+75⋅74=4932.
Start: 5 red, 2 green, total 7. The first ball is not replaced, and a ball of the other colour is added.
Case 1 — first ball is green. P=72.
Remove that green (5R,1G), then add a red ⇒6R,1G (total 7).
P(2nd red∣green first)=76
Case 2 — first ball is red. P=75.
Remove that red (4R,2G), then add a green ⇒4R,3G (total 7). …
- KCET 2020Set A-11 markMCQQ.If A and B are two events such that P(A)=31, P(B)=21 and P(A∩B)=61, then P(A′/B) is (A) 32 (B) 31 (C) 21 (D) 121
›Reveal solutionSolution
Use P(A′∣B)=1−P(A∣B) (equivalently P(B)P(B)−P(A∩B)), which gives 32.
Step 1 — The definition of conditional probability.
For P(B)>0,
P(A′∣B)=P(B)P(A′∩B)
Conditioning on B means we restrict the sample space to B and ask what fraction of B lies outside A.
Step 2 — Split B into the part inside A and the part outside A.
The events A∩B and A′∩B are disjoint and their union is exactly B:
P(B)=P(A∩B)+P(A′∩B)
⇒P(A′∩B)=P(B)−P(A∩B)=21−61=63−1=62=31
Step 3 — Divide by P(B).
P(A′∣B)=P(B)P(A′∩B)=2131=31×12=32
Step 4 — Cross-check with the complement rule. …
- COMEDK 2024Set 2024-A1 markMCQQ.P and Q are considering to apply for a job. The probability that P applies for the job is 41. The probability that P applies for the job given that Q applies for the job is 21, and the probability that Q applies for the job given that P applies for the job is 31. Then the probability that P does not apply for the job given that Q does not apply for the job is (A) 54 (B) 87 (C) 65 (D) 1211
›Reveal solutionSolution
We are given conditional probabilities and need to find P(P∣Q). Using the definitions of conditional probability and the law of total probability, we compute P(Q) and P(Q), then apply Bayes' theorem to get 54, which corresponds to option (A).
Concept and intuition:
This is a classic problem of working backwards from conditional probabilities to find a joint probability table. We know P(P), P(P∣Q), and P(Q∣P). From these, we can find P(P∩Q) in two ways, which lets us solve for P(Q). Then we can compute the desired conditional probability P(P∣Q) using the complement rule and the definition of conditional probability.
Step-by-step solution:
- Write down what is given. Let P = event that P applies, Q = event that Q applies. We have:
P(P)=41,P(P∣Q)=21,P(Q∣P)=31.
- Use the definition of conditional probability to express P(P∩Q) in two ways. From P(P∣Q)=P(Q)P(P∩Q), we get
P(P∩Q)=P(P∣Q)⋅P(Q)=21P(Q).
From P(Q∣P)=P(P)P(P∩Q), we get
P(P∩Q)=P(Q∣P)⋅P(P)=31⋅41=121.
- Equate the two expressions for P(P∩Q) to find P(Q).
21P(Q)=121⇒P(Q)=61.
- Find P(Q) and P(P∩Q).
P(Q)=1−P(Q)=1−61=65.
Also, P(P∩Q)=P(P)−P(P∩Q)=41−121=123−121=122=61.
- Find P(P∩Q). Since P∩Q is the complement of P∪Q, we can use:
P(P∩Q)=1−P(P∪Q).
First, P(P∪Q)=P(P)+P(Q)−P(P∩Q)=41+61−121. …
- KCET 2021Set A-11 markMCQQ.Given that A and B are two events such that P(B)=53, P(A/B)=21 and P(A∪B)=54, then P(A)= (A) 103 (B) 21 (C) 51 (D) 53
›Reveal solutionSolution
Turn the conditional probability into P(A∩B), then substitute into the addition theorem and solve for P(A).
Step 1 — Extract P(A∩B) from the conditional probability.
By definition,
P(A/B)=P(B)P(A∩B)(P(B)=0).
Rearranging (the multiplication theorem):
P(A∩B)=P(A/B)⋅P(B)=21×53=103.
This is the key move — the conditional probability is not directly usable in the union formula, but P(A∩B) is.
Step 2 — Apply the addition theorem.
P(A∪B)=P(A)+P(B)−P(A∩B).
The intersection is subtracted because the elements common to A and B would otherwise be counted twice.
Step 3 — Substitute the known values.
54=P(A)+53−103.
Step 4 — Solve for P(A). …
🎓Unlock everything free for 14 days
- ✓Full step-by-step solutions
- ✓Concept-first explanations
- ✓Methods, shortcuts & mistakes
- ✓PYQ mapping + timed mock tests
Full access for 14 days. No credit card required.