12 solved Probability previous year questions (PYQs) from past year papers — attempt each and check the answer.
Free SolutionsNo Login12 Questions
Q1:jipmat 2025QA › ProbabilityMediumQA · MCQ
A speaks truth in 75% cases and B in 80% of the cases. In what percentage of cases are they likely to contradict each other, in narrating the same incident?
A5%
B15%
C35%
D45%
Pick an option to attempt
The Setup: We are looking for the exact probability that one person is telling the truth while the other is straight capping (lying).
Step 1: Define the probabilities.
Let P(A) be the probability A tells the truth. P(A)=0.75. So, probability A lies is P(A′)=0.25.
Let P(B) be the probability B tells the truth. P(B)=0.80. So, probability B lies is P(B′)=0.20.
Step 2: Find the contradiction scenarios. They contradict when (A tells truth AND B lies) OR (A lies AND B tells truth).
P(Contradict)=(P(A)×P(B′))+(P(A′)×P(B))Step 3: Plug in the numbers and do the math.
P(Contradict)=(0.75×0.20)+(0.25×0.80)P(Contradict)=0.15+0.20=0.35Step 4: Convert to a percentage. 0.35×100%=35%.
Final Answer: 35%
Q2:ipmat indore 2020QA › ProbabilityHardMCQ · MCQ
The probability that a randomly chosen factor of 1019 is a multiple of 1015 is
A251
B121
C201
D161
Pick an option to attempt
The Setup: We are dealing with prime factorization and combinations to calculate probability. We need to find the total number of factors of 1019 (the sample space) and the total number of factors that carry at least 1015 in their DNA (the winning outcomes).
Step 1: Break down the base stats. Prime factorize the main number:
1019=(2×5)19=219×519
The formula for the total number of factors of pa×qb is (a+1)(b+1), since each exponent is chosen freely:
Total factors=(19+1)(19+1)=20×20=400Step 2: Isolate the target condition. A factor of 1019 has the shape 2x×5y with 0≤x,y≤19. For it to be a multiple of 1015=215×515, it must carry at least fifteen of each prime, so x≥15andy≥15.
Combined with the ceiling of 19, the valid range for both x and y is {15,16,17,18,19}.
Step 3: Count the winning outcomes. There are exactly 5 choices for the power of 2 and 5 choices for the power of 5, chosen independently:
Valid factors=5×5=25Step 4: Calculate the final RNG. Probability is winning outcomes over total outcomes, and every factor is equally likely because the choice is uniform over all 400:
P=40025=161Final Answer:161
Q3:ipmat indore 2020QA › ProbabilityHardMCQ · MCQ
A man is known to speak the truth on an average 4 out of 5 times. He throws a die and reports that it is a five. The probability that it is actually a five is
A94
B95
C154
D152
Pick an option to attempt
The Setup: This is a classic Bayes' Theorem trap. We have a prior probability (the physical die) mixed with a conditional one (the man's honesty stats). We want the probability that a five *actually* came up, given that he claims it did - which is not the same as his truthfulness rate, and the gap between 54 and the answer is the entire point of the question.
Step 1: Map the base probabilities.
* Probability of rolling a five: P(A)=61
* Probability of rolling anything else: P(not A)=65
* Man tells the truth: P(T)=54
* Man lies: P(L)=51Step 2: Map the conditional claims.
If it genuinely is a five, he reports five precisely when he is being truthful: P(Claims 5∣Is 5)=54.
If it is not a five, he can only report five by lying, so this branch is taken as P(Claims 5∣Not 5)=51 - the exam's convention is that a lie about the target face lands on that face.
*Worth naming the assumption, because it is doing real work.* If instead a liar spread his lie uniformly across the five wrong faces, this branch would be 51×51=251 and the answer would come out as 54. That value appears nowhere in the options, whereas the convention above lands exactly on option 1 - so the option set itself tells us which reading the paper intended.
Step 3: Apply Bayes' Theorem.P(Is 5∣Claims 5)=P(Is 5)×P(Claims 5∣Is 5)+P(Not 5)×P(Claims 5∣Not 5)P(Is 5)×P(Claims 5∣Is 5)Step 4: Crunch the numbers.Numerator=61×54=304Denominator=(61×54)+(65×51)=304+305=309P=309304=94
Sanity check on the direction: 94<21, which is right - a five is rare enough on a fair die that even a mostly-honest report leaves it more likely than not that he is lying.
Final Answer:94
Q4:jipmat 2025QA › ProbabilityMediumQA · MCQ
Four persons are chosen at random from a group of 3 men, 2 women and 4 children. The chance that exactly 2 of them are children is:
A91
B92
C121
D2110
Pick an option to attempt
The Setup: We are building a squad of 4 people from a total pool of 9 (3M+2W+4C). To find the probability, we need to divide the number of 'winning' combinations (exactly 2 kids and 2 non-kids) by the total possible combinations.
Step 1: Calculate the total number of ways to pick any 4 people out of 9.
This is a standard combination formula nCr=r!(n−r)!n!.
9C4=4×3×2×19×8×7×6=243024=126
So, there are 126 possible squads.
Step 2: Calculate the favorable outcomes. We explicitly need *exactly* 2 children. That means the other 2 slots must be filled by adults (men or women).
Total children = 4. Ways to pick 2 kids = 4C2=2×14×3=6.
Total adults = 3+2=5. Ways to pick 2 adults = 5C2=2×15×4=10.
Multiply them together to get the total favorable combos:
6×10=60 waysStep 3: Calculate the final probability.
P=TotalFavorable=12660
Divide top and bottom by 6:
P=2110Final Answer: 10/21
The probability that a randomly chosen positive divisor of 102023 is an integer multiple of 102001 is
A202322
B20242232
C202422
D20232222
Pick an option to attempt
The Setup: We are asked for the probability that a randomly chosen positive divisor of 102023 is also an integer multiple of 102001.
Step 1: Determine the total number of divisors (the sample space).
First, find the prime factorization of the base number:
102023=(2×5)2023=22023×52023
The formula for the total number of divisors of pa⋅qb is (a+1)(b+1).
Total Divisors=(2023+1)(2023+1)=20242Step 2: Determine the number of valid target divisors.
A divisor D is a multiple of 102001 (which is 22001×52001) if its prime factorization D=2x×5y meets the constraints:
* For base 2: 2001≤x≤2023
* For base 5: 2001≤y≤2023
Calculate the number of integer choices for the exponents x and y:
Choices for x=2023−2001+1=23.
Choices for y=2023−2001+1=23.
Number of valid multiples=23×23=232Step 3: Calculate the probability.
Probability=Total DivisorsValid Multiples=20242232Final Answer:20242232
A and B take part in a rifle shooting match. The probability of A hitting the target is 0.4, while the probability of B hitting the target is 0.6. If A has the first shot, post which both strike alternately, then the probability that A hits the target before B hits it is
A21
B1910
C32
D199
Pick an option to attempt
The Setup: This is a classic infinite geometric probability game. Since they strike alternately, A can win on the 1st shot, 3rd shot, 5th shot, and so on. We need to calculate the probability of A winning on any of these odd-numbered turns and sum them up using the infinite geometric series formula.
Step 1: Define the individual probabilities.
* Probability A hits (P(A)) = 0.4
* Probability A misses (P(A′)) = 1−0.4=0.6
* Probability B hits (P(B)) = 0.6
* Probability B misses (P(B′)) = 1−0.6=0.4Step 2: Map out the winning scenarios for A.
* Scenario 1 (A wins on turn 1): A hits immediately.
P(Win 1)=0.4
* Scenario 2 (A wins on turn 3): A misses, B misses, A hits.
P(Win 3)=P(A′)×P(B′)×P(A)=0.6×0.4×0.4=0.096
* Scenario 3 (A wins on turn 5): A misses, B misses, A misses, B misses, A hits.
P(Win 5)=(P(A′)×P(B′))2×P(A)=(0.24)2×0.4Step 3: Apply the infinite geometric series formula.
The probabilities form an infinite geometric progression where:
* First term (a) = 0.4 (Probability of winning on the first shot)
* Common ratio (r) = P(A′)×P(B′)=0.6×0.4=0.24 (The probability of a full cycle of misses before it's A's turn again)
The sum of an infinite GP is S=1−ra.
Step 4: Calculate the final probability.
S=1−0.240.4S=0.760.4
Multiply the numerator and denominator by 100 to clear the decimals:
S=7640
Divide both by their greatest common divisor (4):
S=1910
The math holds up perfectly.
Final Answer:1910
Q7:ipmat indore 2023QA › ProbabilityEasyMCQ · MCQ
The minimum number of times a fair coin must be tossed so that the probability of getting at least one head exceeds 0.8 is
A5
B6
C3
D7
Pick an option to attempt
The Setup: We must find the minimum number of independent coin tosses required for the probability of getting at least one head to exceed 0.8.
Step 1: Formulate the probability equation.
The probability of getting *at least one* head is the complement of getting *zero* heads (all tails).
P(at least 1 H)=1−P(all T)
For a fair coin tossed n times, the probability of getting all tails is (21)n.
P(at least 1 H)=1−(21)nStep 2: Set up and solve the inequality.
We require this probability to strictly exceed 0.8.
1−(21)n>0.81−0.8>(21)n0.2>(21)n
Convert the decimal to a fraction (0.2=51):
51>2n1
Inverting the fractions flips the inequality:
2n>5Step 3: Test integer values for n.
* If n=1: 21=2≯5
* If n=2: 22=4≯5
* If n=3: 23=8>5 (Valid)
The minimum integer number of tosses required is 3.
Final Answer: 3
Q8:ipmat indore 2019QA › ProbabilityHardMCQ · MCQ
From a pack of 52 cards, we draw one by one, without replacement. If f(n) is the probability that an Ace will appear at the nth turn, then
Af(2)=131>f(3)
B131>f(2)>f(3)
Cf(3)>f(2)=131
Df(2)=f(3)=131
Pick an option to attempt
The Setup: This is built to bait a long conditional-probability chain - first draw, second draw given the first, and so on. Step back instead: with an unconditional question about a shuffled deck, every position is alike.
Step 1: The symmetry argument. Deal all 52 cards face down in a row. Before anything is revealed, each of the 52 cards is equally likely to be sitting in any given position, so position n is no different from position 1. Formally, the number of orderings with an Ace at position n is the same for every n, so:
f(n)=number of cardsnumber of Aces=524=131for every n=1,2,…,52Step 2: Why the chain reasoning does not contradict this. It is tempting to think the second draw *must* differ from the first, because if the first card was an Ace only 3 Aces remain. But we are not told what the first card was. Averaging over both possibilities restores the balance - take n=2:
f(2)=first was an Ace524⋅513+first was not5248⋅514=265212+192=2652204=131
The long route lands on precisely the same value the symmetry argument gives in one line. Conditioning on unknown information changes nothing.
Step 3: Conclude. Since the probability is constant across all turns:
f(2)=f(3)=131
Options 1, 2 and 3 all assert that f(2) and f(3) differ, which is exactly the trap of imagining the deck depletes in a way you can observe.
Final Answer:f(2)=f(3)=131
A die is thrown three times and the sum of the three numbers is found to be 15. The probability that the first throw was a four is
A61
B41
C51
D101
Pick an option to attempt
The Setup: Conditional probability with the answer already partly spoiled - we know the sum is 15. So the sample space shrinks to just those outcomes, and we count how many of them open with a 4.
Step 1: Enumerate the outcomes summing to 15. Three dice, maximum 18, so 15 is near the top and the possibilities are few. Group by which values appear, then count orderings:
Multiset
Orderings
Count
{3,6,6}
one repeat, so 2!3!
3
{4,5,6}
all distinct, so 3!
6
{5,5,5}
all identical
1
Total=3+6+1=10Step 2: Count those starting with 4. A 4 can only appear in the {4,5,6} group - neither {3,6,6} nor {5,5,5} contains a 4 at all. Of its six orderings, those beginning with 4 are (4,5,6) and (4,6,5):
Favourable=2Step 3: Divide. Every one of the 10 outcomes is equally likely (each is a specific ordered triple with probability 2161), so the conditional probability is a plain ratio of counts:
P(first is 4∣sum is 15)=102=51Final Answer:51
In a given village there are only three sizes of families: families with 2 members, families with 4 members and families with 6 members. The proportion of families with 2, 4 and 6 members are roughly equal. A poll is conducted in this village wherein a person is chosen at random and asked about his/her family size. The average family size computed by sampling 1000 such persons from the village would be closest to
A4
B4.667
C4.333
D3.667
Pick an option to attempt
The Setup: A sampling-bias trap. The *families* are equally numerous, but the poll picks a person, and larger families put more people into the pool. Anyone who averages the three family sizes directly walks into it.
Step 1: Build the population. Let each size have N families:
people in 2-member families=2N,4N,6N⟹total=12N
Note the families split 1:1:1 but the people split 2:4:6, i.e. 1:2:3. That mismatch is the entire question.
Step 2: Probability a randomly chosen person comes from each group.P(size 2)=12N2N=61,P(size 4)=12N4N=31,P(size 6)=12N6N=21
A person is three times as likely to be drawn from a 6-member family as from a 2-member one.
Step 3: Take the expectation. Each respondent reports their own family's size:
E[X]=2⋅61+4⋅31+6⋅21=31+34+3=35+3=314≈4.667Step 4: Name the trap explicitly. Averaging the family sizes as though each family were one data point gives 32+4+6=4 - which is option 1. That is the average family size *per family*, a genuinely different quantity from the average size *reported by a random person*. The poll samples people, so the answer is the larger 4.667. The sample of 1000 is a red herring: it only means the estimate is close to the true expectation, not that the size matters.
Final Answer: 4.667
Three dice are thrown simultaneously and the sum of the three numbers appearing on the top faces of the dice is found to be 10. The probability that these three numbers are distinct, is ___
A32
B53
C21
D43
Pick an option to attempt
The Setup: This is a classic Conditional Probability scenario mixed with a Combinatorics side quest. Since we already know the sum is exactly 10, our total sample space shrinks from the massive 63 base down to only the specific combinations that yield a 10. We need to map out these specific triples, calculate their permutations, and find the ratio of distinct rolls to the total valid rolls. Math, logic, and syntax are locked in and double-verified.
Step 1: Map the valid triples (Sum = 10).
Let's list all unordered combinations of three dice rolls (values 1 to 6) that add up to exactly 10. We will split them into two tiers: distinct values and repeated values.
* Distinct triples:(1,3,6), (1,4,5), and (2,3,5).
* Repeated triples:(2,2,6), (2,4,4), and (3,3,4).
Step 2: Calculate the permutations (The Sample Space).
Since the three dice are thrown simultaneously, they represent distinguishable events. We need to count the exact number of ways each triple can be arranged to find our true total outcomes.
* For the 3 distinct triples: Each can be arranged in 3!=6 ways.
DistinctOutcomes=3×6=18
* For the 3 repeated triples: Each has one duplicate number, so their arrangements are divided by the duplicate factorial: 2!3!=3 ways.
RepeatedOutcomes=3×3=9
Our new restricted sample space (total valid outcomes where the sum is 10) is:
TotalOutcomes=18+9=27Step 3: Extract the final probability.
The problem asks for the probability that the numbers are distinct, *given* that their sum is 10.
Probability=TotalOutcomesDistinctOutcomesProbability=2718
Simplify the fraction by dividing the numerator and denominator by 9:
Probability=32Final Answer:32
A fair die is rolled repeatedly. The probability that the cumulative sum is at least 17 in the third trial is ___
A541
B1081
C271
D2167
Pick an option to attempt
The Setup: This is a classic Probability combinatorics drop. We are rolling a standard 6-sided die three times, which sets our total sample space to 63. The win condition is hitting a cumulative sum of *at least* 17. Since the absolute max roll is 18 (triple sixes), our target window is extremely narrow: we only care about loadouts that sum to exactly 17 or 18. Math, logic, and syntax are locked in and double-verified.
Step 1: Calculate the total sample space.
Rolling a standard die three times gives us a total number of possible distinct outcomes:
TotalOutcomes=6×6×6=63=216Step 2: Map the "Sum = 18" win condition.
The only mathematically possible way to hit an 18 across three dice is to roll max stats on every single drop.
Valid permutations: (6,6,6)
Total ways = 1Step 3: Map the "Sum = 17" win condition.
To hit a 17, we need two dice to roll max (6) and one die to drop a 5. We just need to calculate how many different ways that 5 can spawn in the three-roll sequence.
Valid permutations: (5,6,6), (6,5,6), and (6,6,5)
Total ways = 3Step 4: Execute the final probability calculation.
Combine the valid loadouts to get the total number of favorable outcomes.
FavorableOutcomes=1+3=4
Now, divide the favorable outcomes by the total sample space to secure the final probability.
Probability=2164
Simplify the fraction by dividing the top and bottom by 4:
Probability=541Final Answer:541