Q.A bag contains 5 red marbles and 3 black marbles. Three marbles are drawn one by one without replacement. What is the probability that at least one of the three marbles drawn be black, if the first marble is red?
🔒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 — we are finding the probability of an event given that a specific condition (first marble is red) has already occurred.
Since the first marble is red, the remaining bag contains 4 red and 3 black marbles (total 7). We now draw two more marbles without replacement.
Step 1: It is easier to find the complement — the probability that none of the next two marbles is black (i.e., both are red).
Step 2: Probability that the second marble is red (given first was red) is 74. After that, probability that the third marble is also red is 63=21. …
Given the first marble is red, the bag holds 4 red and 3 black. The chance the next two are both red is 74⋅63=72, so the probability of at least one black is 1−72=75.
Since the first marble drawn is red, the remaining bag contains
5−1=4 red,3 black,total 7,
and two more marbles are drawn without replacement. "At least one of the three is black" is now the same as "at least one of the next two is black," so use the complement.
1. Both of the next two are red (no black).
- Second marble red: 74.
- Then 3 red remain out of 6, so third marble red: 63=21.
P(both red)=74×21=72.
2. At least one black. …
Method: Conditional Probability with an Updated Sample Space and the "At Least One" Complement
Use this for without-replacement draws where a condition is already known and you want "at least one" of a colour.
Steps
Step 1: Update the composition using the given condition.
Once the first draw is known (e.g. a red is removed), recompute how many of each item remain. All later probabilities are taken from this reduced pool.
Step 2: Recognise "at least one" and complement it.
Directly summing "one, two, …" is long; the complement of "at least one black" is "no black at all" (every remaining draw is red): …
Common Mistakes
Mistake 1: Not updating the bag after the first red is drawn.
Why it's wrong: given the first marble is red, only 4 red and 3 black remain; using the original 5 red overstates the reds. Correct approach: compute later draws from the 4-red, 3-black pool.
Mistake 2: Adding probabilities for "at least one black" case by case over three draws. …
Showing the 12 most recent of 45 on this concept.
- 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. …
-
- 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 2021Set 2021-B1 markMCQQ.An urn contains 5 red and 5 black coloured balls. A ball is picked at random, its colour noted and then is put back into the urn. Now, additional two balls of the same colour are put into the urn and then a ball is drawn at random. What is the probability that the ball now chosen is red. (A) 7/24 (B) 1/2 (C) 5/8 (D) 2/3
›Reveal solutionSolution
By symmetry the second-draw red probability averages to 21.
Start: 5 red, 5 black (10 total). First ball is drawn, replaced, then 2 more of the same colour are added, so the urn always has 12 balls before the second draw.
- First ball red (P=105=21): urn now 7R, 5B ⇒ P(red)=127. …
- COMEDK 2025Set 2025-A1 markMCQQ.Three bags contain a number of red and white balls are as follows. Bag I: 3 red balls Bag II: 2 red balls and 1 white ball Bag III: 3 White balls The probability that bag i will be chosen and a ball is selected from it is 6i,i=1,2,3. If a white ball is selected, what is the probablity that it came from Bag III (A) 119 (B) 112 (C) 0 (D) 111
›Reveal solutionSolution
This is a classic Bayes’ theorem problem: we are given prior probabilities for choosing each bag and the conditional probabilities of drawing a white ball from each bag; after observing a white ball, we want the posterior probability that it came from Bag III. The answer is 119.
We start by noting that the problem gives us three bags with different compositions, and a rule for choosing a bag: the probability of picking bag i is 6i. Then, from that bag, we pick a ball uniformly at random. We are told that a white ball was selected, and we need the probability that it came from Bag III. This is a textbook case for Bayes’ theorem, which lets us “reverse” conditional probabilities: we know P(white∣bag i), and we want P(bag i∣white).
Let’s work through it step by step.
- Define events and write down given probabilities. Let Bi be the event that bag i is chosen (i=1,2,3). We are told:
P(B1)=61,P(B2)=62,P(B3)=63.
Let W be the event that a white ball is drawn.
From the bag compositions:
- Bag I: 3 red, 0 white → P(W∣B1)=0.
- Bag II: 2 red, 1 white → P(W∣B2)=31.
- Bag III: 0 red, 3 white → P(W∣B3)=1.
- Compute the total probability of drawing a white ball. By the law of total probability:
P(W)=P(B1)P(W∣B1)+P(B2)P(W∣B2)+P(B3)P(W∣B3).
Substitute:
P(W)=61⋅0+62⋅31+63⋅1=0+182+63=91+21.
Get a common denominator (18):
P(W)=182+189=1811.
- Apply Bayes’ theorem to find P(B3∣W). Bayes’ theorem says:
P(B3∣W)=P(W)P(B3)P(W∣B3).
Plug in the numbers:
- COMEDK 2023Set 2023-E1 markMCQQ.Bag A contains 3 white and 2 red balls. Bag B contains only 1 white ball. A fair coin is tossed. If head appears then 1 ball is drawn at random from bag A and put into bag B. However if tail appears then 2 balls are drawn at random from bag A and put into bag B. Now one ball is drawn at random from bag B. Given that the drawn ball from B is white, the probability that head appeared on the coin is (A) 3023 (B) 2312 (C) 2311 (D) 3019
›Reveal solutionSolution
Computing P(white drawn∣H)=54 and P(white∣T)=1511, Bayes' theorem gives P(H∣white)=2312.
Head (transfer 1 ball from A(3W,2R) to B(1W), then draw from B's 2 balls):
P(white)=53(1)+52(21)=53+51=54.
Tail (transfer 2 balls from A to B(1W), then draw from B's 3 balls):
P(WW)=103⇒P(white)=1,P(WR)=106⇒32,P(RR)=101⇒31. …
- 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). …
- COMEDK 2026Set 2026-A1 markMCQQ.Vishnu has two jars of marbles, Jar A and Jar B. Jar A contains 3 yellow marbles and 2 green marbles. Jar B contains 4 yellow marbles and 3 green marbles. Vishnu flips a fair coin. If it lands heads, he picks two marbles at random without replacement from Jar A. If it lands tails, he picks two marbles at random with replacement from Jar B. Given that Vishnu picked one yellow and one green marble, what is the probability that they came from Jar B? (A) 4121 (B) 8949 (C) 8940 (D) 4120
›Reveal solutionSolution
P(E∣A)=53 (without replacement), P(E∣B)=4924 (with replacement); Bayes gives P(B∣E)=8940 — option (C).
Likelihoods of drawing one yellow and one green (E).
Jar A (3 yellow, 2 green; two draws without replacement):
P(E∣A)=(25)(13)(12)=106=53.
Jar B (4 yellow, 3 green; two draws with replacement):
P(E∣B)=2⋅74⋅73=4924.
Bayes' theorem with P(A)=P(B)=21 (the 21 cancels): …
- 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): …
- COMEDK 2024Set 2024-E1 markMCQQ.A coin is tossed until a head appears or until the coin has been tossed three times. Given that 'head' does not appear on the first toss, what is the probability that the coin is tossed thrice? (A) 21 (B) 83 (C) 81 (D) 41
›Reveal solutionSolution
Given the first toss is a tail, the coin is tossed a third time only if the second toss is also a tail — probability 21.
The coin stops the moment a head appears, or after three tosses. We are told the first toss is a tail (no head on toss 1).
Now the second toss decides:
- Head on toss 2 ⇒ stop after 2 tosses.
- Tail on toss 2 ⇒ a third toss is made. …
- COMEDK 2023Set 2023-E1 markMCQQ.A die is thrown twice and the sum of numbers appearing is observed to be 8 . What is the conditional probability that the number 5 has appeared atleast once? (A) 365 (B) 52 (C) 181 (D) 31
›Reveal solutionSolution
Given the sum is 8, the sample space is the 5 ordered pairs summing to 8; two of them include a 5, giving probability 52.
The ordered outcomes with sum 8 are
(2,6),(3,5),(4,4),(5,3),(6,2)(5 outcomes). …
- KCET 2025Set A-11 markMCQQ.Meera visits only one of the two temples A and B in her locality. Probability that she visits temple A is 52. If she visits temple A, 31 is the probability that she meets her friend, whereas it is 72 if she visits temple B. Meera met her friend at one of the two temples. The probability that she met her at temple B is (A) 167 (B) 165 (C) 163 (D) 169
›Reveal solutionSolution
The friend has already been met (the effect); we want the probability of the cause (temple B) — that reversal of conditioning is exactly Bayes' theorem.
Step 1 — Name the events.
Let A = "Meera visits temple A", B = "Meera visits temple B", F = "she meets her friend".
She visits only one of the two temples, so A and B are mutually exclusive and exhaustive:
P(A)=52⟹P(B)=1−52=53.
Given: P(F∣A)=31, P(F∣B)=72.
Step 2 — Why Bayes.
We are told the outcome (F happened) and asked for the probability of a cause (B). Bayes' theorem inverts the conditioning:
P(B∣F)=P(A)P(F∣A)+P(B)P(F∣B)P(B)P(F∣B).
The denominator is P(F) by the law of total probability — the friend can be met on either branch.
Step 3 — Compute the two branch probabilities.
P(A∩F)=52×31=152,P(B∩F)=53×72=356.
Step 4 — Total probability of meeting the friend. …
- 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) …
🎓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.