Q.Suppose you have two coins which appear identical in your pocket. You know that one is fair and one is 2-headed. If you take one out, toss it and get a head, what is the probability that it was a fair coin?
🔒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). …
The key idea is Conditional Probability — we update the probability of which coin was chosen based on the observed outcome (a head).
Step 1: Define events.
Let F = "fair coin chosen", T = "two-headed coin chosen", and H = "toss shows head".
Prior: P(F)=P(T)=21.
Step 2: Likelihoods.
P(H∣F)=21 (fair coin gives head half the time).
P(H∣T)=1 (two-headed coin always gives head).
Step 3: Apply Bayes' theorem. …
Using Bayes' theorem, the probability that the coin was fair given that a head was tossed is 31.
Why conditional probability is the right tool
The question asks: given that we observed a head, what’s the chance the coin was fair? That’s a classic inverse probability problem. We know the probabilities of heads if the coin is fair or two-headed, but we need to reverse the condition — from effect (head) back to cause (which coin). This is exactly what Bayes’ theorem does.
The intuition: a fair coin gives heads half the time, but a two-headed coin gives heads every time. So if we see a head, it’s more likely to have come from the two-headed coin. But we don’t know which coin we picked — each was equally likely at the start. Bayes’ theorem lets us update that initial 50–50 chance using the evidence.
Bayes’ theorem (for two events A and B):
P(A∣B)=P(B)P(B∣A)P(A)
Here A = “coin is fair”, B = “toss shows head”.
Step-by-step solution
-
Define the events clearly
Let F be the event that the chosen coin is fair.
Let H be the event that the toss shows a head.
We want P(F∣H).
-
Write down the prior probabilities
Since the two coins look identical and you pick one at random:
P(F)=21,P(not F)=21
- Write down the likelihoods
- If the coin is fair, probability of a head is 21:
P(H∣F)=21
- If the coin is two-headed, probability of a head is 1:
P(H∣not F)=1
- Find the total probability of getting a head By the law of total probability:
P(H)=P(H∣F)P(F)+P(H∣not F)P(not F)
Substitute:
P(H)=21⋅21+1⋅21=41+21=43
- Apply Bayes’ theorem …
Method: Bayes' Theorem (reverse the conditioning)
Use Bayes when you know P(effect∣cause) but want P(cause∣effect) — updating a prior after seeing evidence.
Steps
Step 1: List the causes with their prior probabilities.
Here the causes are "fair coin" and "two-headed coin", each with prior 21.
Step 2: Write each likelihood — the chance of the observed evidence under each cause.
P(head∣fair)=21, P(head∣two-headed)=1. …
Common Mistakes
Mistake 1: Answering 21 because "there are two coins".
Why it's wrong: observing a head is evidence — the two-headed coin produces heads twice as readily as the fair one — so the posterior for "fair" drops below 21. Correct approach: update the prior with the likelihoods via Bayes, giving 31.
Mistake 2: Forgetting the two-headed coin's likelihood in the denominator. …
Showing the 12 most recent of 45 on this concept.
- 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-A1 markMCQQ.A bag contains (n+1) coins. It is known that one of these coins has a head on both sides, whereas the other coins are fair. One of these coins is selected at random and tossed. If the probability that the toss results in heads is 127, then the value of n is : (A) 5 (B) 3 (C) 2 (D) 4
›Reveal solutionSolution
The key idea is to treat the coin selection as a two‑case partition (two‑headed coin vs. fair coins) and apply the law of total probability. Solving the resulting equation gives n=5, so the correct option is (A).
Concept and intuition
We have a mixed bag: one trick coin that always lands heads, and n fair coins that land heads with probability 21. When we pick a coin at random and toss it, the overall chance of heads is a weighted average of the two cases. The weight for the trick coin is n+11 (since there are n+1 coins total), and for any fair coin it’s n+1n. The problem gives that overall probability as 127, so we set up an equation and solve for n.
Step‑by‑step solution
- Define the events Let T be the event that the two‑headed coin is selected, and F the event that a fair coin is selected. Since selection is random,
P(T)=n+11,P(F)=n+1n.
- Conditional probabilities for heads If the trick coin is chosen, heads is certain:
P(heads∣T)=1.
If a fair coin is chosen, the chance of heads is 21:
P(heads∣F)=21.
- Apply the law of total probability The overall probability of heads is
P(heads)=P(T)⋅P(heads∣T)+P(F)⋅P(heads∣F).
Substituting the values:
P(heads)=n+11⋅1+n+1n⋅21.
- Simplify the expression
P(heads)=n+11+2(n+1)n=2(n+1)2+n.
- Set equal to the given probability The problem states this equals 127:
- 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 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 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. …
- KCET 2019Set A-11 markMCQQ.A man speaks truth 2 out of 3 times. He picks one of the natural numbers in the set S={1,2,3,4,5,6,7} and reports that it is even. The probability that it is actually even is (A) 52 (B) 51 (C) 101 (D) 53
›Reveal solutionSolution
By Bayes' theorem the probability is 53 — option (D).
The set S={1,2,3,4,5,6,7} has 3 even numbers (2,4,6) and 4 odd numbers, and one number is picked at random.
Let E = "the number is even" and R = "the man reports it as even."
Priors.
P(E)=73,P(Ec)=74.
Likelihoods. He tells the truth with probability 32 and lies with probability 31.
- If the number really is even, a truthful report says "even": P(R∣E)=32.
- If the number is odd, only a lie reports "even": P(R∣Ec)=31.
Bayes' theorem. …
- 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 2020Set A-11 markMCQQ.Events E1 and E2 form a partition of the sample space S. A is any event such that P(E1)=P(E2)=21, P(E2/A)=21 and P(A/E2)=32, then P(E1/A) is (A) 21 (B) 32 (C) 1 (D) 41
›Reveal solutionSolution
A partition's posterior probabilities must add to 1, so P(E1∣A)=1−P(E2∣A)=1−21=21.
Step 1 — What "partition of the sample space" means.
E1 and E2 form a partition of S if they are mutually exclusive (E1∩E2=∅) and exhaustive (E1∪E2=S), with non-zero probabilities. So exactly one of them must occur.
Step 2 — Conditioning preserves the partition.
Conditioning on an event A (with P(A)>0) just renormalises probabilities inside A; it does not destroy the partition. Formally,
A=(A∩E1)∪(A∩E2),(A∩E1)∩(A∩E2)=∅
Dividing by P(A):
P(A)P(A∩E1)+P(A)P(A∩E2)=P(A)P(A)=1
which is precisely
P(E1∣A)+P(E2∣A)=1
The posterior probabilities of a partition must still sum to 1 — a fact worth remembering, since it turns many Bayes questions into a one-line subtraction.
Step 3 — Substitute the given value.
P(E1∣A)=1−P(E2∣A)=1−21=21 …
- 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). …
- 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. …
- 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 2021Set 20211 markMCQQ.A student answers a multiple choice question with 5 alternatives, of which exactly one is correct. The probability that he knows the correct answer is p,0<p<1. If he knows the answer, he answers it correctly; if he does not know the answer, he guesses it, and the probability that he guesses correctly is 51. Given that he has answered the question correctly, the probability that he knew the correct answer is (A) 4p+33p (B) 3p+25p (C) 4p+15p (D) 3p+14p
›Reveal solutionSolution
By Bayes: P(K | correct) = P(K) P(correct | K) / P(correct) = p / [ (4p + 1)/5 ] = 5p/(4p + 1).
Concept: Bayes' theorem. (The stem is truncated, but this is the standard question: given that he answered correctly, find the probability that he actually knew the answer.)
Let K = he knows the answer, P(K) = p, so P(not K) = 1 - p.
If he knows it, he is certainly correct: P(correct | K) = 1.
If he does not know it, he guesses among 5 alternatives: P(correct | not K) = 1/5. …
🎓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.