Q.Prove that
🔒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). …
Key Idea: Partition of the Sample Space
The events B and B′ are mutually exclusive and exhaustive — they form a partition of the sample space. Any event A can be split into the part inside B and the part outside B.
Proof of (i):
Since A=(A∩B)∪(A∩B′) and the two intersections are disjoint, by the addition rule of probability:
P(A)=P(A∩B)+P(A∩B′)
Proof of (ii):
The union A∪B can be written as the disjoint union of three parts:
A∪B=(A∩B)∪(A∩B′)∪(A′∩B) …
These two identities are direct consequences of the partition rule (law of total probability) applied to a sample space split by event B and its complement B′.
- P(A)=P(A∩B)+P(A∩B′)
- P(A∪B)=P(A∩B)+P(A∩B′)+P(A′∩B)
The Core Idea: Partitioning the Sample Space
Probability is about measuring the "weight" of an event within a sample space S. A powerful trick is to split S into disjoint pieces whose probabilities add up cleanly. Here, the natural split is by event B and its complement B′ — because every outcome either belongs to B or not. This is called a partition of S.
Partition Rule (Law of Total Probability)
If B and B′ partition S, then for any event A:
P(A)=P(A∩B)+P(A∩B′)
Why does this work? Because A is the union of two mutually exclusive parts: the part of A that lies inside B, and the part of A that lies outside B. Since these two parts cannot overlap (an outcome cannot be both in B and not in B), their probabilities simply add.
Proving (i) P(A)=P(A∩B)+P(A∩B′)
-
Visualise the sets. Draw a Venn diagram with two overlapping circles A and B. The region A is split into two non-overlapping subregions: the lens where A and B overlap (A∩B), and the crescent of A outside B (A∩B′). These two pieces together cover every outcome in A and share no outcomes.
-
Write the union. Since A∩B and A∩B′ are disjoint:
A=(A∩B)∪(A∩B′)
- Apply the probability axiom. For mutually exclusive events, the probability of the union is the sum of the probabilities:
P(A)=P(A∩B)+P(A∩B′)
That's it — the identity follows directly from the definition of a partition and the additivity axiom of probability.
A common mistake is to think P(A∩B′)=P(A)−P(B). This is false in general. The correct subtraction is P(A)−P(A∩B), which is exactly what the identity gives when rearranged.
Proving (ii) P(A∪B)=P(A∩B)+P(A∩B′)+P(A′∩B)
-
Think of the union as three disjoint pieces. The union A∪B consists of:
- Outcomes in both A and B: A∩B
- Outcomes in only A (not in B): A∩B′
- Outcomes in only B (not in A): A′∩B
These three regions are mutually exclusive — no outcome can be in more than one of them. Together they cover every outcome that is in A or B (or both).
-
Write the union as a disjoint union:
A∪B=(A∩B)∪(A∩B′)∪(A′∩B) …
Method: Proving Probability Identities by Partitioning into Disjoint Pieces
Use this to prove set-based probability identities — the strategy is always to write an event as a union of disjoint pieces, then add.
Steps
Step 1: Split by an event and its complement.
B and B′ partition the sample space, so any event A splits as the disjoint union
A=(A∩B)∪(A∩B′).
Step 2: Use additivity for disjoint events.
For mutually exclusive events probabilities add, giving P(A)=P(A∩B)+P(A∩B′). …
Common Mistakes
Mistake 1: Writing P(A∩B′)=P(A)−P(B).
Why it's wrong: the part of A outside B is P(A)−P(A∩B), not P(A)−P(B). Correct approach: subtract the overlap P(A∩B), which is exactly what identity (i) rearranges to.
Mistake 2: Adding probabilities of pieces that are not disjoint.
Why it's wrong: additivity requires mutually exclusive events; A∩B, A∩B′, A′∩B must first be shown pairwise disjoint. Correct approach: verify disjointness, then add. …
Showing the 12 most recent of 30 on this concept.
- 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 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.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 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: …
-
- 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-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 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 2024Set eng-2024-05-11-FN1 markMCQQ.If 4 letters are selected at random from the letters of the word PROBABILITY, then the probability of getting a combination of letters in which atleast one letter is repeated is (A) 17043 (B) 6119 (C) 18457 (D) 15529
›Reveal solutionSolution
The multiset PROBABILITY has 9 distinct letters (with B and I each twice). Total 4-letter selections =183; those with a repeat =57, so the probability is 18357=6119, option (B).
Letters of PROBABILITY: P,R,O,B,A,B,I,L,I,T,Y — 11 letters, 9 distinct types, with B and I appearing twice each.
Step 1 — Total number of 4-letter selections (order does not matter).
Count by repetition pattern:
- All four distinct: (49)=126.
- Exactly one repeated pair (B or I) plus two other distinct letters: 2×(28)=2×28=56.
- Two repeated pairs, i.e. {B,B,I,I}: 1 way. …
- TG EAPCET 2022Set eng-2022-07-18-FN1 markMCQQ.A pair of dice is thrown twice in succession. The probability of getting prime numbers on both the dice in first throw and composite numbers on both the dice in second throw is (A) 2161 (B) 161 (C) 361 (D) 91
›Reveal solutionSolution
The key idea is to treat the two throws as independent events, multiply their probabilities, and note that each die has 3 prime numbers (2,3,5) and 2 composite numbers (4,6) — 1 is neither. The final probability is 161.
We start by recalling what “prime” and “composite” mean for the numbers 1 through 6 on a standard die.
- Prime numbers on a die: 2, 3, 5 (three numbers).
- Composite numbers on a die: 4, 6 (two numbers).
- Neither: 1 (not prime, not composite).
The problem asks: first throw — both dice show primes; second throw — both dice show composites. The two throws are independent, so we multiply probabilities.
- Probability of both dice showing primes in the first throw For one die, P(prime)=63=21. Since the two dice are independent,
P(both prime)=21×21=41.
- Probability of both dice showing composites in the second throw For one die, P(composite)=62=31. So,
P(both composite)=31×31=91.
- Combine the two independent events …
- TG EAPCET 2022Set eng-2022-07-20-AN1 markMCQQ.If X is a Poisson variate such that 35k=P(X=2)=P(X=3), then P(X=5)= (A) k (B) 41k (C) 21k (D) 43k
›Reveal solutionSolution
We use the Poisson Probability Mass Function to equate P(X=2) and P(X=3), which allows us to determine the parameter λ. Once λ is known, we can express P(X=5) in terms of k. The result is P(X=5)=43k.
The Poisson distribution is a discrete probability distribution that models the number of events occurring in a fixed interval of time or space, given a constant average rate of occurrence and independence of events. It is characterized by a single parameter, λ (lambda), which represents the average number of events in the given interval.
The core idea here is to use the given equality of probabilities, P(X=2)=P(X=3), to find the value of this parameter λ. Once λ is known, we can calculate any other probability P(X=x) using the Poisson Probability Mass Function (PMF). We are also given a relationship involving k, which we will use to express our final answer in terms of k.
-
Recall the Poisson Probability Mass Function (PMF):
For a Poisson variate X with parameter λ, the probability of observing exactly x events is given by:
P(X=x)=x!e−λλx
where x=0,1,2,… and λ>0.
-
Use the given condition P(X=2)=P(X=3) to find λ:
Substitute x=2 and x=3 into the PMF:
P(X=2)=2!e−λλ2
P(X=3)=3!e−λλ3
Equating these two probabilities:
2!e−λλ2=3!e−λλ3
Since e−λ is never zero and λ must be positive (as probabilities are non-zero), we can divide both sides by e−λλ2:
2!1=3!λ
Recall that 2!=2×1=2 and 3!=3×2×1=6.
21=6λ
Multiply both sides by 6 to solve for λ:
λ=26=3
So, the parameter of the Poisson distribution is λ=3.
-
Express k in terms of λ (and e−λ):
We are given that 35k=P(X=2).
We know P(X=2)=2!e−λλ2. Substitute λ=3:
P(X=2)=2e−332=29e−3
Now, equate this to 35k:
35k=29e−3
Solve for k:
k=53×29e−3=1027e−3
-
Calculate P(X=5) using λ=3: …
-
- TG EAPCET 2023Set eng-2023-05-13-AN1 markMCQQ.If X is a Poisson variate satisfying the condition 3P(x=2)=P(x=4) then P(x=6)= (A) 5e6162 (B) 5e6108 (C) 5e6324 (D) 5e6648
›Reveal solutionSolution
The key idea is to use the Poisson probability mass function P(X=k)=k!e−λλk, set up the given condition 3P(X=2)=P(X=4), solve for λ, then compute P(X=6) and match it to one of the options. The final result is 5e6324, which corresponds to option (C).
We start with the Poisson distribution. A Poisson random variable X with mean λ has probability mass function
P(X=k)=k!e−λλk,k=0,1,2,…
The problem gives a relationship between P(X=2) and P(X=4). This lets us solve for λ, the only unknown parameter. Once we know λ, we can compute P(X=6) directly.
- Write the given condition in terms of λ. We have 3P(X=2)=P(X=4). Substituting the Poisson formula:
3⋅2!e−λλ2=4!e−λλ4
- Cancel the common factor e−λ (since e−λ>0 for any finite λ). This gives:
3⋅2λ2=24λ4
- Simplify both sides. Left: 3⋅2λ2=23λ2. Right: 24λ4. So:
23λ2=24λ4
- Solve for λ. Multiply both sides by 24:
24⋅23λ2=λ4⇒36λ2=λ4
Rearranging:
λ4−36λ2=0⇒λ2(λ2−36)=0
Since λ>0 for a Poisson distribution (mean cannot be zero if we have nonzero probabilities for k=2,4), we take λ2=36, so λ=6. …
- 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. …
-
🎓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.