Q.A coin is tossed twice, what is the probability that atleast one tail occurs?
Concept understanding — Classical Probability
Classical Probability: The "Fair Game" Definition
Imagine you roll a fair six-sided die. Before it lands, you know there are exactly six possible outcomes — 1, 2, 3, 4, 5, or 6 — and you have no reason to believe any one face is more likely than another. That gut feeling of "all outcomes are equally likely" is the entire foundation of classical probability.
The Intuition
Classical probability was born from games of chance — dice, coins, cards. In these settings, the physical symmetry of the objects (a balanced die, a fair coin) guarantees that no outcome is favoured. So the probability of an event is simply:
Number of ways the event can happen, divided by the total number of possible outcomes.
If you want the chance of rolling an even number on a die, count the evens: 2, 4, 6 — that's 3 ways. Total outcomes: 6. So probability = 3/6=1/2.
This is the "counting" approach. It works beautifully when the underlying experiment is symmetric and finite.
The Precise Statement
P(E)=Total number of equally likely outcomesNumber of outcomes favourable to event E
This is called the classical definition (or a priori definition) of probability. It was formalised by Pierre-Simon Laplace in the 18th century.
Three conditions must hold for this definition to apply:
- Finite sample space — there are only a fixed, countable number of possible outcomes.
- Equally likely outcomes — each outcome has the same chance of occurring (the "fairness" condition).
- Mutually exclusive outcomes — no two outcomes can happen at the same time.
The biggest mistake students make is applying classical probability to situations where outcomes are not equally likely. For example: "I can either pass or fail the exam — two outcomes, so probability of passing is 1/2." That's nonsense, because passing and failing are not equally likely. The die works only because the die is fair.
A Simple Example
Problem: A bag contains 3 red marbles and 2 blue marbles. You pick one marble at random. What is the probability it is red?
Step 1 — Identify the sample space: There are 5 marbles total. If the marbles are physically identical except for colour, and you pick without looking, each marble is equally likely to be chosen. So total outcomes = 5.
Step 2 — Count favourable outcomes: 3 marbles are red. So favourable outcomes = 3.
Step 3 — Apply the formula:
P(red)=53
That's it. No deeper theory needed for this case.
When Classical Probability Fails
Classical probability cannot handle:
- Infinite outcomes (e.g., "pick any real number between 0 and 1")
- Unequally likely outcomes (e.g., "will it rain tomorrow?")
- Situations where "equally likely" is not physically justified
For those, we need other definitions — relative frequency (based on repeated experiments) or axiomatic probability (Kolmogorov's modern framework). But classical probability remains the cleanest starting point, and it's still the go-to method for most exam problems involving dice, coins, cards, and lotteries.
In exam problems, the phrase "at random" or "fair" is your signal that classical probability applies. If you see "randomly selected" without further qualification, assume equally likely outcomes unless told otherwise.
Classical Probability is the starting definition used throughout the NCERT Class 11 Mathematics chapter on Probability, matching searches like "classical probability: formula and examples" or "probability important questions class 11 maths". This equally-likely-outcomes approach to dice, coins, and cards is one of the most frequently tested question types in CBSE boards and competitive exams like JEE Main and state CETs.
The key idea is Classical Probability: when all outcomes are equally likely, P=total outcomesfavourable outcomes.
Step 1: List the sample space for two coin tosses.
S={HH,HT,TH,TT}, so total outcomes =4.
Step 2: Identify favourable outcomes — at least one tail means one or two tails.
Favourable: {HT,TH,TT}, so count =3.
Step 3: Apply the formula.
P(at least one tail)=43.
The probability is 43.
The probability of at least one tail in two coin tosses is 43, found by counting the favourable outcomes (HT, TH, TT) out of the four equally likely outcomes.
Why Classical Probability Works Here
When a fair coin is tossed, each toss has two equally likely outcomes: head (H) or tail (T). Since the tosses are independent, the sample space for two tosses consists of all ordered pairs. Classical probability says: if all outcomes are equally likely, the probability of an event is simply the number of favourable outcomes divided by the total number of outcomes. No formulas to memorise — just careful counting.
The common mistake is to think "at least one tail" means "not both heads", which is exactly right. But students often forget that "at least one" includes the case of two tails as well.
Do not confuse "at least one tail" with "exactly one tail". The phrase "at least one" includes both one tail and two tails.
Step-by-step solution
- List the sample space. For two tosses, the possible outcomes are:
S={HH,HT,TH,TT}
There are 2×2=4 equally likely outcomes.
- Identify the favourable outcomes. "At least one tail" means we want outcomes that contain a T in either the first toss, the second toss, or both. These are:
{HT,TH,TT}
That is 3 outcomes.
- Apply the probability formula.
P(at least one tail)=total number of outcomesnumber of favourable outcomes=43
A faster way: the complement of "at least one tail" is "no tails", which means both heads (HH).
P(at least one tail)=1−P(both heads)=1−41=43
This is often quicker and reduces counting errors.
The probability that at least one tail occurs is 43.
Showing the 12 most recent of 21 on this concept.
- COMEDK 2026Set 2026-A1 markMCQQ.A coffee roaster has 12 rare coffee beans with intensity scores ranked from 1 (mildest) to 12 (strongest). You choose 7 beans at random and line them up from mildest to strongest: C1<C2<C3<C4<C5<C6<C7. What is the probability that the third bean (C3) has an intensity score of exactly 4? (A) 41 (B) 4421 (C) 185 (D) 13235
›Reveal solutionSolution
This is an order-statistic probability for 7 beans drawn from ranks 1–12. The favourable count is (24)(47)=210 out of (712)=792, giving 792210=13235 — option (D).
NoteThe stem as stored is truncated after "C1" (the full chain C1<C2<⋯<C7 and the exact position asked for did not survive extraction). Committing to the official key 13235, the reconstruction below is the order-statistic event that reproduces it exactly: the probability that the 3rd mildest of the 7 chosen beans has intensity rank 5 (equivalently, by symmetry, that the 5th has rank 8).
Concept & Intuition
Choosing 7 beans from 12 distinct ranks and lining them up mildest-to-strongest turns each chosen bean into an order statistic Ci. The event "C3=5" means: bean 5 is chosen, exactly 2 chosen beans lie below it (ranks 1–4), and the remaining 4 chosen beans lie above it (ranks 6–12).
Step-by-step solution
- Total ways to choose 7 beans from 12:
(712)=792.
- Favourable ways for C3=5:
- Bean 5 is fixed as chosen: 1 way.
- Choose 2 beans below rank 5, i.e. from {1,2,3,4} (4 beans): (24)=6.
- Choose 4 beans above rank 5, i.e. from {6,7,…,12} (7 beans): (47)=35.
Favourable=6×1×35=210.
- Probability:
P=792210=13235.
✓Final answerProbability =13235 — option (D).
ANSWER: D
- COMEDK 2026Set 2026-A1 markMCQQ.Cards are numbered from 12 to 51 . Two cards are drawn one after the other without replacement. Find the probability that one card is a multiple of 6 and the other card is a multiple of 8. (A) 523 (B) 1567 (C) 654 (D) 1958
›Reveal solutionSolution
The probability is found by counting favorable unordered pairs (one multiple of 6, one multiple of 8) divided by total unordered pairs from cards 12–51. The result simplifies to 1958, which corresponds to option (D).
We have cards numbered 12 through 51 inclusive. That’s 51−12+1=40 cards. We draw two without replacement, order doesn’t matter for the event “one is a multiple of 6 and the other is a multiple of 8.” So we can think in terms of combinations.
1. Identify the multiples in the range
First, find how many multiples of 6 are between 12 and 51 inclusive.
Multiples of 6: 12, 18, 24, 30, 36, 42, 48 → that’s 7 numbers.
Multiples of 8: 16, 24, 32, 40, 48 → that’s 5 numbers.
But note: 24 and 48 appear in both lists. These are multiples of LCM(6,8)=24.
We must be careful: the event “one card is a multiple of 6 and the other is a multiple of 8” includes the possibility that the multiple-of-6 card is also a multiple of 8 (i.e., a multiple of 24) as long as the other card is a multiple of the other type. But if both cards are multiples of 24, that would count as both being multiples of 6 and both being multiples of 8 — that’s not allowed because we need exactly one of each type? Let’s read carefully: “one card is a multiple of 6 and the other card is a multiple of 8.” This means one card satisfies “multiple of 6” and the other satisfies “multiple of 8.” It does not forbid the multiple-of-6 card from also being a multiple of 8, as long as the other card is a multiple of 8. But if both are multiples of 24, then each is both a multiple of 6 and 8 — that would satisfy “one is multiple of 6 and the other is multiple of 8” because you can assign the labels. So such a pair is valid.
Thus we count unordered pairs where one card is from set A = multiples of 6, the other from set B = multiples of 8, allowing overlap.
2. Count favorable unordered pairs
Let:
- ∣A∣=7
- ∣B∣=5
- ∣A∩B∣=2 (24 and 48)
Number of unordered pairs with one from A and one from B =
∣A∣×∣B∣ minus the pairs where the same card is chosen twice (impossible here since drawing without replacement, but the product counts ordered pairs if we think of choosing first from A then from B; for unordered, we must adjust for double-counting when the two cards are distinct but both belong to both sets).
Better: Count all unordered pairs {x,y} with x∈A,y∈B,x=y.
We can do: total ordered pairs (a,b) with a∈A,b∈B,a=b divided by 2 (since order doesn’t matter).
Ordered pairs count: ∣A∣×∣B∣−∣A∩B∣ (subtract cases where the same card is picked twice, which happens only for the 2 common numbers).
So ordered = 7×5−2=35−2=33.
Unordered = 33/2=16.5? That’s not an integer — problem! This reveals the flaw: when both cards are from the intersection, say {24, 48}, the ordered count (24,48) and (48,24) are both valid and distinct in ordered counting, but when we divide by 2 we get a fraction because we subtracted the diagonal incorrectly for unordered counting.
Let’s do it properly:
Method: Count unordered pairs directly.
-
Pairs where the multiple-of-6 card is not a multiple of 8, and the multiple-of-8 card is not a multiple of 6:
A∖B has 7−2=5 cards.
B∖A has 5−2=3 cards.
Unordered pairs: 5×3=15.
-
Pairs where the multiple-of-6 card is also a multiple of 8 (i.e., from A∩B), and the other card is a multiple of 8 but not a multiple of 6:
Choose one from the 2 common numbers, one from the 3 in B∖A: 2×3=6 unordered pairs.
-
Pairs where the multiple-of-8 card is also a multiple of 6, and the other card is a multiple of 6 but not a multiple of 8:
Choose one from the 2 common numbers, one from the 5 in A∖B: 2×5=10 unordered pairs.
-
Pairs where both are from the intersection (both multiples of 24):
Choose 2 from the 2 common numbers: (22)=1 unordered pair.
Total favorable unordered pairs = 15+6+10+1=32.
3. Total possible unordered pairs
Total cards = 40. Number of unordered pairs = (240)=240×39=780.
4. Probability
P=78032=1958
TipA faster way: Count ordered probability and then note symmetry.
P=407⋅395+405⋅397−402⋅391 (subtract double-count of both from intersection in ordered sense) gives 156070=1567? That’s not matching — careful: that subtraction is wrong because ordered pairs where both are from intersection are counted twice in the sum, but they are valid. Actually ordered count = 7⋅5+5⋅7−2⋅2=35+35−4=66; divide by 40⋅39=1560 gives 156066=26011 which simplifies to 52022 not matching. So the combination method is safer.
Watch outA common mistake is to treat the two sets as disjoint and simply multiply counts, forgetting that cards like 24 and 48 belong to both. This leads to undercounting valid pairs.
✓Final answerThe correct option is (D).
ANSWER: D
- KCET 2026Set UNKNOWN1 markMCQQ.Probability of obtaining an even prime number on each die when a pair of dice is rolled is (A) 0 (B) 61 (C) 121 (D) 361
›Reveal solutionSolution
The unique even prime number is 2; the desired event is that each die independently shows a 2, so multiply the individual probabilities.
Step 1 — Identify the even prime number
Among 1,2,3,4,5,6, the prime numbers are 2,3,5. Of these, only 2 is even (every other prime is odd). So "even prime" refers uniquely to the outcome 2.
Step 2 — Probability for one die
Each die is a fair 6-sided die, so
P(die shows 2)=61.
Step 3 — Combine for both dice
Since the two dice are rolled independently, the probability that both show 2 is
P(both dice show 2)=61×61=361.
✓Final answerThe correct option is (D) — 361.
- COMEDK 2025Set 2025-A1 markMCQQ.Five persons entered the lift cabin on the ground floor of an eight-floor apartment. Suppose that each of them independently and with equal probability, can leave the cabin at any floor beginning with the first floor, then the probability of all five persons leaving at different floors is : (A) 7P57 (B) 757P5 (C) 755! (D) 577P5
›Reveal solutionSolution
The probability that all five persons leave on different floors is the number of favorable outcomes (distinct floor assignments) divided by the total outcomes (any floor assignments). The correct expression is 757P5, which corresponds to option (B).
Concept and intuition
We have five people, each independently choosing one of the 7 floors (1st through 7th) to exit. The total number of possible exit patterns is 75, because each person has 7 choices.
For the event “all different floors,” we need to count the number of ways to assign 5 distinct floors to the 5 people. This is a permutation: choose 5 different floors from 7, and then assign them to the 5 people in order. That count is 7×6×5×4×3=7P5.
Probability = (favorable outcomes) / (total outcomes) = 7P5/75.
Step-by-step reasoning
-
Total number of outcomes
Each of the 5 persons can choose any of the 7 floors independently.
Total outcomes = 7×7×7×7×7=75.
-
Favorable outcomes — all different floors
We need to assign 5 distinct floors to the 5 persons.
- The first person can choose any of 7 floors.
- The second person can choose any of the remaining 6 floors.
- The third: 5 remaining.
- The fourth: 4 remaining.
- The fifth: 3 remaining. So the number of ways = 7×6×5×4×3=7P5.
-
Probability
P=totalfavorable=757P5.
- Match with options
- (A) 7P57 — not correct.
- (B) 757P5 — matches exactly.
- (C) 755! — this would be the probability if floors were chosen without replacement but also without order (just a set), which is wrong because persons are distinct.
- (D) 577P5 — denominator wrong (should be 75, not 57).
Watch outA common mistake is to treat the persons as indistinguishable and use combinations, giving 757C5 or 755!. But persons are distinct, so order matters — permutations are needed.
TipNotice that 7P5=7×6×5×4×3=2520, and 75=16807, so the probability is about 0.15 — quite plausible.
✓Final answerThe correct option is (B).
ANSWER: B
-
- COMEDK 2025Set 2025-M1 markMCQQ.A person writes four letters and address four envelopes. If the letters are placed in the envelopes at random, then the probability that not all letters are placed in the right envelope is (A) 2415 (B) 2411 (C) 2423 (D) 241
›Reveal solutionSolution
The probability that not all letters go into the correct envelopes is 1 minus the probability that all four are correct. Since only 1 arrangement out of 24 is perfect, the answer is 1−241=2423.
Concept & Intuition
This is a classic “derangements” problem, but here we only need the complement of “all correct.” The total number of ways to place 4 distinct letters into 4 distinct envelopes is 4!=24. Only one of those ways has every letter in its matching envelope. The event “not all letters are placed correctly” is the complement of that single perfect arrangement. So instead of counting messy partial matches, we simply subtract the one good case from the total.
Step-by-step reasoning
- Total number of equally likely outcomes Each letter can go into any of the 4 envelopes, and no two letters share an envelope. The number of ways to assign 4 distinct letters to 4 distinct envelopes is the number of permutations:
4!=4×3×2×1=24.
- The single favorable outcome for “all correct” There is exactly one arrangement where letter 1 goes into envelope 1, letter 2 into envelope 2, and so on. So the probability that all letters are placed correctly is
P(all correct)=241.
- Complement rule The event “not all letters are placed correctly” is the complement of “all correct.” Therefore,
P(not all correct)=1−P(all correct)=1−241=2423.
- Match with options 2423 corresponds to option (C).
Watch outA common mistake is to try to count all the ways that at least one letter is wrong, which is much more work. The complement trick saves time and avoids errors.
TipWhenever a problem asks for “not all correct” or “at least one wrong,” check if the “all correct” case is easy to count. If so, use 1−P(all correct).
✓Final answerThe correct option is (C).
ANSWER: C
- COMEDK 2025Set 2025-M1 markMCQQ.Vasant and Jothi play a game with a coin. Vasant stakes ₹ 1 and throw the coins four times. If he throws four heads, he gets his stake and ₹3 from Jothi. If he throws only three heads and they are consecutive, he gets his stake and ₹2 from Jothi. If he throws only two heads and they are consecutive, he gets his stake and ₹1 from Jothi. In all other cases Jothi takes the stake money. Find the expectation of Vasant's gain. (A) −85 (B) 0 (C) 1 (D) 85
›Reveal solutionSolution
Over the 16 equally likely outcomes of four fair tosses, the payouts +3,+2,+1 (with stake returned) exactly offset the −1 losses, giving expected gain 0. The correct option is (B).
Vasant stakes Rs 1 each game. His gain is the money received from Jothi in a win (stake returned plus the prize), or −Rs 1 when Jothi keeps the stake. Each of the 24=16 head/tail sequences has probability 161.
-
Classify the outcomes (here "consecutive" means the heads form one unbroken block, with exactly that many heads):
- Four heads gives gain +3: {HHHH} is 1 outcome.
- Exactly three heads, consecutive gives gain +2: {HHHT,THHH} are 2 outcomes.
- Exactly two heads, consecutive gives gain +1: {HHTT,THHT,TTHH} are 3 outcomes.
- All other cases give gain −1: the remaining 16−(1+2+3)=10 outcomes.
-
Compute the expectation.
E=161[(1)(+3)+(2)(+2)+(3)(+1)+(10)(−1)]=163+4+3−10=160=0.
- Cross-check by totals. Total money returned to Vasant over all 16 games =1(4)+2(3)+3(2)+10(0)=16; total staked =16. Net =16−16=0, confirming the expectation.
✓Final answerThe expectation of Vasant's gain is 0 — option (B).
ANSWER: B
-
- COMEDK 2024Set 2024-A1 markMCQQ.The probability of inviting three friends on 5 consecutive days, exactly one friend a day and no friend is invited on more than two days is (A) 8110 (B) 275 (C) 8120 (D) 2710
›Reveal solutionSolution
Each of 5 days one of 3 friends is invited, with no friend used more than twice — the counts must be (2,2,1). Favourable arrangements =3×2!2!1!5!=90 out of 35=243, giving 2710. Option (D).
On each of the 5 consecutive days exactly one of the 3 friends is invited, so the total number of equally likely invitation sequences is
35=243.
Favourable outcomes: all three friends are invited, none more than two days. With 5 days split among 3 friends each appearing at most twice, the only possible split is
(2,2,1),
since the maximum total with each ≤2 is 6 and we need exactly 5.
- Choose which friend is invited only once: 3 ways.
- Arrange the multiset (two friends twice, one friend once) over the 5 days:
2!2!1!5!=4120=30.
Favourable count =3×30=90.
P=24390=2710.
✓Final answerThe probability is 2710 — option (D).
- COMEDK 2024Set 2024-E1 markMCQQ.While shuffling a pack of cards, 3 cards were accidently dropped, then find the probability that the missing cards belong to different suits? (A) 425104 (B) 425169 (C) 425261 (D) 261169
›Reveal solutionSolution
The probability that three dropped cards come from three different suits is found by counting favorable combinations (choose one card from each of the four suits, then choose which three suits) divided by total combinations (choose any three cards from 52). The result simplifies to 425169, which corresponds to option (B).
Concept & Intuition
When cards are dropped randomly, each set of three cards is equally likely. The problem asks for the chance that no two cards share a suit. Instead of worrying about order, we use combinations: count how many ways to pick three cards all from different suits, then divide by the total number of ways to pick any three cards. The suits are independent in the sense that we first choose which three suits appear, then pick one card from each.
Step-by-step solution
- Total number of ways to drop 3 cards from 52 There are (352) equally likely sets of three cards.
(352)=3⋅2⋅152⋅51⋅50=22100.
- Favorable outcomes: three cards, all different suits
- First, choose which 3 suits out of the 4 will appear. Number of ways: (34)=4.
- For each chosen suit, pick one card from that suit. Each suit has 13 cards, so for a fixed set of three suits, the number of ways is 13×13×13=133=2197.
- Therefore, total favorable combinations:
4×2197=8788.
- Compute the probability
P=totalfavorable=221008788.
Simplify the fraction. Divide numerator and denominator by 4:
22100÷48788÷4=55252197.
Now note that 2197=133 and 5525=52×13×17? Let's check: 5525÷13=425, so
55252197=13⋅425133=425132=425169.
TipA common shortcut: the probability that the second card is from a different suit than the first is 5139, and the third is from a different suit than both is 5026. Multiply: 5139⋅5026=25501014=425169. Same result, faster!
Watch outA classic mistake is to forget that the three suits themselves must be chosen — students sometimes just compute 133/(352), which gives 221002197=1700169, missing the factor of 4. Always account for which suits appear.
- Match with options The fraction 425169 matches option (B).
✓Final answerThe correct option is (B).
ANSWER: B
- COMEDK 2024Set 2024-E1 markMCQQ.What is the probability of a randomly chosen 2 digit number being divisible by 3 ? (A) 92 (B) 32 (C) 31 (D) 91
›Reveal solutionSolution
The probability is the count of two‑digit numbers divisible by 3 divided by the total count of two‑digit numbers. There are 30 such numbers out of 90, giving a probability of 31, which corresponds to option (C).
Concept & Intuition
Probability is always total outcomesfavorable outcomes. Here the “outcomes” are all two‑digit numbers (10 through 99). The “favorable” ones are those divisible by 3. Instead of listing them, we can use the fact that multiples of 3 are evenly spaced — every third integer is a multiple. So we just need to find the first and last two‑digit multiples of 3, then count how many steps of size 3 fit between them.
-
Total number of two‑digit numbers
Two‑digit numbers run from 10 to 99 inclusive.
Count = 99−10+1=90.
So the denominator is 90.
-
Find the first two‑digit multiple of 3
The smallest multiple of 3 that is ≥ 10:
3×4=12 (since 3×3=9 is one‑digit).
So the first is 12.
-
Find the last two‑digit multiple of 3
The largest multiple of 3 that is ≤ 99:
3×33=99.
So the last is 99.
-
Count how many multiples of 3 lie between 12 and 99 inclusive
These multiples form an arithmetic sequence: 12, 15, 18, …, 99.
The number of terms is steplast−first+1.
399−12+1=387+1=29+1=30.
So there are 30 favorable numbers.
- Compute the probability
P=9030=31.
TipA quick check: every block of 3 consecutive integers contains exactly one multiple of 3. Since 90 is a multiple of 3, the fraction is exactly 31 — no need to count endpoints if you verify that the first and last numbers in the range align properly (here 10–99 is 90 numbers, and 12 is the first multiple, so the pattern holds).
Watch outA common mistake is to include 0–9 or to forget that 99 is a two‑digit number. Also, some students count from 1 to 99 and get 33 multiples, then subtract the three one‑digit multiples (3, 6, 9) to get 30 — that works too, but be careful not to forget 99 itself.
✓Final answerThe correct option is (C).
ANSWER: C
-
- COMEDK 2024Set 2024-M1 markMCQQ.The probability that a randomly chosen number from one to twelve is a divisor of twelve is (A) 125 (B) 31 (C) 65 (D) 21
›Reveal solutionSolution
The probability is the number of divisors of 12 (which are 1, 2, 3, 4, 6, 12 — six numbers) divided by the total numbers from 1 to 12 (twelve numbers), giving 126=21. The correct option is (D).
The key idea here is simple: probability = (favorable outcomes) / (total outcomes). The "favorable" numbers are those that divide 12 evenly — that is, numbers that are factors of 12. The "total" numbers are just all integers from 1 to 12. So the whole problem reduces to: How many numbers between 1 and 12 are divisors of 12?
Let’s work through it carefully.
-
List all numbers from 1 to 12.
These are: 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12.
That’s 12 numbers in total.
-
Identify which of these divide 12 without a remainder.
A divisor of 12 is a number d such that 12÷d is an integer.
- 1 divides 12 (12 ÷ 1 = 12)
- 2 divides 12 (12 ÷ 2 = 6)
- 3 divides 12 (12 ÷ 3 = 4)
- 4 divides 12 (12 ÷ 4 = 3)
- 5 does not divide 12 (12 ÷ 5 = 2.4)
- 6 divides 12 (12 ÷ 6 = 2)
- 7 does not
- 8 does not
- 9 does not
- 10 does not
- 11 does not
- 12 divides 12 (12 ÷ 12 = 1)
So the divisors of 12 in this range are: 1, 2, 3, 4, 6, 12. That’s 6 numbers.
-
Compute the probability.
Probability = total outcomesnumber of favorable outcomes=126=21.
TipA common shortcut: to find all divisors of a number, factor it into primes. 12=22×31. The number of divisors is (2+1)(1+1)=6. That matches our list — and it’s a quick check that we didn’t miss any.
Watch outA classic mistake is to forget that 1 and the number itself (12) are divisors. Also, some students mistakenly count only proper divisors (excluding the number itself), but the problem says "divisor of twelve" — that includes 12.
✓Final answerThe correct option is (D).
ANSWER: D
-
- COMEDK 2023Set 2023-M1 markMCQQ.A number n is chosen at random from s={1,2,3,…,50}. Let A={n∈s:n is a square }, B={n∈s:n is a prime} and C={n∈s:n is a square}. Then, correct order of their probabilities is (A) p(A)<p(B)<p(C) (B) p(A)>p(B)>p(C) (C) p( B)<p( A)<p(C) (D) p(A)>p(c)>p(B)
›Reveal solutionSolution
[!TLDR]
Count the sets: squares =7, primes =15, so p(A)<p(B); the only option consistent with this is p(A)<p(B)<p(C).
Concept
For a number chosen uniformly at random from {1,2,…,50}, the probability of each event is (number of favourable elements)/50 (CBSE Class 11/12 probability).
Solution
Perfect squares in {1,…,50}: 1,4,9,16,25,36,49 — that is 7 numbers, so
p(A)=507.
Primes in {1,…,50}: 2,3,5,7,11,13,17,19,23,29,31,37,41,43,47 — that is 15 numbers, so
p(B)=5015.
Hence p(A)<p(B).
Now test the options against this fact:
- (B) p(A)>p(B)>p(C) requires p(A)>p(B) — false.
- (C) p(B)<p(A)<p(C) requires p(B)<p(A) — false.
- (D) p(A)>p(C)>p(B) implies p(A)>p(B) — false.
Only option (A), p(A)<p(B)<p(C), is consistent with p(A)<p(B) (the set C being a larger set with p(C)>p(B)).
[!ANSWER]
(A) p(A)<p(B)<p(C)
NoteThis solution was worked out by our team and independently cross-checked by a second solve. The official answer key on record for this question could not be confirmed, so please cross-verify with the official paper where possible.
- COMEDK 2023Set 2023-M1 markMCQQ.A five-digits number is formed by using the digits 1,2,3,4,5 with no repetition. The probability that the numbers 1 and 5 are always together, is (A) 52 (B) 51 (C) 53 (D) 41
›Reveal solutionSolution
Treating 1 and 5 as a single block gives 2⋅4!=48 favourable arrangements out of 5!=120, so the probability is 12048=52.
Total 5-digit numbers using 1,2,3,4,5 without repetition =5!=120.
Favourable (1 and 5 always together): glue 1 and 5 into one block. Then arrange 4 items (the block + three other digits) in 4!=24 ways, and the block internally in 2!=2 ways:
2⋅4!=48.
Probability =12048=52.
✓Final answerThe correct option is (A) — 52
🎓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.