All 20 MCQ previous year questions (PYQs) from the IPMAT Indore 2021 past year paper, with answers and full solutions.
Free SolutionsNo Login20 Questions
Q1:ipmat indore 2021QA › FunctionsMediumMCQ · MCQ
Suppose that a real-valued function f(x) of real numbers satisfies f(x+xy)=f(x)+f(xy) for all real x,y, and that f(2020)=1. Compute f(2021).
A20202021
B20192020
C1
D20212020
Pick an option to attempt
The Setup: We are dealing with functional equations, which is essentially algebra's version of reverse-engineering a game engine. We need to find the core behavior of f(x) by plugging in strategic dummy variables until the underlying algorithm reveals itself.
Step 1: Test the waters by setting y=0 to find the baseline.
f(x+0)=f(x)+f(0)⟹f(x)=f(x)+f(0)⟹f(0)=0Step 2: Unlock the additive property. For any x=0 and any real z, just pick y=z/x - then xy=z, and the given equation morphs into:
f(x+z)=f(x)+f(z)
Together with Step 1 (which covers x=0), f is additive across the reals.
Step 3: Stack that property. Applying it repeatedly gives f(nt)=nf(t) for every positive integer n. That is the *only* thing we need - so we never have to assume f is linear or even continuous, which would be an unearned leap.
Step 4: Use the given stat f(2020)=1, taking t=1 and n=2020.
2020f(1)=f(2020)=1⟹f(1)=20201Step 5: Calculate the final target with n=2021.
f(2021)=2021f(1)=20202021Final Answer:20202021
Q2:ipmat indore 2021QA › LogarithmsEasyMCQ · MCQ
Suppose that log2[log3(log4a)]=log3[log4(log2b)]=log4[log2(log3c)]=0 then the value of a+b+c is
A105
B71
C89
D37
Pick an option to attempt
The Setup: This is a logarithm inception puzzle. We just need to peel it back layer by layer like an onion. The golden rule here: if logx(Y)=0, then Y=x0=1.
Step 1: Crack the code for a.
log2[log3(log4a)]=0⟹log3(log4a)=20=1log4a=31=3⟹a=43=64Step 2: Crack the code for b.
log3[log4(log2b)]=0⟹log4(log2b)=30=1log2b=41=4⟹b=24=16Step 3: Crack the code for c.
log4[log2(log3c)]=0⟹log2(log3c)=40=1log3c=21=2⟹c=32=9Step 4: Add the squad together to find a+b+c.
a+b+c=64+16+9=89Final Answer: 89
Let Sn be sum of the first n terms of an A.P. If S5=S9, what is the ratio of a3:a5
A9:5
B5:9
C3:5
D5:3
Pick an option to attempt
The Setup: We are working with Arithmetic Progressions. The standard sum formula is Sn=2n(2a+(n−1)d). We need to build an algebraic equation equating the two given sums to find the direct relationship between the first term (a) and the common difference (d).
Step 1: Expand both sides using the sum formula.
S5=25(2a+4d)=5(a+2d)=5a+10dS9=29(2a+8d)=9(a+4d)=9a+36dStep 2: Set them equal and isolate a in terms of d.
5a+10d=9a+36d−4a=26d⟹2a=−13d⟹a=−6.5dStep 3: Find the expressions for the specific requested terms, a3 and a5.
a3=a+2d=−6.5d+2d=−4.5da5=a+4d=−6.5d+4d=−2.5dStep 4: Calculate the ratio. The negative signs and the d variables cancel out cleanly.
Ratio=−2.5d−4.5d=2.54.5=2545=59Final Answer:9:5
If A,B and A+B are non singular matrices and AB=BA then 2A−B−A(A+B)−1A+B(A+B)−1B equals
AA
BB
CA + B
DI
Pick an option to attempt
The Setup: Matrix algebra usually blocks you from treating matrix multiplication like standard variables because AB=BA. However, the prompt gives us the AB=BA buff. This means A and B commute. Even better, since A(A+B)=A2+AB=A2+BA=(A+B)A, matrix A also commutes with (A+B) and its inverse (A+B)−1.
Step 1: Group the complicated inverse terms together to see what we're working with. Because A commutes with (A+B)−1, we can rewrite A(A+B)−1A as A2(A+B)−1. The identical argument runs for B (it commutes with A+B for exactly the same reason), so B(A+B)−1B becomes B2(A+B)−1.
−A2(A+B)−1+B2(A+B)−1=(B2−A2)(A+B)−1Step 2: Factor the difference of squares. Because AB=BA, the cross terms cancel out perfectly, allowing standard factorization.
B2−A2=(B−A)(B+A)Step 3: Substitute the factored form back in. Notice that matrix addition is always commutative, so (B+A)=(A+B).
(B−A)(A+B)(A+B)−1
Since (A+B) multiplied by its inverse is the Identity matrix (I), this entire chunk simplifies to just (B−A).
Step 4: Plug this beautifully simplified chunk back into the main equation.
2A−B+(B−A)2A−B+B−A=AFinal Answer: A
If the angles A,B,C of a triangle are in arithmetic progression such that sin(2A+B)=1/2 then sin(B+2C) is equal to
A2−1
B21
C2−1
D23
Pick an option to attempt
The Setup: Geometry meets Trigonometry. The angles of a triangle always sum to 180∘. If they are in an Arithmetic Progression, the middle angle acts as the perfect average, completely locking in its value from the start.
Step 1: Find angle B. Since A, B, C are in AP:
A+C=2B
Substitute this into the triangle angle sum theorem:
A+B+C=180∘⟹2B+B=180∘⟹3B=180∘⟹B=60∘Step 2: Use the sine condition to find angle A. We know sin(2A+B)=1/2. Since A+C=120∘, angle A is stuck below 120∘, so 2A+60∘ never climbs past 300∘ - that leaves exactly two candidates, 30∘ and 150∘.
* If 2A+60∘=30∘⟹2A=−30∘ (Angles in a triangle must be positive, so this is a wipe).
* If 2A+60∘=150∘⟹2A=90∘⟹A=45∘.
Step 3: Find angle C.
C=180∘−(A+B)=180∘−(45∘+60∘)=75∘Step 4: Plug the stats into the final equation sin(B+2C).
B+2C=60∘+2(75∘)=60∘+150∘=210∘sin(210∘)=sin(180∘+30∘)=−sin(30∘)=−21Final Answer:2−1
Q6:ipmat indore 2021QA › Unit DigitMediumMCQ · MCQ
The unit digit in (743)85−(525)37+(987)96 is ________
A9
B3
C1
D5
Pick an option to attempt
The Setup: Unit digit mechanics operate on a strict modulo-10 cyclicity. We don't care about the massive numbers; we only care about the final digit of the base and the remainder of the exponent when divided by its cycle length.
Step 1: Analyze the first term: 74385.
The unit digit depends entirely on 385. The powers of 3 cycle in a 4-step loop (3, 9, 7, 1). Divide the exponent 85 by 4 to find the remainder.
85=4×21+1
Since the remainder is 1, it hits the first step of the cycle. The unit digit is 31=3.
Step 2: Analyze the second term: 52537.
This is a freebie. Any positive integer power of a number ending in 5 will always end in 5. The unit digit is 5.
Step 3: Analyze the third term: 98796.
The unit digit depends on 796. The powers of 7 also cycle in a 4-step loop (7, 9, 3, 1). Divide 96 by 4.
96=4×24+0
Since it divides perfectly (remainder 0), it lands on the final step of the cycle. The unit digit is 1.
Step 4: Combine the unit digits.
3−5+1=−1
Since we can't output a negative unit digit in a standard integer, we simulate borrowing a 10 from the next placeholder column over (just like elementary school subtraction).
10−1=9Final Answer: 9
The set of all real value of p for which the equation 3sin2x+12cosx−3=p has at least one solution is
A[−12,12]
B[−12,9]
C[−15,9]
D[−15,12]
Pick an option to attempt
The Setup: We are converting a trig equation into a standard quadratic to find its absolute range (the min and max values of p). Since the equation involves both sine and cosine, we use the identity sin2x=1−cos2x to unify the variables.
Step 1: Substitute and simplify the expression. Let f(x)=p.
3(1−cos2x)+12cosx−3=p3−3cos2x+12cosx−3=p−3cos2x+12cosx=pStep 2: Set up a boundary replacement. Let t=cosx. Because of the constraints of the cosine function, t is strictly bounded: t∈[−1,1].
Our new function is g(t)=−3t2+12t. We need the absolute min and max of this quadratic on the locked interval [−1,1].
Step 3: Find the vertex of the parabola. For a quadratic at2+bt+c, the vertex occurs at t=−b/(2a).
t=2(−3)−12=−6−12=2
The vertex sits at t=2, which is completely outside our playable zone of [−1,1]. Because it's a downward-opening parabola (negative a), it is strictly increasing across our entire [−1,1] interval.
Step 4: Test the boundaries to find the range.
* If t=−1 (Minimum): g(−1)=−3(−1)2+12(−1)=−3−12=−15.
* If t=1 (Maximum): g(1)=−3(1)2+12(1)=−3+12=9.
The function seamlessly spans every value between these two extremes.
Final Answer:[−15,9]
ABCD is a quadrilateral whose diagonals AC and BD intersect at O. If triangles AOB and COD have areas 4 and 9 respectively, then the minimum area that ABCD can have is
A26
B25
C21
D16
Pick an option to attempt
The Setup: This relies on a sick geometric property. For *any* quadrilateral where diagonals intersect at O, the products of the areas of opposite triangles are perfectly equal. Let the areas be A1, A2, A3, A4 circling the intersection. We are given A1=4 and A3=9. We need to optimize A2 and A4 to minimize the total sum.
Step 1: Apply the cross-product area rule.
A1×A3=A2×A44×9=A2×A4⟹A2×A4=36Step 2: Set up the total area equation.
Total Area=A1+A2+A3+A4=4+A2+9+A4=13+A2+A4Step 3: Deploy the AM-GM (Arithmetic Mean-Geometric Mean) inequality to minimize the variable part. AM-GM states that for any non-negative numbers, their sum is bounded by their product: x+y≥2xy.
A2+A4≥2A2×A4A2+A4≥236=2(6)=12
The absolute minimum sum these two triangles can mathematically contribute is 12 (which occurs when A2=A4=6).
Step 4: Add the locked constants back to find the overall minimum area.
Min Total Area=13+12=25Final Answer: 25
The highest possible value of the ratio of a four-digit number and the sum of its four digits is
A1000
B277.75
C900.1
D999
Pick an option to attempt
The Setup: We want to min-max a fraction mathematically. Let the four-digit number be formatted as 1000a+100b+10c+d. We want to maximize the ratio a+b+c+d1000a+100b+10c+d.
Step 1: Use an algebraic reduction to isolate the variables. Let S=a+b+c+d. We can rewrite the numerator in terms of S.
1000a+100b+10c+d=1000(S−b−c−d)+100b+10c+d=1000S−1000b−1000c−1000d+100b+10c+d=1000S−900b−990c−999dStep 2: Reconstruct the ratio with the new expression.
Ratio=S1000S−900b−990c−999dRatio=1000−S900b+990c+999dStep 3: Optimize the equation. To maximize the overall ratio, we must completely minimize the fraction being subtracted. Since b, c, and d are digits (meaning they are non-negative integers ≥0), the absolute smallest value for the subtracted term is 0. This occurs when we hard-lock the nerfed variables to zero: b=0, c=0, d=0.
Step 4: Calculate the ratio with the optimized stats.
Ratio=1000−0=1000
(For example, if the number is 9000, the sum of digits is 9. 9000/9=1000. It mathematically cannot get higher than this).
Final Answer: 1000
Consider the polynomials f(x)=ax2+bx+c, where a>0,b,c are real, g(x)=−2x. If f(x) cuts the x-axis at (−2,0) and g(x) passes through (a,b), then the minimum value of f(x)+9a+1 is
A0
B1
C2
D3
Pick an option to attempt
The Setup: We need to trace the clues to build the quadratic equation f(x) entirely in terms of the variable a. Once we have the pure function, we can calculate its vertex to find its lowest possible floor, and then plug that into the final target expression.
Step 1: Use the g(x) coordinate to crack the value of b. The line g(x) passes through (a,b), so we literally just plug those coordinates in.
b=−2(a)⟹b=−2aStep 2: Use the x-intercept to crack c. The function f(x) hits the axis at x=−2, meaning f(−2)=0.
a(−2)2+b(−2)+c=04a−2b+c=0
Substitute b=−2a into this equation:
4a−2(−2a)+c=0⟹4a+4a+c=0⟹8a+c=0⟹c=−8aStep 3: Construct the final quadratic and find its minimum.
f(x)=ax2−2ax−8a=a(x2−2x−8)
For an upward-facing parabola (a>0), the minimum value occurs exactly at its vertex x=−bnew/(2anew).
x=2(a)−(−2a)=2a2a=1Step 4: Calculate the minimum y-value of f(x) by plugging in x=1.
f(1)=a(12)−2a(1)−8a=a−2a−8a=−9aStep 5: Evaluate the final target expression f(x)+9a+1 at its minimum point.
(−9a)+9a+1=1Final Answer: 1
Q11:ipmat indore 2021QA › Set TheoryMediumMCQ · MCQ
In a city, 50% of the population can speak in exactly one language among Hindi, English and Tamil, while 40% of the population can speak in at least two of these three languages. Moreover, the number of people who cannot speak in any of these three languages is twice the number of people who can speak in all these three languages. If 52% of the population can speak in Hindi and 25% of the population can speak exactly in one language among English and Tamil, then the percentage of the population who can speak in Hindi and in exactly one more language among English and Tamil is
A22%
B25%
C30%
D38%
Pick an option to attempt
The Setup: This is a 3-set Venn Diagram problem. Think of the three languages as mutual circles in a social network. We're going to break down the total population (100%) into specific overlapping zones to find the targeted demographic.
Step 1: Establish the baseline stats. We know 50% speak exactly one language, and 40% speak at least two. That means the total active user base speaking *any* of the three languages is 50%+40%=90%.
The people speaking zero languages (the 'None' group) make up the remainder: 100%−90%=10%.
Step 2: Isolate the top-tier group (All 3). The prompt states the 'None' group (10%) is exactly twice the size of the 'All 3' group. So, All 3=10%/2=5%.
Step 3: Break down the 'At least two' category. This group (40%) includes people speaking exactly two languages AND people speaking all three.
Exactly Two=40%−5%=35%Step 4: Find the solo Hindi speakers. The 'Exactly One' group is 50% total. We are told 25% speak exactly one language among English and Tamil (meaning Only E + Only T = 25%). Therefore, the Only Hindi group is the remainder:
Only Hindi=50%−25%=25%Step 5: Solve for the target. We know 52% of the population speaks Hindi in total. The total Hindi circle is made up of: Only Hindi (25%) + All 3 (5%) + Hindi & Exactly One More (which is our target).
52%=25%+5%+Target52%=30%+Target⟹Target=22%Final Answer: 22%
Q12:ipmat indore 2021QA › Time, Speed & DistanceEasyMCQ · MCQ
A train left point A at 12 noon. Two hours later, another train started from point A in the same direction. It overtook the first train at 8 PM. It is known that the sum of the speeds of the two trains is 140 km/hr. Then, at what time would the second train overtake the first train, if instead the second train had started from point A in the same direction 5 hours after the first train? Assume that both the trains travel at constant speeds.
A3 AM the next day
B4 AM the next day
C8 AM the next day
D11 PM the same day
Pick an option to attempt
The Setup: This is a Time, Speed, and Distance chase sequence. We have a slow train (Train 1) and a fast train (Train 2) catching up. First, we need to mathematically unmask their individual speeds using the 8 PM catch-up event.
Step 1: Calculate travel times for the first scenario. Train 1 left at 12 noon and got caught at 8 PM, meaning it traveled for 8 hours. Train 2 left 2 hours later (2 PM) and caught up at 8 PM, meaning it traveled for 6 hours.
Step 2: Equate their distances. Since Train 2 caught Train 1, they covered the exact same distance. Let their speeds be V1 and V2.
8V1=6V2⟹4V1=3V2⟹V2=34V1Step 3: Use the combined speed stat to solve for V1.
V1+V2=140V1+34V1=140⟹37V1=140⟹V1=60 km/hr
Since V1 is 60, V2=140−60=80 km/hr.
Step 4: Set up the alternate timeline. Train 2 now starts 5 hours late. Let t be the total hours Train 1 travels until it gets caught. Train 2 will have traveled t−5 hours.
Equate the new distances:
60t=80(t−5)60t=80t−400⟹20t=400⟹t=20 hoursStep 5: Map the time back to the clock. Train 1 started at 12 noon. 20 hours later lands us exactly at 8 AM the next day.
Final Answer: 8 AM the next day
The number of 5-digit numbers consisting of distinct digits that can be formed such that only odd digits occur at odd places is
A5250
B6240
C2520
D3360
Pick an option to attempt
The Setup: Permutations and Combinations puzzle with strict placement rules. We are building a 5-digit number (Positions 1, 2, 3, 4, 5). The odd positions (1st, 3rd, 5th) are strictly reserved for odd digits.
Step 1: Draft the odd squad. We have exactly 5 odd digits available (1, 3, 5, 7, 9). We need to select 3 of them and arrange them into the 3 odd slots.
Number of ways to fill odd places = P(5,3)=5×4×3=60 ways.
Step 2: Assess the remaining free agents. We have 5 even digits (0, 2, 4, 6, 8) and 2 leftover odd digits that didn't get drafted into the odd slots. That gives us a pool of 7 distinct digits.
Step 3: Draft for the even slots (2nd and 4th). The prompt says 'only odd digits occur at odd places', which means odd places are restricted, but even places are fully unrestricted. They can accept any remaining digit, including zero, because the 1st digit is already guaranteed to be a non-zero odd digit.
We select 2 digits from the pool of 7 and arrange them.
Number of ways to fill even places = P(7,2)=7×6=42 ways.
Step 4: Multiply the independent events to find the total combinations.
Total Numbers=60×42=2520Final Answer: 2520
There are 10 points in the plane, of which 5 points are collinear and no three among the remaining are collinear. Then the number of distinct straight lines that can be formed out of these 10 points is
A10
B25
C35
D36
Pick an option to attempt
The Setup: Geometric Combinatorics. To draw a straight line, you literally just need to connect 2 points. Normally, you'd calculate all possible pairs. But when points are collinear (sitting on the exact same line), connecting any two of them just redraws the exact same line. We have to filter out the duplicates.
Step 1: Calculate the raw, unfiltered max number of lines. Choosing any 2 points out of 10 gives us:
(210)=210×9=45 possible pairsStep 2: Calculate the overlapping spam. The 5 collinear points are generating redundant lines. If we picked pairs exclusively from these 5 points, we'd get:
(25)=25×4=10 redundant pairsStep 3: Clean up the geometry. We subtract all 10 redundant pairs from our total because they don't form unique lines. However, we still have to add 1 back in to represent the single, massive straight line that all 5 of those points are sitting on.
Total Distinct Lines=45−10+1=36Final Answer: 36
The x-intercept of the line that passes through the intersection of the lines x+2y=4 and 2x+3y=6, and is perpendicular to the line 3x−y=2 is
A2
B0.5
C4
D6
Pick an option to attempt
The Setup: Coordinate Geometry boss rush. We have to find an intersection point, calculate a perpendicular slope, build a brand new line equation, and finally snipe its x-intercept.
Step 1: Find the crossover point of x+2y=4 and 2x+3y=6.
Multiply the first equation by 2: 2x+4y=8.
Subtract the second equation from it:
(2x+4y)−(2x+3y)=8−6⟹y=2
Plug y=2 back into the first equation:
x+2(2)=4⟹x+4=4⟹x=0
The lines intersect at (0,2). This is our anchor point.
Step 2: Steal the slope from the reference line. The reference is 3x−y=2, which rearranges to y=3x−2. The slope (m) is 3.
Step 3: Calculate the perpendicular slope. Perpendicular lines have negative reciprocal slopes.
m⊥=−31Step 4: Build the final line equation using the point-slope form with our anchor point (0,2) and new slope −1/3.
y−2=−31(x−0)3y−6=−x⟹x+3y=6Step 5: Find the x-intercept. The x-intercept always occurs exactly when y=0.
x+3(0)=6⟹x=6Final Answer: 6
In a football tournament six teams A, B, C, D, E, and F participated. Every pair of teams had exactly one match among them. For any team, a win fetches 2 points, a draw fetches 1 point, and a loss fetches no points. Both teams E and F ended with less than 5 points. At the end of the tournament points table is as follows (some of the entries are not shown):
Teams
Played
Wins
Losses
Draws
Points
A
5
0
8
B
5
2
6
C
5
2
5
D
5
1
5
E
5
1
F
5
It is known that: (1) team B defeated team C, and (2) team C defeated team D
show less
Total number of matches ending in draw is
A12
B4
C5
D6
Pick an option to attempt
The Setup: Six teams, every pair meets once, so (26)=15 matches. Each match hands out exactly 2 points (2-0 for a decision, 1-1 for a draw), so the whole tournament is worth 15×2=30 points - that fixed total is the key that opens the table. For any team, played = wins + losses + draws =5 and points =2(wins)+draws.
Step 1: Decode A through D. Two equations per team, and both are already given (losses and points):
* A - 0 losses, so w+d=5; with 2w+d=8, subtracting gives w=3,d=2.
* B - 2 losses, so w+d=3; with 2w+d=6, w=3,d=0.
* C - 2 losses, so w+d=3; with 2w+d=5, w=2,d=1.
* D - 1 loss, so w+d=4; with 2w+d=5, w=1,d=3.
Step 2: E is forced by the under-5 clause. E has 1 loss, so w+d=4 and points =2w+d=w+4. For E to stay under 5 points we need w<1, so w=0, d=4, and E finishes on 4 points - a single win anywhere would break the clause.
Step 3: F falls out of the 30-point total.
F=30−(8+6+5+5+4)=30−28=2 pointsStep 4: Split F's 2 points - and this is the step worth slowing down on. Two ways to score 2: 1 win, 0 draws, 4 losses; or 0 wins, 2 draws, 3 losses. Look at E to kill the first one. E must draw *four* of its five matches. B has 0 draws, so B is not one of E's partners. If F also had 0 draws, E's only available partners would be A, C and D - three teams for four draws, which is impossible. So F must carry draws, and **F is 0 wins, 2 draws, 3 losses.Step 5:** The completed table.
Teams
Played
Wins
Losses
Draws
Points
A
5
3
0
2
8
B
5
3
2
0
6
C
5
2
2
1
5
D
5
1
1
3
5
E
5
0
1
4
4
F
5
0
3
2
2
Step 6: The table plus the two given results actually pins every single match. E draws A, C, D and F and loses to B (Step 4). D's one loss is to C, so its three draws are A, E, F and it beats B. A never loses and draws only D and E, so it beats B, C and F. C's two losses are to A and B; its win over D and its draw with E are known, so it beats F. That leaves F losing to A, B and C. Master Matrix - each cell is the row team's result:
A
B
C
D
E
F
A
-
W
W
D
D
W
B
L
-
W
L
W
W
C
L
L
-
W
D
W
D
D
W
L
-
D
D
E
D
L
D
D
-
D
F
L
L
L
D
D
-
Step 7: Count the draws. The Draws column totals 2+0+1+3+4+2=12, but every drawn match is counted twice - once for each team. So the number of matches that ended in a draw is:
212=6Final Answer: 6
In a football tournament six teams A, B, C, D, E, and F participated. Every pair of teams had exactly one match among them. For any team, a win fetches 2 points, a draw fetches 1 point, and a loss fetches no points. Both teams E and F ended with less than 5 points. At the end of the tournament points table is as follows (some of the entries are not shown):
Teams
Played
Wins
Losses
Draws
Points
A
5
0
8
B
5
2
6
C
5
2
5
D
5
1
5
E
5
1
F
5
It is known that: (1) team B defeated team C, and (2) team C defeated team D
show less
Which team has the highest number of draws
AA
BC
CD
DE
Pick an option to attempt
The Setup: This is the same tournament table as the rest of the set. The full derivation lives on the first question of the set; here is the finished table it produces, which is all we need.
Teams
Played
Wins
Losses
Draws
Points
A
5
3
0
2
8
B
5
3
2
0
6
C
5
2
2
1
5
D
5
1
1
3
5
E
5
0
1
4
4
F
5
0
3
2
2
Step 1: Read straight down the Draws column: A has 2, B has 0, C has 1, D has 3, E has 4, F has 2.
Step 2: E tops it with 4 draws, and it is not close - D is next on 3. This is no accident: E is the team squeezed by the under-5-points clause, which forced four of its five matches to be draws.
Final Answer: E
In a football tournament six teams A, B, C, D, E, and F participated. Every pair of teams had exactly one match among them. For any team, a win fetches 2 points, a draw fetches 1 point, and a loss fetches no points. Both teams E and F ended with less than 5 points. At the end of the tournament points table is as follows (some of the entries are not shown):
Teams
Played
Wins
Losses
Draws
Points
A
5
0
8
B
5
2
6
C
5
2
5
D
5
1
5
E
5
1
F
5
It is known that: (1) team B defeated team C, and (2) team C defeated team D
show less
Total points Team F scored was
A0
B1
C2
D3
Pick an option to attempt
The Setup: This is the same tournament table as the rest of the set. The full derivation lives on the first question of the set; here is the finished table it produces, which is all we need.
Teams
Played
Wins
Losses
Draws
Points
A
5
3
0
2
8
B
5
3
2
0
6
C
5
2
2
1
5
D
5
1
1
3
5
E
5
0
1
4
4
F
5
0
3
2
2
Step 1: The tournament is worth a fixed 30 points - 15 matches, each handing out exactly 2 points whether it is decided or drawn.
Step 2: Subtract everyone else. A, B, C, D and E take 8+6+5+5+4=28 between them, so F is left with:
30−28=2 pointsStep 3: Sanity-check it against F's row: 0 wins and 2 draws is 2(0)+2=2 points. Consistent, and comfortably under the 5-point cap the question imposes on F.
Final Answer: 2
In a football tournament six teams A, B, C, D, E, and F participated. Every pair of teams had exactly one match among them. For any team, a win fetches 2 points, a draw fetches 1 point, and a loss fetches no points. Both teams E and F ended with less than 5 points. At the end of the tournament points table is as follows (some of the entries are not shown):
Teams
Played
Wins
Losses
Draws
Points
A
5
0
8
B
5
2
6
C
5
2
5
D
5
1
5
E
5
1
F
5
It is known that: (1) team B defeated team C, and (2) team C defeated team D
show less
Which team was not defeated by team A
AB
BC
CD
DF
Pick an option to attempt
The Setup: This is the same tournament table as the rest of the set. The full derivation lives on the first question of the set; here is the finished table it produces, which is all we need.
Teams
Played
Wins
Losses
Draws
Points
A
5
3
0
2
8
B
5
3
2
0
6
C
5
2
2
1
5
D
5
1
1
3
5
E
5
0
1
4
4
F
5
0
3
2
2
Step 1: A won 3 matches, so exactly two teams escaped it - and the options only offer B, C, D and F, so we need to find which of those four A did not beat.
Step 2: Go to D's row: D has exactly one loss. The question stem already tells us *who* dealt it - team C defeated D. That single loss is therefore spoken for.
Step 3: So D cannot have lost to A as well. A's match against D was one of A's two draws, which means D is a team A did not defeat.Step 4: Check the others quickly. B and C both sit on 2 losses; A is unbeaten and B's and C's losses are accounted for by A and each other (B beat C, so C's other loss is to A, and B's two losses are to A and D). F lost 3, including to A. D is the only option left standing. (E also escaped A, via a draw, but E is not on the menu.)
Final Answer: D
In a football tournament six teams A, B, C, D, E, and F participated. Every pair of teams had exactly one match among them. For any team, a win fetches 2 points, a draw fetches 1 point, and a loss fetches no points. Both teams E and F ended with less than 5 points. At the end of the tournament points table is as follows (some of the entries are not shown):
Teams
Played
Wins
Losses
Draws
Points
A
5
0
8
B
5
2
6
C
5
2
5
D
5
1
5
E
5
1
F
5
It is known that: (1) team B defeated team C, and (2) team C defeated team D
show less
Team E was defeated by
ATeams A and B only
BOnly Team A
COnly Team B
DTeams A, B and D only
Pick an option to attempt
The Setup: This is the same tournament table as the rest of the set. The full derivation lives on the first question of the set; here is the finished table it produces, which is all we need.
Teams
Played
Wins
Losses
Draws
Points
A
5
3
0
2
8
B
5
3
2
0
6
C
5
2
2
1
5
D
5
1
1
3
5
E
5
0
1
4
4
F
5
0
3
2
2
Step 1: E's row shows exactly one loss. So E was beaten by exactly one team - that alone wipes out 'Teams A and B only' and 'Teams A, B and D only', which both name two or more.
Step 2: Now find the one. E drew its other four matches. B is the only team in the whole table with zero draws, so B cannot be one of E's four draw partners - the only remaining relationship between B and E is a result, and E does not win at all (0 wins).
Step 3: Therefore B beat E, and since E has just the one loss, no one else did. A drew with E rather than beating it, which is exactly why 'Only Team A' fails.
Final Answer: Only Team B