All 25 QA previous year questions (PYQs) from the IPMAT Indore 2020 past year paper, with answers and full solutions.
Free SolutionsNo Login25 Questions
Q1:ipmat indore 2020QA › HCF & LCMEasySA · TITA
In a division problem, the product of the quotient and the remainder is 24 while their sum is 10. If the divisor is 5 then the dividend is __________.
Enter your answer to attempt
The Setup: We are dealing with the foundational division algorithm: Dividend=(Divisor×Quotient)+Remainder. The absolute golden rule of division is that the remainder must be strictly non-negative and less than the divisor (0≤r<d). We need to min-max the given sum and product to find the exact values before plugging them in.
Step 1: Formulate the system of equations. Let the quotient be q and the remainder be r. The problem gives us their product q×r=24 and their sum q+r=10.
Step 2: Solve the quadratic substitution. You can substitute r=10−q into the product equation:
q(10−q)=2410q−q2=24q2−10q+24=0
Factoring this gives (q−6)(q−4)=0. The roots are 6 and 4. So, our variables {q,r} are exactly {6,4} - no other pair of numbers has this sum and product.
Step 3: Enforce the remainder rule. We are told the divisor is 5. By the laws of division, r<5. Between 6 and 4, only 4 satisfies this condition. Therefore, it is a hard lock that r=4 and q=6.
Step 4: Execute the final calculation. Substitute everything back into the core algorithm:
Dividend=(5×6)+4Dividend=30+4=34Final Answer: 34
Q2:ipmat indore 2020QA › CirclesMediumSA · TITA
The shortest distance from the point (−4,3) to the circle (x2+y2=1) is __________.
Enter your answer to attempt
The Setup: This is a coordinate geometry problem finding the shortest path from an external point to a circle's boundary. Think of the circle as a forcefield; the shortest route is always a straight line aimed dead center, and we just subtract the forcefield's radius from the total distance.
Step 1: Deconstruct the circle's equation. The given equation is x2+y2=1. This perfectly matches the standard form (x−h)2+(y−k)2=r2. Thus, the center is the origin (0,0) and the radius is r=1=1.
Step 2: Calculate absolute distance to center. We use the Euclidean distance formula between the point (−4,3) and the center (0,0):
d=(x2−x1)2+(y2−y1)2d=(−4−0)2+(3−0)2d=(−4)2+(3)2d=16+9=25=5Step 3: Confirm the point is outside. This step is not optional - the *subtract the radius* move only works for an external point. Since d=5>r=1, the point sits outside the circle. (Had it been inside, the shortest distance would have been r−d instead.)
Step 4: Find the boundary distance. The total distance to the core is 5 units. Because the circle's radius occupies 1 unit of that path, the remaining gap from the point to the edge is simply the difference: 5−1=4.
Final Answer: 4
The value of (0.04log5(41+81+161+...)) is __________.
Enter your answer to attempt
The Setup: This expression looks incredibly toxic, but we can beat it by breaking it down into two phases: resolving the infinite geometric progression (GP) first, and then applying logarithm exponent rules to clean up the base.
Step 1: Evaluate the infinite GP. Look at the sequence inside the log: 41+81+161+…
This is an infinite GP where the first term a=41 and the common ratio r=21. Since ∣r∣<1 the series converges, so the sum to infinity S=1−ra applies:
S=1−2141=2141=41×12=21Step 2: Reconstruct the base and the logarithm. The original expression's base is 0.04, which translates to the fraction 1004=251. We can write this as an exponent: 5−2.
The logarithm's base is 5, which is 521.
So the exponent is log51/2(21).
Step 3: Simplify the exponent using log properties. We use the rule logbn(x)=n1logb(x):
log51/2(21)=211log5(21)=2log5(21)
Bring the multiplier inside as a power: log5((21)2)=log5(41).
Step 4: Combine the final expression. Substitute the cleaned-up base and exponent back together:
(5−2)log5(41)=5−2log5(41)
Move the −2 inside the log as a power:
5log5((41)−2)
Using the identity blogb(x)=x, the 5 and log5 cancel out. We are left with:
(41)−2=42=16Final Answer: 16
Suppose abca2b2c2a3−1b3−1c3−1=0, where a,b and c are distinct real numbers. If a=3, then the value of abc is:
Enter your answer to attempt
The Setup: This is a top-tier matrix determinant manipulation. When a determinant's column contains a sum or difference, it can be split into two separate determinants. The given a=3 is literal clickbait meant to throw you off; it has absolutely zero impact on the algebraic proof.
Step 1: Split the original determinant. We separate the third column (a3−1,b3−1,c3−1) into two determinants:
Δ=abca2b2c2a3b3c3−abca2b2c2111=0Step 2: Factor the first determinant. In the first matrix, notice that row 1 shares an a, row 2 shares a b, and row 3 shares a c. Let's factor them out completely:
abc111abca2b2c2Step 3: Align the second determinant. We want the second matrix to match the first, so we walk its last column to the front by two swaps.
Swap Column 3 with Column 2 (sign flips):
abca2b2c2111=−abc111a2b2c2
Now swap Column 2 with Column 1 (sign flips back):
=+111abca2b2c2
Two swaps, two sign flips, so the second determinant is exactly the same object as the first one's cofactor - no leftover minus sign.
Step 4: Factor the entire equation. Let the aligned matrix be V (a Vandermonde determinant). Our original equation Δ=0 now looks like this:
abc(V)−V=0⟹V(abc−1)=0
The Vandermonde determinant factors cleanly as V=(b−a)(c−a)(c−b). Because the problem states a, b and c are distinct real numbers, every one of those three brackets is non-zero, so V=0. Therefore the other multiplier must be zero:
abc−1=0⟹abc=1Final Answer: 1
Q5:ipmat indore 2020QA › ModulusMediumSA · TITA
The minimum value of f(x)=∣3−x∣+∣2+x∣+∣5−x∣ is equal to __________.
Enter your answer to attempt
The Setup: We are tasked with finding the global minimum of the function f(x)=∣3−x∣+∣2+x∣+∣5−x∣. In absolute value geometry, this represents the sum of distances from a coordinate x to three specific points on a number line, and the minimum lands at the median of those points. Rather than just quoting that rule, we can lock the answer down with a two-line proof.
Step 1: Standardize the terms. First, use the property ∣a−b∣=∣b−a∣ to rewrite the function so x is always first. This prevents sign errors.
f(x)=∣x−3∣+∣x−(−2)∣+∣x−5∣
The roots (the points on the number line) are exactly 3, −2 and 5. In ascending order: −2,3,5 - so the median is 3.
Step 2: Bound the outer pair. For the two extreme points, the triangle inequality gives a floor that no x can beat:
∣x+2∣+∣x−5∣≥∣(x+2)−(x−5)∣=7
with equality for every x in the interval [−2,5].
Step 3: Bound the middle term. Obviously ∣x−3∣≥0, with equality only at x=3. Adding the two bounds gives f(x)≥7+0=7 for all x.
Step 4: Show the floor is actually reached. The two equality conditions must hold at once, and they do: x=3 lies inside [−2,5]. Substituting:
f(3)=∣3−3∣+∣3−(−2)∣+∣3−5∣=0+5+2=7
The bound is achieved, so 7 is the true minimum and not merely a lower estimate.
Final Answer: 7
Ashok purchased pens and pencils in the ratio 2:3 during his first visit and paid Rs. 86 to the shopkeeper. During his second visit, he purchased pens and pencils in the ratio 4:1 and paid Rs. 112. The cost of a pen as well as a pencil in rupees is a positive integer. If Ashok purchased four pens during his second visit, then the amount he paid in rupees for the pens during the second visit is __________.
Enter your answer to attempt
The Setup: This is a system of linear equations hiding behind ratios, with a strict Diophantine constraint: the prices of the pens and pencils must be positive integers. We have to decode two separate shopping trips, set up the algebra, and pin down the only integer solution.
Step 1: Formalize the second visit. On the second visit, the ratio of pens to pencils is 4:1, and the total cost is Rs. 112. We are explicitly told Ashok bought 4 pens. By the ratio, he must have bought exactly 1 pencil.
Let x be the price of a pen, and y be the price of a pencil.
4x+1y=112
Isolate y so we can use it as a substitution later:
y=112−4xStep 2: Formalize the first visit. The ratio of pens to pencils bought is 2:3, costing Rs. 86. We don't know the exact quantities, just the ratio. So, let the quantities be 2k pens and 3k pencils, where k is a positive integer constant.
2kx+3ky=86⟹k(2x+3y)=86Step 3: Substitute, then kill every wrong branch. Plug the isolated y from Step 1 into the Step 2 equation:
k(2x+3(112−4x))=86k(2x+336−12x)=86⟹k(336−10x)=86
So 336−10x=k86, which forces k to be a positive factor of 86. The factors are 1,2,43,86, giving k86∈{86,43,2,1} respectively. Now the kill shot: the left side 336−10x is 6 short of a multiple of ten, so it always ends in the digit 6 - and of those four candidates, only 86 does. That single observation eliminates k=2, k=43 and k=86 outright, with no trial-and-error, leaving k=1 as the one surviving branch.
336−10x=86⟹10x=250⟹x=25
Then y=112−4(25)=112−100=12. Both prices are positive integers, and since only one branch survived, this pair is unique.
Step 4: Reconcile against the first visit. Uniqueness is worth nothing if the numbers don't actually satisfy the original trip. With k=1 he bought 2 pens and 3 pencils: 2(25)+3(12)=50+36=86. That is exactly what he paid, so the pair holds.
Step 5: Calculate the final request. The prompt asks for the total amount paid *specifically for the pens* during the second visit.
He bought 4 pens at Rs. 25 each: 4×25=100.
Final Answer: 100
In a four-digit number, the product of the thousands digit and units digit is zero while their difference is 7. Product of the middle digits is 18. The thousands digit is as much more than the units digit as the hundreds digit is more than the tens digit. The four-digit number is __________.
Enter your answer to attempt
The Setup: This is a cryptographic math puzzle. We need to build a four-digit integer, let's call it ABCD (where A is thousands, B is hundreds, C is tens, D is units). We will decode the rules one by one to lock in each place value.
**Step 1: Solve the outer digits (A and D).** We are given two conditions: A×D=0 and the absolute difference is 7.
For the product to be zero, either A=0 or D=0. Since it's a four-digit number, the leading digit A cannot be 0. Therefore, D=0.
Because A must be positive, the difference of 7 means A−0=7, locking in A=7.
**Step 2: Analyze the middle digits (B and C).** We are told their product is 18: B×C=18.
Since B and C are single digits, the only possible ordered pairs that multiply to 18 are (2,9), (9,2), (3,6) and (6,3).
Step 3: Apply the relational constraint. The prompt states: 'The thousands digit is as much more than the units digit as the hundreds digit is more than the tens digit.'
Translated to algebra, this means A−D=B−C.
We already know A−D=7−0=7, so we need B−C=7.
Run that filter across the four candidate pairs: 2−9=−7, 9−2=7, 3−6=−3, 6−3=3. Exactly one survives - 9−2=7 - which locks in B=9 and C=2. Note the filter is a signed difference, not an absolute one, so (2,9) is genuinely rejected rather than being a second answer.
Step 4: Assemble the final integer. We have A=7, B=9, C=2 and D=0. Concatenate them in order.
Final Answer: 7920
Q8:ipmat indore 2020QA › Set TheoryMediumSA · TITA
Out of 80 students who appeared for the school exams in Mathematics (M), Physics (P) and Chemistry (C), 50 passed M, 30 passed P and 40 passed C. At most 20 students passed M and P, at most 20 students passed P and C, and at most 20 students passed C and M. The maximum number of students who could have passed all three exams is __________.
Enter your answer to attempt
The Setup: We are min-maxing a 3-circle Venn diagram problem. We have a total population of 80 students across Mathematics (M), Physics (P) and Chemistry (C). We need to maximise the triple intersection (students who passed all three) without violating the 'at most 20' limits placed on the pairwise overlaps.
Step 1: Define the variables and totals. Let x=n(M∩P∩C) be the number of students who passed all three. We want to push x as high as possible.
The individual subject totals are n(M)=50, n(P)=30 and n(C)=40.
Step 2: Establish the ceiling. By the definition of intersection, anyone who passed all three also passed each pair, so the triple intersection is a subset of every pairwise intersection:
x≤n(M∩P),x≤n(P∩C),x≤n(M∩C)
The problem caps all three pairwise intersections at 20. Therefore x≤20 - this is a hard upper bound, no construction can beat it.
Step 3: Build a scenario that hits the ceiling. An upper bound is useless until we show it is reachable. Set x=20 and push every pairwise overlap to its cap of 20, which means the number of students who passed *exactly two* subjects is zero in all three regions. The *single-subject-only* groups then fall out:
* Passed M only: 50−20=30
* Passed P only: 30−20=10
* Passed C only: 40−20=20Step 4: Verify the headcount closes. Total students accounted for = (M only) + (P only) + (C only) + (all three):
30+10+20+20=80
This lands exactly on the 80 students who appeared, with no region going negative and every pairwise intersection sitting at 20 rather than above it. The scenario is structurally sound, so the ceiling of 20 is genuinely achievable and is therefore the maximum.
Final Answer: 20
Q9:ipmat indore 2020QA › Time, Speed & DistanceMediumSA · TITA
Two friends run a 3-kilometer race along a circular course of length 300 meters. If their speeds are in the ratio 3:2, the number of times the winner passes the other is __________.
Enter your answer to attempt
The Setup: This is a relative speed problem on a circular track. When runners start together and run the same way, the faster one *passes* the slower one every time he gains exactly one full lap. So the whole question reduces to: how many whole laps of lead does the winner build up before the race ends?
Step 1: Determine the total race parameters. The track is 300 metres long and the race is 3 kilometres, which equals 3000 metres.
Laps to finish=3003000=10
The winner finishes the instant he completes his 10th lap, and that is when the clock stops for both runners.
Step 2: Leverage the speed ratio. The speeds are in the ratio 3:2. Both runners are on the track for the same duration, and at constant speed distance is directly proportional to speed, so their distances are in that same 3:2 ratio.
Step 3: Locate the slower runner at the finish. When the winner has covered 10 laps:
Slower runner=32×10=320 laps
Keep this as an exact fraction - 320 laps, not a rounded 6.67 - because the final count depends on which side of a whole number the lead lands.
Step 4: Count the overtakes. The lead the winner builds over the full race is the difference in laps covered:
Lead=10−320=330−20=310 laps
The winner overtakes once for each whole lap of lead he gains, i.e. as the lead sweeps past 1, 2 and 3. Since 310=331 is strictly greater than 3 but short of 4, the third overtake happens before the finish line and a fourth never does.
Number of passes=⌊310⌋=3Final Answer: 3
Out of 13 objects, 4 are indistinguishable and the rest are distinct. The number of ways we can choose 4 objects out of 13 objects is __________.
Enter your answer to attempt
The Setup: This combinatorics problem mixes indistinguishable (identical) objects with distinct ones. The standard combination formula (rn) only works for choosing distinct items. When dealing with indistinguishable objects, choosing one of them gives the same exact outcome as choosing another, so there is only 1 way to select any given quantity of them. We must break this down into cases based on how many identical items we draft into the final squad of 4.
Step 1: Catalog the inventory. Total pool =13 objects.
Indistinguishable objects =4. Distinct objects =13−4=9.
We need to form a team of exactly 4 objects.
Step 2: Calculate combinations case-by-case. We iterate through every possible quantity of indistinguishable objects, from 0 up to 4 (we cannot take more than the 4 that exist).
* Case 1 (0 identical, 4 distinct):(49)=4×3×2×19×8×7×6=126 ways
* Case 2 (1 identical, 3 distinct):1×(39)=3×2×19×8×7=84 ways
* Case 3 (2 identical, 2 distinct):1×(29)=2×19×8=36 ways
* Case 4 (3 identical, 1 distinct):1×(19)=9 ways
* Case 5 (4 identical, 0 distinct):1×(09)=1 way
Step 3: Aggregate the total possibilities. The cases are mutually exclusive (they differ in how many identical objects were taken), so we add them:
126+84+36+9+1=256Step 4: Cross-check with a symmetry argument. That total is (09)+(19)+(29)+(39)+(49) - the lower half of row 9 of Pascal's triangle. Since (k9)=(9−k9), the ten entries of that row pair off perfectly into two equal halves, so this sum is exactly half the row total:
229=2512=256
Two independent routes, same number, so the count is confirmed.
Final Answer: 256
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
Q12:ipmat indore 2020QA › TrianglesHardMCQ · MCQ
The number of acute angled triangles whose sides are three consecutive positive integers and whose perimeter is at most 100 is
A28
B29
C31
D33
Pick an option to attempt
The Setup: This geometry problem is a triple filter. The sides must pass the triangle inequality vibe check, then survive the acute-angle condition, then fit under the perimeter cap. Whichever filter is strictest wins.
Step 1: Set up the side lengths. Let the three consecutive integer sides be x−1, x and x+1, with x−1≥1.
For any triangle the two smaller sides must beat the largest: (x−1)+x>x+1⟹x>2.
Step 2: Enforce the acute angle rule. A triangle is acute when *every* angle is acute - but we only have to test one. The largest angle always sits opposite the longest side, so if that angle is acute the two smaller ones are smaller still and acute automatically. The longest side here is x+1, so the single condition to check is a2+b2>c2:
(x−1)2+x2>(x+1)2x2−2x+1+x2>x2+2x+1x2>4x
Since x is positive we may divide by x, giving x>4. As x is an integer, the lowest valid value is x=5 (the smallest qualifying triangle being 4,5,6). Note this condition is strictly tighter than Step 1's x>2, so the triangle inequality is absorbed and adds nothing further.
Step 3: Apply the perimeter cap. The perimeter is at most 100:
(x−1)+x+(x+1)=3x≤100⟹x≤33.33…
Since x is an integer, the maximum is x=33, giving sides 32,33,34 and a perimeter of 99.
Step 4: Count the surviving squad. The valid range for x runs from 5 to 33 inclusive:
33−5+1=29Final Answer: 29
The equation of the straight line passing through the point M(−5,4), such that the portion of it between the axes is divided by the point M into two equal halves, is
A10y−8x=80
B8y+10x=80
C10y+8x=80
D8y+10x+80=0
Pick an option to attempt
The Setup: This is a coordinate geometry speedrun using intercept form. The line crosses the x-axis at some point A(a,0) and the y-axis at B(0,b). Saying M divides the portion between the axes into two equal halves is just a fancy way of saying M is the midpoint of segment AB.
Step 1: Apply the midpoint formula. The midpoint of A(a,0) and B(0,b) is (2a,2b), and we are told that point is M(−5,4):
2a=−5⟹a=−102b=4⟹b=8Step 2: Construct the line equation. Use the two-intercept form ax+by=1:
−10x+8y=1Step 3: Clear the fractions in one shot. Multiply every term by 80 (a common multiple of 10 and 8 chosen to land directly on the answer's scale):
80⋅−10x+80⋅8y=80⟹−8x+10y=80
Reordering gives 10y−8x=80.
Step 4: Verify against all three known points. A midpoint slip is easy to make, so test the line on the two intercepts and M itself:
* A(−10,0): 10(0)−8(−10)=80 ✓
* B(0,8): 10(8)−8(0)=80 ✓
* M(−5,4): 10(4)−8(−5)=40+40=80 ✓
All three sit on the line, and M is genuinely halfway between A and B. Running the other three options through M(−5,4) fails every time, so the match is unique.
Final Answer:10y−8x=80
The value of cos2(8π)+cos2(83π)+cos2(85π)+cos2(87π) is
A1
B23
C2
D49
Pick an option to attempt
The Setup: This trig expression looks intimidating, but it has zero plot armour once you spot the symmetry in the angles. We use the supplementary angle identity to fold the expression in half, then the complementary identity to finish it off.
Step 1: Fold the back half. Notice that 87π=π−8π, and cos(π−θ)=−cosθ, so cos(87π)=−cos(8π). Squaring kills the minus sign:
cos2(87π)=cos2(8π)
Identically, 85π=π−83π, so cos2(85π)=cos2(83π).
Step 2: Simplify the sum. The four terms collapse into two identical pairs:
2[cos2(8π)+cos2(83π)]Step 3: Exploit the complementary angles. Notice that 8π+83π=84π=2π. The two angles are complementary, and cos(2π−θ)=sinθ, so:
cos(83π)=sin(8π)Step 4: Use the legendary identity. Substitute sine into the folded expression:
2[cos2(8π)+sin2(8π)]
By the Pythagorean identity cos2θ+sin2θ=1, the bracket collapses to 1:
2×1=2Final Answer:2
If 121+221+321+… up to ∞=6π2, then the value of 121+321+521+… up to ∞ is
A8π2
B16π2
C12π2
D36π2
Pick an option to attempt
The Setup: We are manipulating the famous Basel problem. We are handed the sum of *all* inverse squares and asked for the sum of only the *odd* ones. The trick is to split the total into its even and odd halves, then notice the even half is a scaled copy of the whole thing.
Step 1: Define the series. Let the total be S=6π2. Every positive integer is either odd or even, so the total splits cleanly with nothing counted twice and nothing missed:
S=Sum(Odds)+Sum(Evens)
Every term here is positive and the series converges, so splitting and rearranging it like this is legitimate rather than a formal trick.
Step 2: Factor the even series. Write out the even terms and pull out the common factor. Each even number is 2n, so its square is 4n2:
Sum(Evens)=221+421+621+…=41(121+221+321+…)
The bracket is literally the original total S, so Sum(Evens)=4S. This self-similarity is the whole engine of the problem.
Step 3: Solve for the odds. Substitute back into the master equation:
S=Sum(Odds)+4S⟹Sum(Odds)=S−4S=43SStep 4: Final substitution. Plug in the known value of S:
Sum(Odds)=43×6π2=243π2=8π2Final Answer:8π2
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
Q17:ipmat indore 2020QA › LogarithmsEasyMCQ · MCQ
If log5(log8(x2−1))=0, then a possible value of x is
A22
B2
C2
D3
Pick an option to attempt
The Setup: This is a logarithm inception. We unpack it from the outside in using the fundamental definition logb(A)=C⟹A=bC, then check the candidates against the option list.
Step 1: Destroy the outer log.log5(log8(x2−1))=0
Convert from log form to exponential form:
log8(x2−1)=50=1Step 2: Destroy the inner log. Apply the same rule to what remains:
x2−1=81=8Step 3: Solve the quadratic.x2=9⟹x=±3Step 4: Pick the value that is actually on the menu. Both x=3 and x=−3 satisfy the equation - the expression only ever sees x2, so the sign is irrelevant, and x2−1=8>0 keeps every logarithm well defined. This is exactly why the stem asks for *a possible* value rather than *the* value. Of the two, only 3 appears among the options, so it is the answer.
The other three options all fail, and one of them is a genuine trap:
* x=22: x2−1=7, and log87≈0.936, so the outer log is not 0.
* x=2: x2−1=1, so log81=0 - and log50 is undefined, not zero. Mistaking one for the other is the intended snare.
* x=2: x2−1=3, and log83≈0.528, so the outer log is not 0.
Final Answer: 3
Consider the following statements:
(i) When (0<x<1), then (1+x1<1−x+x2)
(ii) When (0<x<1), then (1+x1>1−x+x2)
(iii) When (−1<x<0), then (1+x1<1−x+x2)
(iv) When (−1<x<0), then (1+x1>1−x+x2)
Then the correct statements are:
A(i) and (ii)
B(ii) and (iv)
C(i) and (iv)
D(ii) and (iii)
Pick an option to attempt
The Setup: Cross-multiplying an inequality whose denominator changes sign is how this question eats people alive. We dodge that entirely with the sum of cubes identity a3+b3=(a+b)(a2−ab+b2), taking a=1 and b=x, which turns the whole comparison into a single fraction whose sign we can read off.
Step 0: Note the structure. Statements (i) and (ii) are exact opposites on the same interval, as are (iii) and (iv). So exactly one of each pair must be true, and the answer is guaranteed to be one statement from each pair - that alone kills option 1 ((i) and (ii) cannot both hold) before any algebra.
Step 1: Exploit the identity. With a=1, b=x:
1+x3=(1+x)(1−x+x2)
On both intervals x>−1, so 1+x>0 - it is never zero, and we may safely divide by it:
1−x+x2=1+x1+x3Step 2: Find the delta. Subtract the two quantities being compared and put them over the common denominator:
(1−x+x2)−1+x1=1+x1+x3−1+x1=1+xx3
Everything now rides on the sign of 1+xx3, and since 1+x>0 throughout, that sign is simply the sign of x3 - which is the sign of x.
**Step 3: Evaluate Case 1, 0<x<1.** The numerator x3 is positive and the denominator 1+x is positive, so the delta is positive:
1+xx3>0⟹1−x+x2>1+x1
Flipping that around to the form the paper uses gives 1+x1<1−x+x2, which is exactly Statement (i) - and therefore (ii) is false.
*Spot check at x=21:* 1+x1=32 and 1−x+x2=43, and indeed 32<43, with the gap 121 matching 1+xx3=3/21/8=121.
**Step 4: Evaluate Case 2, −1<x<0.** Here the numerator x3 is negative (a negative number cubed stays negative), while the denominator 1+x is still positive - for instance 1+(−0.5)=0.5. A negative over a positive is negative:
1+xx3<0⟹1−x+x2<1+x1
Flipping it round gives 1+x1>1−x+x2, which is exactly Statement (iv) - and therefore (iii) is false.
*Spot check at x=−21:* 1+x1=2 and 1−x+x2=47, and indeed 2>47, with the gap −41 matching 1+xx3=1/2−1/8=−41.
Step 5: Assemble. The true statements are (i) and (iv), one from each contradictory pair as Step 0 predicted.
Final Answer: (i) and (iv)
Fifty litres of a mixture of milk and water contains 30 percent of water. This mixture is added to eighty litres of another mixture of milk and water that contains 20 percent of water. Then, how many litres of water should be added to the resulting mixture to obtain a final mixture that contains 25 percent of water?
A1
B2
C3
D4
Pick an option to attempt
The Setup: Mixture problems just require tracking the absolute volumes of the components like inventory. We find the exact litres of water and milk we currently hold, merge them, then solve for the extra water needed to hit the target 25%. The key discipline is that adding pure water changes the water column *and* the total, but leaves the milk column frozen.
Step 1: Audit Mixture 1. Total =50 L, water is 30%.
Water=0.30×50=15 L,Milk=50−15=35 LStep 2: Audit Mixture 2. Total =80 L, water is 20%.
Water=0.20×80=16 L,Milk=80−16=64 LStep 3: Merge the inventory. Tip both into the same barrel:
Total volume=50+80=130 L,Water=15+16=31 L,Milk=35+64=99 LStep 4: Calculate the required additive. Let w litres of pure water go in. Both the water and the total grow by w, and a 25% water mix means water is 41 of the total:
130+w31+w=41
Cross-multiply and solve:
4(31+w)=130+w⟹124+4w=130+w⟹3w=6⟹w=2Step 5: Verify from the milk side. The milk column never moved, so it is an independent check. Final total =130+2=132 L, of which milk is still 99 L:
13299=43=75% milk, hence 25% water
The two routes agree, so w=2 is right.
Final Answer: 2
Q20:ipmat indore 2020QA › Time & WorkHardMCQ · MCQ
Three workers working together need 1 hour to construct a wall. The first worker, working alone, can construct the wall twice as fast as the third worker, and can complete the task an hour sooner than the second worker. Then, the average of time taken in hours by three workers, when working alone, to construct the wall is
A333+4
B333+5
C333+6
D333+7
Pick an option to attempt
The Setup: This is a rates problem, and the golden rule is that *times do not add, rates do*. We convert *hours to build the wall* into *walls per hour*, sum the three rates to 1 wall/hour, and only convert back to time at the very end.
Step 1: Define the rates. Let r1,r2,r3 be the workers' rates in walls per hour, and ti=ri1 their solo times.
All three together take 1 hour, so their rates sum to one whole wall per hour:
r1+r2+r3=11=1
Worker 1 is twice as fast as Worker 3, so r1=2r3, i.e. r3=2r1 (equivalently t3=2t1).
Step 2: Link Workers 1 and 2. Worker 1 finishes an hour sooner than Worker 2, and that condition is about *times*, so it must be written in times first:
t1=t2−1⟹r11=r21−1⟹r21=r11+1=r11+r1
Flipping gives r2=1+r1r1.
Step 3: Solve the master rate equation. Substitute r2 and r3 into the sum:
r1+1+r1r1+2r1=1
Multiply through by 2(1+r1) to clear denominators:
2r1(1+r1)+2r1+r1(1+r1)=2(1+r1)2r1+2r12+2r1+r1+r12=2+2r13r12+5r1=2+2r1⟹3r12+3r1−2=0
By the quadratic formula:
r1=6−3±9−4(3)(−2)=6−3±33
A rate cannot be negative, and 33≈5.745, so the minus root is discarded and r1=633−3.
Step 4: Convert back to times. Rationalising the denominator each time:
t1=r11=33−36=33−96(33+3)=246(33+3)=433+3t2=t1+1=433+3+44=433+7,t3=2t1=4233+6Step 5: Average them. Note the question asks for the average of the *times*, not of the rates - averaging rates instead is the single most common way to lose this mark.
t1+t2+t3=4(33+3)+(33+7)+(233+6)=4433+16=33+4Average=333+4Step 6: Sanity check the numbers. Numerically t1≈2.19, t2≈3.19, t3≈4.37 hours. Every one exceeds 1 hour, as it must - a lone worker cannot beat all three together. Their gap t2−t1 is exactly 1, t3 is exactly double t1, and t11+t21+t31=1 to twelve decimal places. All three given conditions hold.
Final Answer:333+4
Q21:ipmat indore 2020QA › Set TheoryMediumMCQ · MCQ
In a class, students are assigned roll numbers from 1 to 140. All students with even roll numbers opted for cricket, all those whose roll numbers are divisible by 5 opted for football, and all those whose roll numbers are divisible by 3 opted for basketball. The number of students who did not opt for any of the three sports is
A102
B38
C98
D42
Pick an option to attempt
The Setup: This is Inclusion-Exclusion. We count the students playing at least one sport (the union of the three sets), then subtract from 140 to get the NPCs playing nothing. Note the sets overlap heavily - a roll number like 30 is in all three - which is exactly why we cannot simply add.
Step 1: Calculate the single sets. Counting multiples of k up to 140 is ⌊k140⌋.
∣A∣(cricket, 2)=⌊2140⌋=70,∣B∣(football, 5)=⌊5140⌋=28,∣C∣(basketball, 3)=⌊3140⌋=46Step 2: Calculate the pairwise intersections. A student in two sets has a roll number divisible by both divisors, so the correct counter is their LCM - not their product. Here 2,3,5 are pairwise coprime, so the LCM happens to equal the product, but that coincidence is what makes this step safe; with divisors like 2 and 4 the product would give a wrong count.
∣A∩B∣(LCM=10)=⌊10140⌋=14,∣A∩C∣(LCM=6)=⌊6140⌋=23,∣B∩C∣(LCM=15)=⌊15140⌋=9Step 3: Calculate the triple intersection.∣A∩B∩C∣(LCM=30)=⌊30140⌋=4Step 4: Execute the formula.∣A∪B∪C∣=∣A∣+∣B∣+∣C∣−∣A∩B∣−∣A∩C∣−∣B∩C∣+∣A∩B∩C∣=70+28+46−14−23−9+4=144−46+4=102Step 5: Take the complement. That 102 is the number who play at least one sport, so:
140−102=38
Watch the trap: 102 is sitting right there as option 1. It is the union, not the answer - the question asks for everyone *outside* it.
Final Answer: 38
Q22:ipmat indore 2020QA › FunctionsEasyMCQ · MCQ
Given f(x)=x2+log3x and g(y)=2y+f(y), then the value of g(3) equals
A16
B15
C25
D26
Pick an option to attempt
The Setup: Pure function evaluation. No theory required - just substitute from the outside in, respecting each definition exactly as written.
Step 1: Set up the outer function. The definition is g(y)=2y+f(y), so at y=3:
g(3)=2(3)+f(3)=6+f(3)
Note the variable name is a red herring: f is written in x and g in y, but a function does not care what its argument is called. Feeding 3 into f is the same operation either way.
Step 2: Evaluate the nested function. Using f(x)=x2+log3x at x=3:
f(3)=32+log33
We have 32=9, and any log of its own base is 1, since logbb=1 means *what power of b gives b?* - namely 1. So log33=1 and x=3>0 keeps the log defined.
f(3)=9+1=10Step 3: Recombine. Substitute back:
g(3)=6+10=16Final Answer: 16
A 2×2 matrix is filled with four distinct integers randomly chosen from the set {1,2,3,4,5,6}. Then the probability that the matrix generated in such a way is singular is
A452
B451
C154
D151
Pick an option to attempt
The Setup: A 2×2 matrix M=(acbd) is singular when its determinant vanishes, i.e. ad−bc=0, so we need the main-diagonal product to equal the anti-diagonal product: ad=bc. The whole question reduces to finding which four numbers from {1,2,3,4,5,6} can be split into two disjoint pairs of equal product.
Step 1: Calculate the total sample space. We pick 4 distinct numbers from 6 and place them in 4 labelled positions, so order matters - this is a permutation:
Total outcomes=P(6,4)=6×5×4×3=360Step 2: Find every pair of pairs with equal products. Rather than assert it, list all 15 pairs and their products outright:
Pair
Product
Pair
Product
Pair
Product
(1,2)
2
(2,4)
8
(3,5)
15
(1,3)
3
(2,5)
10
(3,6)
18
(1,4)
4
(2,6)
12
(4,5)
20
(1,5)
5
(3,4)
12
(4,6)
24
(1,6)
6
(2,3)
6
(5,6)
30
Exactly two product values repeat, and in both cases the two pairs are disjoint (they share no element, which is required since all four entries must be distinct):
* Product 6: {1,6} and {2,3}
* Product 12: {2,6} and {3,4}
Every other product in the table is unique, so no further singular matrices exist.
Step 3: Count matrix arrangements. Take product 6. Put {1,6} on the main diagonal (a,d) and {2,3} on the anti-diagonal (b,c):
* Arrangements of {1,6} across a,d: 2!=2
* Arrangements of {2,3} across b,c: 2!=2
That gives 2×2=4 matrices. But the two pairs can also switch diagonals - {2,3} on the main, {1,6} on the anti - for another 4. So product 6 contributes 8 matrices, and by identical logic so does product 12.
Step 4: Final probability.Singular matrices=8+8=16⟹P=36016=452Final Answer:452
Ashok started a business with a certain investment. After a few months, Bharat joined him investing half the amount of Ashok's initial investment. At the end of the first year, the total profit was divided between them in the ratio 3:1. Bharat joined Ashok after
A2 months
B3 months
C4 months
D6 months
Pick an option to attempt
The Setup: In partnership accounting, profit is shared in proportion to each partner's *capital-months* - the money put in multiplied by how long it stayed in. Two partners with the same capital but different durations do not split evenly, and that is the whole mechanism here.
Step 1: Define Ashok's stats. Let Ashok's investment be 2x (choosing 2x rather than x keeps Bharat's half a whole number). He started the business, so his money was in for the full 12 months:
Ashok’s capital-months=2x×12=24xStep 2: Define Bharat's stats. Bharat invested half of Ashok's amount, so his capital is x. Let it stay in for t months:
Bharat’s capital-months=x×t=xtStep 3: Equate to the profit ratio. Profit splits 3:1 in the order the partners are named, Ashok to Bharat:
Bharat’s capital-monthsAshok’s capital-months=13⟹xt24x=3Step 4: Solve for the duration. Capital is positive, so x cancels safely:
t24=3⟹3t=24⟹t=8Step 5: Convert duration into a joining date - do not stop at Step 4. The number 8 is how long Bharat's money was *invested*, but the question asks when he joined. In a 12-month year, being invested for the last 8 months means he sat out the first four:
12−8=4 months
Answering 8 here is the intended trap, and it is why the question is phrased 'Bharat joined Ashok after' rather than asking for his investment period.
Final Answer: 4 months
Q25:ipmat indore 2020QA › Mean, Median & ModeHardMCQ · MCQ
The average marks of 6 students in a test is 64. All the students got different marks, one of the students obtained 70 marks and all other students scored 40 or above. The maximum possible difference between the second highest and the second lowest marks is
A50
B54
C57
D58
Pick an option to attempt
The Setup: A min-maxing puzzle wearing a statistics costume. Sort the six marks as S1>S2>S3>S4>S5>S6, so the second highest is S2 and the second lowest is S5. We want to maximise S2−S5 subject to a fixed total, all marks distinct integers of at least 40, and one of them being exactly 70.
Step 1: Set the baseline constraints. Six students averaging 64 gives a fixed budget:
Total=6×64=384Step 2: Pin the floor.S6≥40, and since the marks are distinct integers, S5≥S6+1≥41. So S5=41 is the best we can ever do, achieved by putting S6=40. Every point saved at the bottom is a point available at the top, so this choice never costs us anything.
Step 3: Decide where the mandatory 70 goes. This is the real work, and it needs all cases checked rather than a lucky guess:
* **70 as S1 or S2:** then S2≤70, so the difference is at most 70−41=29. Dead.
* **70 as S5 or S6:** impossible. If S5=70 then S1,…,S4 all exceed 70, so they total at least 71+72+73+74=290; adding 70 and S6≥40 already gives 400>384. Placing 70 even lower is worse still.
* **70 as S4:** then S3≥71, and with S5=41,S6=40 the top three share 384−70−41−40=233. Minimising S3 at 71 leaves S1+S2=162, and S1>S2 forces S2≤80. Difference at most 80−41=39. Still beaten.
* **70 as S3: the surviving case, examined next.
Step 4: Work the winning case.** With 70 at S3, the two marks below it must be distinct integers between 41 and 69, and pushing them as low as possible frees the most budget for the top: S4=42, S5=41, S6=40. That leaves:
S1+S2=384−(70+42+41+40)=384−193=191
To make S2 as large as possible we want S1 as close above it as possible. Since 191 is odd, the tightest legal split of S1>S2 is 96 and 95:
S1=96,S2=95Step 5: Confirm the set is legal and compute. The marks are 96,95,70,42,41,40 - six distinct integers, all at least 40, one exactly 70, summing to 384. Every condition holds.
S2−S5=95−41=54
Since Step 3 ruled out every other placement of 70 with a strictly smaller ceiling, 54 is the true maximum.
Final Answer: 54