Q.A bag contains (2n+1) coins. It is known that n of these coins have a head on both sides whereas the rest of the coins are fair. A coin is picked up at random from the bag and is tossed. If the probability that the toss results in a head is 4231, determine the value of n.
🔒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 (Law of Total Probability)
The bag has 2n+1 coins:
- n two-headed coins (probability of head = 1)
- (n+1) fair coins (probability of head = 21)
Step 1 – Probability of picking each type
P(two-headed)=2n+1n,
P(fair)=2n+1n+1.
Step 2 – Apply Law of Total Probability
P(Head)=P(two-headed)⋅1+P(fair)⋅21
=2n+1n+2(2n+1)n+1.
Step 3 – Simplify and equate to given probability …
The problem uses the law of total probability to combine the chances of picking a two-headed coin (always heads) and a fair coin (half heads). Solving the resulting equation gives n=10.
We have a bag with 2n+1 coins. Of these, n are two-headed (always show heads) and the remaining (2n+1)−n=n+1 are fair coins (one head, one tail). A coin is chosen at random and tossed once. The overall probability of getting a head is given as 4231. We need to find n.
The key idea is conditional probability — the total probability of heads is the weighted average of the head probabilities from each type of coin, where the weights are the probabilities of picking that type.
1. Define the events
Let:
- A = event that the chosen coin is two-headed.
- B = event that the chosen coin is fair.
- H = event that the toss shows a head.
We know:
- P(A)=2n+1n (since n out of 2n+1 coins are two-headed).
- P(B)=2n+1n+1 (the rest are fair).
- P(H∣A)=1 (a two-headed coin always gives heads).
- P(H∣B)=21 (a fair coin gives heads half the time).
2. Apply the law of total probability
The total probability of heads is:
P(H)=P(A)⋅P(H∣A)+P(B)⋅P(H∣B)
Substitute the values:
P(H)=(2n+1n)(1)+(2n+1n+1)(21)
3. Simplify the expression
Combine the terms over the common denominator 2n+1:
P(H)=2n+1n+2(2n+1)n+1
Write the first term with denominator 2(2n+1):
P(H)=2(2n+1)2n+2(2n+1)n+1=2(2n+1)2n+n+1=2(2n+1)3n+1
4. Set equal to the given probability …
Method: Law of total probability to build an equation in an unknown
Use this when a mixture (some biased coins, some fair) has an overall event probability given, and you must solve for an unknown count.
Steps
Step 1: Express each type's count and probability in terms of the unknown
If there are 2n+1 coins and n are two-headed, the rest are n+1 fair coins. Selection probabilities are 2n+1n and 2n+1n+1.
Step 2: Total probability of the event
P(H)=P(two-headed)⋅1+P(fair)⋅21. …
Common Mistakes
Mistake 1: Taking the number of fair coins as n
Why it's wrong: with 2n+1 coins total and n two-headed, the fair coins number (2n+1)−n=n+1. Correct approach: subtract to get n+1 fair coins.
Mistake 2: Wrong head probability for a coin type
Why it's wrong: a two-headed coin gives a head with probability 1 (not 21), and only the fair coin gives 21. Correct approach: assign 1 and 21 to the right types. …
Showing the 12 most recent of 30 on this concept.
- TG EAPCET 2022Set eng-2022-07-18-FN1 markMCQQ.Two balls are drawn at random from a bag containing 5 black balls and 3 white balls. If the random variable X denotes the number of white balls drawn, then the mean of X is (A) 21 (B) 85 (C) 43 (D) 83
›Reveal solutionSolution
The mean (expected value) of the number of white balls drawn when picking two balls without replacement from 5 black and 3 white balls is 43. The correct option is (C).
We are drawing two balls without replacement from a small finite set. The random variable X counts how many white balls appear. The mean (expected value) is just the average number of whites we’d see if we repeated the draw many times.
Key insight: Instead of listing all outcomes and probabilities, we can use the linearity of expectation. Each ball drawn is like a “mini-experiment”: define an indicator for whether the first ball is white, and another for the second. The expected number of whites is simply the sum of the probabilities that each individual draw yields a white ball. This works even though the draws are dependent — expectation adds regardless.
-
Define indicator variables
Let I1=1 if the first ball is white, 0 otherwise.
Let I2=1 if the second ball is white, 0 otherwise.
Then X=I1+I2.
-
Find the probability the first ball is white
Initially there are 3 white balls out of 8 total.
P(I1=1)=83.
- Find the probability the second ball is white By symmetry (or by the law of total probability), the chance the second ball is white is also 83. Why? Because without any information about the first draw, the second ball is equally likely to be any of the 8 original balls. So P(I2=1)=83. …
-
- TG EAPCET 2026Set eng-2026-05-09-FN1 markMCQQ.If P(A)=83, P(A∣B)=P(B∣A)=53, then P(A∩B)+P(B)= (A) 4021 (B) 132 (C) 143 (D) 125
›Reveal solutionSolution
We use the given conditional probabilities to set up equations for P(A∩B) and P(B), then solve and sum them. The result is 4021, which corresponds to option (A).
We are told:
- P(A)=83
- P(A∣B)=53
- P(B∣A)=53
We need P(A∩B)+P(B).
Concept and intuition
Conditional probabilities like P(A∣B) relate the probability of the complement of A given B to the joint probability P(A∩B). Since P(A∣B)=P(B)P(A∩B), we can write an equation linking P(B) and P(A∩B). Similarly, P(B∣A) gives a relation between P(A) and P(A∩B). This lets us solve for the unknowns.
Step-by-step solution
- Use P(B∣A) to find P(A∩B) By definition:
P(B∣A)=P(A)P(B∩A)=53
Since P(B∩A)=P(A)−P(A∩B), we have:
P(A)P(A)−P(A∩B)=53
Substitute P(A)=83:
8383−P(A∩B)=53
Multiply both sides by 83:
83−P(A∩B)=53⋅83=409
So:
P(A∩B)=83−409=4015−409=406=203
- Use P(A∣B) to find P(B) By definition:
P(A∣B)=P(B)P(A∩B)=53
Now P(A∩B)=P(B)−P(A∩B). Substitute P(A∩B)=203:
P(B)P(B)−203=53
Multiply both sides by P(B): …
- TG EAPCET 2025Set eng-2025-05-02-AN1 markMCQQ.Let P=147258369 be a matrix. Three elements of this matrix P are selected at random. A is the event of having the three elements whose sum is odd. B is the event of selecting the three elements which are in a row or column. Then P(A)+P(BA)= (A) 420221 (B) 2117 (C) 2021 (D) 23
›Reveal solutionSolution
We compute the probability that three randomly chosen entries sum to an odd number, then the conditional probability of that event given they lie in a single row or column, and add them. The result simplifies to 2117, which is option (B).
Concept & Intuition
The matrix has 9 entries. We pick 3 of them uniformly at random.
- For event A (odd sum), we need to count how many triples have an odd total. Since odd/even depends only on parity, we first classify the 9 numbers by parity: 1,3,5,7,9 are odd (5 odds); 2,4,6,8 are even (4 evens). The sum of three numbers is odd iff we have an odd number of odd entries among them — i.e., 1 or 3 odds.
- For event B (all in one row or one column), we count triples that lie entirely in a single row (3 rows, each row has 3 entries → 1 triple per row) or entirely in a single column (3 columns, each column has 3 entries → 1 triple per column). That gives 3+3=6 triples.
- Then P(A/B) is the fraction of those 6 triples that also have an odd sum.
We compute both probabilities and add them.
Step-by-step
- Total number of ways to choose 3 entries from 9
(39)=84.
- Count triples with odd sum (event A)
- Case 1: exactly 1 odd, 2 evens Choose 1 odd from 5 odds: (15)=5 Choose 2 evens from 4 evens: (24)=6 Total: 5×6=30 triples.
- Case 2: exactly 3 odds, 0 evens Choose 3 odds from 5 odds: (35)=10 Total: 10 triples.
- So ∣A∣=30+10=40. Hence
P(A)=8440=2110.
- Count triples in a row or column (event B)
- Rows: 3 rows, each row has exactly 1 triple (all three entries). So 3 triples.
- Columns: 3 columns, each column has exactly 1 triple. So 3 triples.
- Total: ∣B∣=6. Hence
P(B)=846=141.
- Count triples that are both in a row/column AND have odd sum (event A∩B) Check each row and column for odd sum: …
- TG EAPCET 2023Set eng-2023-05-12-FN1 markMCQQ.Two numbers b and c are chosen at random in succession without replacement from the set {1,2,3,…,9}. Then the probability that x2+bx+c>0, ∀x∈R is (A) 7229 (B) 8132 (C) 14345 (D) 12582
›Reveal solutionSolution
The condition x2+bx+c>0 for all real x is equivalent to the discriminant b2−4c<0. Counting ordered pairs (b,c) from {1,…,9} without replacement that satisfy b2<4c gives 29 favorable outcomes out of 72 total, so the probability is 7229, which is option (A).
Why this approach works
A quadratic x2+bx+c that is always positive (for every real x) must have no real roots and open upward. Since the coefficient of x2 is 1>0, the condition reduces to the discriminant being negative: b2−4c<0, i.e. b2<4c.
We are choosing b and c without replacement from {1,…,9}, so each ordered pair (b,c) with b=c is equally likely. The total number of such ordered pairs is 9×8=72. We just need to count how many of them satisfy b2<4c.
Step-by-step counting
1. Understand the inequality
We need b2<4c. Since c is an integer from 1 to 9, rewrite as c>4b2. For each b, we count the number of c values (different from b) that are strictly greater than b2/4.
2. Compute for each b
- b=1: b2/4=0.25, so c>0.25 means c≥1. All c from 1 to 9 except c=1 (since b=c) work. That gives 8 choices.
- b=2: b2/4=1, so c>1 means c≥2. Excluding c=2 leaves {3,4,5,6,7,8,9} → 7 choices.
- b=3: b2/4=2.25, so c>2.25 means c≥3. Excluding c=3 leaves {4,5,6,7,8,9} → 6 choices.
- b=4: b2/4=4, so c>4 means c≥5. Excluding c=4 (which isn't in this set anyway) gives {5,6,7,8,9} → 5 choices.
- b=5: b2/4=6.25, so c>6.25 means c≥7. Excluding c=5 (not in set) gives {7,8,9} → 3 choices.
- b=6: b2/4=9, so c>9 means c≥10, but max c is 9. No c works → 0 choices. …
- TG EAPCET 2021Set eng-2021-08-04-FN1 markMCQQ.If 22Pr+1:20Pr+2=11:52 then r= (A) 3 (B) 5 (C) 7 (D) 9
›Reveal solutionSolution
This problem involves simplifying a ratio of permutations using the permutation formula and then solving the resulting algebraic equation. We find that r=7.
Concept and Intuition
Permutations deal with the arrangement of distinct items. The number of permutations of r items chosen from n distinct items is denoted by nPr and calculated using the formula:
nPr=(n−r)!n!
For this formula to be valid, certain conditions must be met:
- n must be a non-negative integer.
- r must be a non-negative integer.
- n≥r. This ensures that the term (n−r)! is well-defined (i.e., we do not have a factorial of a negative number).
In this problem, we are given a ratio of two permutation expressions. The key to solving such problems is to:
- Apply the permutation formula to expand each term.
- Simplify the resulting factorial expressions by cancelling common terms. Remember that k!=k×(k−1)! and generally k!=k×(k−1)×⋯×(k−m+1)×(k−m)!. This property is crucial for simplifying ratios of factorials.
- Solve the algebraic equation for r.
- Finally, check if the obtained value of r satisfies the conditions for permutations for both terms in the original problem.
Let's apply these ideas to the given problem.
Step-by-step Solution
-
Write down the given ratio and apply the permutation formula.
We are given the ratio 20Pr+222Pr+1=5211.
Using the formula nPr=(n−r)!n!:
- For 22Pr+1: n=22, rperm=r+1. So, 22Pr+1=(22−(r+1))!22!=(21−r)!22!.
- For 20Pr+2: n=20, rperm=r+2. So, 20Pr+2=(20−(r+2))!20!=(18−r)!20!.
Substituting these into the ratio:
(18−r)!20!(21−r)!22!=5211
- Simplify the expression by rearranging and expanding factorials. We can rewrite the left side by inverting the denominator and multiplying:
(21−r)!22!×20!(18−r)!=5211
Now, we expand the larger factorials in terms of smaller ones to facilitate cancellation: * $22! = 22 \times 21 \times 20!$ * $(21-r)! = (21-r) \times (20-r) \times (19-r) \times (18-r)!$ Substitute these expansions into the equation:(21−r)(20−r)(19−r)(18−r)!22×21×20!×20!(18−r)!=5211
- Cancel common factorial terms. Notice that 20! in the numerator and denominator cancel out. Similarly, (18−r)! in the numerator and denominator cancel out:
(21−r)(20−r)(19−r)22×21=5211
Calculate the product in the numerator: $22 \times 21 = 462$.(21−r)(20−r)(19−r)462=5211
- Solve the algebraic equation for r. …
- TG EAPCET 2026Set eng-2026-05-10-AN1 markMCQQ.A card is drawn randomly from a well shuffled pack of 52 cards. If A is the event of getting a diamond card and B is the event of getting an ace card, then the probability that exactly one of the events among A and B to occur is (A) 5215 (B) 134 (C) 5217 (D) 135
›Reveal solutionSolution
The probability that exactly one of the events A (diamond) or B (ace) occurs is the sum of their individual probabilities minus twice the probability of both occurring. The result is 5215, which corresponds to option (A).
We want the probability that exactly one of the two events happens — that is, either we draw a diamond that is not an ace, or we draw an ace that is not a diamond. This is a classic "exclusive or" (XOR) situation.
Why this approach works:
If we simply add P(A)+P(B), we count the case where both occur (the ace of diamonds) twice. To get exactly one, we subtract that double-counted overlap once more than usual — hence P(A)+P(B)−2P(A∩B).
-
Identify the probabilities of each event individually.
- There are 13 diamonds in a deck of 52, so P(A)=5213=41.
- There are 4 aces, so P(B)=524=131.
-
Find the probability that both events occur (the intersection).
- Only one card is both a diamond and an ace: the ace of diamonds.
- So P(A∩B)=521.
-
Apply the formula for exactly one event.
- Exactly one of A or B occurs means: (A and not B) or (B and not A).
- The probability is:
P(exactly one)=P(A)+P(B)−2P(A∩B)
- Substitute the values:
5213+524−2⋅521=5213+4−2=5215
- Check against the options. …
-
- TG EAPCET 2021Set eng-2021-08-04-AN1 markMCQQ.A non-zero integer x is selected randomly from the set of integers {x∈Z/−25≤x≤25,x=0}. The probability that x+6≤x135 is (A) 2512 (B) 52 (C) 53 (D) 2514
›Reveal solutionSolution
We need to find the probability that a non-zero integer x from the set {−25,…,25} satisfies the inequality x+6≤x135. We first determine the total number of possible integers (the sample space), which is 50. Then, we solve the inequality to find the integers that satisfy it within the given range (the event space), which are 20 integers. The probability is 52.
The problem asks for a probability, which is defined as the ratio of the number of favorable outcomes to the total number of possible outcomes. Our strategy will be to first identify the complete set of possible integers x (the sample space) and count them. Then, we will solve the given inequality to find which of these integers satisfy the condition (the event space) and count those. Finally, we will compute the ratio.
-
Determine the Sample Space:
The problem states that x is a non-zero integer selected from the set {x∈Z/−25≤x≤25,x=0}.
This means x can be any integer from −25 to 25, but x cannot be 0.
The integers in this range are {−25,−24,…,−1,0,1,…,24,25}.
The total count of integers from −25 to 25 (inclusive) is 25−(−25)+1=51.
Since x=0, we must exclude 0 from this count.
Therefore, the total number of possible outcomes (the size of the sample space) is 51−1=50.
-
Solve the Inequality:
We need to find the integers x that satisfy the inequality x+6≤x135.
To solve rational inequalities, the most reliable method is to move all terms to one side and combine them into a single fraction. This avoids potential errors that arise from multiplying by a variable whose sign is unknown.
x+6−x135≤0
To combine these terms, we find a common denominator, which is x:
xx⋅x+x6⋅x−x135≤0
xx2+6x−135≤0
-
Factor the Numerator:
Now, we need to find the roots of the quadratic expression in the numerator, x2+6x−135=0. We can use the quadratic formula x=2a−b±b2−4ac:
x=2(1)−6±62−4(1)(−135)
x=2−6±36+540
x=2−6±576
Recognizing that 242=576, we have:
x=2−6±24
This gives two roots:
x1=2−6−24=2−30=−15
x2=2−6+24=218=9
So, the numerator can be factored as (x−(−15))(x−9)=(x+15)(x−9).
The inequality now becomes x(x+15)(x−9)≤0.
Watch outA common mistake is to multiply both sides of the inequality by x. This is incorrect because the sign of x is unknown. If x is negative, multiplying by x would reverse the inequality sign. If x is positive, it would not. Handling these two cases separately is cumbersome and prone to error. The method of moving all terms to one side and analyzing critical points is more robust.
-
Determine Intervals Satisfying the Inequality:
The critical points are the values of x where the numerator or the denominator is zero. These are x=−15, x=0, and x=9. These points divide the number line into four intervals. We will test a value from each interval to determine the sign of the expression x(x+15)(x−9).
Interval Test Value (x) Sign of (x+15) Sign of (x−9) Sign of x Sign of x(x+15)(x−9) Condition ≤0 x<−15 −20 Negative Negative Negative (−)(−)(−)=(−) True −15<x<0 −1 Positive Negative Negative (−)(+)(−)=(+) False
-
- TG EAPCET 2024Set eng-2024-05-11-FN1 markMCQQ.The numbers 2, 3, 5, 7, 11, 13 are written on six distinct paper chits. If 3 of them are chosen at random, then the probability that the sum of the numbers on the obtained chits is divisible by 3, is (A) 207 (B) 206 (C) 205 (D) 51
›Reveal solutionSolution
The key idea is to classify each number by its remainder modulo 3, then count only those 3‑card combinations whose remainders sum to a multiple of 3. The probability is 207, which corresponds to option (A).
We have six numbers: 2, 3, 5, 7, 11, 13.
We pick 3 at random. The total number of ways is (36)=20.
We want the probability that the sum of the three chosen numbers is divisible by 3.
Why classify by remainder?
A number’s remainder modulo 3 determines whether it contributes 0, 1, or 2 to the total sum mod 3. The sum of three numbers is divisible by 3 exactly when the sum of their remainders is 0 mod 3. This turns a problem about specific numbers into a simple counting problem about remainder classes.
Step-by-step
-
Find each number’s remainder mod 3
- 2≡2
- 3≡0
- 5≡2
- 7≡1
- 11≡2
- 13≡1
So we have:
- Remainder 0: {3} → 1 number
- Remainder 1: {7, 13} → 2 numbers
- Remainder 2: {2, 5, 11} → 3 numbers
-
Which remainder combinations sum to 0 mod 3?
Let (r1, r2, r3) be the remainders of the three chosen numbers. We need r1+r2+r3≡0(mod3).
The possible triples (order doesn’t matter) are:
- (0,0,0) — all three have remainder 0
- (1,1,1) — all three have remainder 1
- (2,2,2) — all three have remainder 2
- (0,1,2) — one of each remainder
No other triple works (e.g., (0,0,1) sums to 1, etc.).
-
Count the number of 3‑card combinations for each case
- (0,0,0): Only 1 number with remainder 0, so impossible. Count = 0. …
-
- TG EAPCET 2021Set eng-2021-08-04-FN1 markMCQQ.If P(BA)=103, P(AB)=54 and P(A∪B)=KP(B), then K1= (A) 4940 (B) 4340 (C) 101100 (D) 1
›Reveal solutionSolution
The key idea is to use the definitions of conditional probability to relate P(A∩B) to P(A) and P(B), then express P(A∪B) in terms of P(B) alone. The result is K1=4340.
We are given two conditional probabilities and a relation involving the union. The goal is to find K1, where P(A∪B)=KP(B). This is a problem about linking conditional probabilities to the basic probability of events, so we start by writing down what each conditional means.
Recall: P(A/B)=P(B)P(A∩B) and P(B/A)=P(A)P(A∩B). These are not symmetric — each gives a different ratio. Our job is to use them to find P(A) and P(A∩B) in terms of P(B), then compute P(A∪B).
- From P(A/B) we get P(A∩B) in terms of P(B).
P(A/B)=103⇒P(B)P(A∩B)=103
So
P(A∩B)=103P(B).
- From P(B/A) we get P(A) in terms of P(A∩B).
P(B/A)=54⇒P(A)P(A∩B)=54
Hence
P(A)=45P(A∩B).
- Substitute the expression for P(A∩B) from step 1 into step 2.
P(A)=45⋅103P(B)=4015P(B)=83P(B).
So P(A) is 83 of P(B).
- Now write P(A∪B) using the inclusion-exclusion formula.
P(A∪B)=P(A)+P(B)−P(A∩B).
Substitute the expressions we have:
P(A∪B)=83P(B)+P(B)−103P(B).
- Combine the terms over a common denominator. …
- TG EAPCET 2025Set eng-2025-05-02-AN1 markMCQQ.A, B1, B2, B3 are the events in a random experiment. If P(B1)=0.25, P(B2)=0.30, P(B3)=0.45, P(B1A)=0.05, P(B2A)=0.04, P(B3A)=0.03, then P(AB2)= (A) 196 (B) 198 (C) 1912 (D) 195
›Reveal solutionSolution
This is a classic Bayes’ theorem problem: we are given prior probabilities for three mutually exclusive events and the conditional probabilities of A given each, and we need the posterior probability of B2 given A. The answer is 196, which corresponds to option (A).
We start with the concept: Bayes’ theorem lets us “reverse” conditional probabilities. Here, we know P(A∣Bi) and want P(B2∣A). The key is that the Bi form a partition of the sample space (they are the only possible “causes” of A), so we can compute P(A) using the law of total probability, then apply Bayes’ formula.
-
Identify the given data
- P(B1)=0.25, P(B2)=0.30, P(B3)=0.45
- P(A∣B1)=0.05, P(A∣B2)=0.04, P(A∣B3)=0.03 The events B1,B2,B3 are mutually exclusive and exhaustive (their probabilities sum to 1), so they form a partition.
-
Compute the total probability of A
By the law of total probability:
P(A)=P(B1)P(A∣B1)+P(B2)P(A∣B2)+P(B3)P(A∣B3)
Substitute:
P(A)=(0.25)(0.05)+(0.30)(0.04)+(0.45)(0.03)
Calculate each term:
- 0.25×0.05=0.0125
- 0.30×0.04=0.0120
- 0.45×0.03=0.0135 Sum:
P(A)=0.0125+0.0120+0.0135=0.0380
- Apply Bayes’ theorem for P(B2∣A) Bayes’ theorem states:
-
- TG EAPCET 2026Set eng-2026-05-10-FN1 markMCQQ.Three persons A, B, C planned to have a running race among themselves. If the probability that A wins the race is thrice that of B and the probability that B wins the race is 23 times that of C, then the difference in probabilities of A and C to win the race is (A) 32 (B) 21 (C) 145 (D) 73
›Reveal solutionSolution
With P(A)=149, P(C)=142, the difference is P(A)−P(C)=21.
Let P(C)=p. Then P(B)=23p and P(A)=3P(B)=29p.
The three probabilities sum to 1 (one of them must win):
29p+23p+p=7p=1 ⇒ p=71.
Hence
P(A)=29⋅71=149,P(C)=71=142. …
- TG EAPCET 2022Set eng-2022-07-19-FN1 markMCQQ.If A and B are two events of a random experiment such that P(A)=32, P(B)=154 and P(A∩B)=51, then 195[P(B∣(A∪B))+P(A∪B)]= (A) 9 (B) 11 (C) 13 (D) 15
›Reveal solutionSolution
This problem requires us to calculate probabilities of various event combinations (complement, intersection, union) and a conditional probability using fundamental set theory identities. We then substitute these values into the given expression to find the final numerical result. The final value is 11.
To solve this problem, we need to systematically break down the given expression and calculate each probability term using the fundamental rules of probability and set theory. The key is to correctly apply the formulas for complements, unions, intersections, and conditional probabilities, often using set identities to simplify complex event descriptions.
Here's a step-by-step approach:
-
Determine P(A) from P(A):
The probability of an event A and its complement A always sum to 1.
P(A)+P(A)=1
Given P(A)=32, we can find P(A):
P(A)=1−P(A)=1−32=31.
-
Determine P(A∩B) using P(A∩B):
The event A can be partitioned into two mutually exclusive events: A∩B (A and B both occur) and A∩B (A occurs, but B does not).
P(A)=P(A∩B)+P(A∩B)
We are given P(A∩B)=51 and we found P(A)=31.
So, P(A∩B)=P(A)−P(A∩B)=31−51.
To subtract these fractions, we find a common denominator, which is 15:
P(A∩B)=155−153=152.
-
Calculate P(A∪B):
The probability of the union of two events A and B is given by the addition rule.
P(A∪B)=P(A)+P(B)−P(A∩B)
We have P(A)=31, P(B)=154 (given), and P(A∩B)=152 (from Step 2).
P(A∪B)=31+154−152.
Using a common denominator of 15:
P(A∪B)=155+154−152=155+4−2=157.
This is the first part of the sum inside the square root.
-
Prepare for P(B∣(A∪B)): Identify the intersection term:
The conditional probability P(X∣Y) is defined as P(Y)P(X∩Y). Here, X=B and Y=(A∪B).
So, we need to find P(B∩(A∪B)).
Using the distributive property of set intersection over union:
B∩(A∪B)=(B∩A)∪(B∩B).
The event B∩B means that event B occurs AND event B does NOT occur, which is impossible. Thus, B∩B=∅.
So, B∩(A∪B)=(B∩A)∪∅=B∩A.
Therefore, P(B∩(A∪B))=P(A∩B).
From Step 2, we know P(A∩B)=152. This is the numerator for our conditional probability.
-
Prepare for P(B∣(A∪B)): Calculate P(B):
Similar to Step 1, we use the complement rule for event B.
P(B)=1−P(B).
Given P(B)=154:
P(B)=1−154=1515−4=1511.
-
Prepare for P(B∣(A∪B)): Calculate P(A∪B):
This is the denominator for our conditional probability. We use the addition rule for A and B.
P(A∪B)=P(A)+P(B)−P(A∩B)
We have P(A)=31 (from Step 1), P(B)=1511 (from Step 5), and P(A∩B)=51 (given).
P(A∪B)=31+1511−51.
Using a common denominator of 15: …
-
🎓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.