IPMAT Indore 2025 — SA

The Setup: We are looking at a classic linear age progression problem. Since this is a TITA (Type In The Answer) question, there are no multiple-choice crutches to save us—we have to raw-dog the math and lock in the exact value. We need to establish the current timeline and project it into the future where the age ratio shifts from one-third to one-half.

Step 1: Establish the Current Era
Monica is currently 18 years old. Since she is explicitly stated to be one-third her dad's age, we multiply her age by 3 to lock in his current stats.
$$18 \times 3 = 54$$
Her dad is currently 54 years old.

Step 2: Set Up the Future Timeline
Let $x$ be the number of years it takes for this timeline shift to happen. Fast forward $x$ years: Monica will be $18+x$ years old, and her dad will level up to $54+x$ years old. The problem states that at this point, her age will be exactly half of his.
$$18+x = \frac{1}{2}(54+x)$$

Step 3: Solve the Equation (No Cap)
Multiply both sides by 2 to clear the fraction and avoid messy calculations.
$$2(18+x) = 54+x$$
$$36+2x = 54+x$$
Now, isolate $x$ by subtracting $x$ from both sides, and moving the 36 over.
$$x = 18$$
It will take exactly 18 years for this ratio to hit.

Step 4: Calculate the Final Age
Don't get baited by the $x$ value. The question asks for her age when this happens, not how many years it takes. Add the 18 years to her current age of 18.
$$18+18 = 36$$
Monica will be 36 years old when she is half her father's age.

Final Answer: 36

The Setup: We are dealing with a logical puzzle disguised as a matrix grid. We have 5 teams of 15 members each, meaning there are 75 total members. Since the three roles (Biologists, Geologists, Explorers) have equal total numbers, we just divide 75 by 3. That means exactly 25 Biologists, 25 Geologists, and 25 Explorers across the entire board. Time to build the matrix and min-max the stats.

Step 1: The Explorer Distribution (The Meta)
The problem states that the number of Explorers in each team strictly decreases in the order A > B > C > D > E. We also know they must sum up to 25, and every single team must have at least 2 of *each* role.
Let's find the maximum number of Explorers team A can have. Team A already has 6 Geologists (given) and must have at least 2 Biologists.
$$Max\_Explorers_A = 15 - 6 - 2 = 7$$
If Team A has a maximum of 7 Explorers, we need 5 strictly decreasing integers starting from $\le 7$ that sum to 25. There is literally only one valid sequence in the entire universe that satisfies this:
$$7 + 6 + 5 + 4 + 3 = 25$$
Lock it in:
Team A = 7, Team B = 6, Team C = 5, Team D = 4, Team E = 3.

Step 2: The Biologist Constraints (Vibe Check)
Now let's look at the Biologists ($B$). We know the total is 25.
The prompt feeds us free intel: $B_C = 6$ and $B_D = 6$.
This means the remaining Biologists for teams A, B, and E are:
$$25 - 6 - 6 = 13$$
So, $B_A + B_B + B_E = 13$.

Now we apply the heavy constraint: "Every team except A has more biologists than explorers."
* For Team B: $B_B > E_B \rightarrow B_B > 6 \rightarrow B_B \ge 7$
* For Team E: $B_E > E_E \rightarrow B_E > 3 \rightarrow B_E \ge 4$
* For Team A (the exception): It just needs to meet the baseline minimum of $B_A \ge 2$.

Step 3: Solving the Biologist Equation
We have our minimum thresholds: $B_A \ge 2$, $B_B \ge 7$, and $B_E \ge 4$.
Let's add these bare minimums together:
$$2 + 7 + 4 = 13$$
Since the sum of the absolute minimums equals exactly the total number of remaining Biologists (13), there is zero wiggle room. The math is mathing perfectly. None of these values can be higher, or the sum would break 13.
Therefore, $B_A = 2$, $B_B = 7$, and $B_E = 4$.

Step 4: The Audit (Double Check Protocol)
Let's run a full matrix audit to ensure we aren't throwing the game. We'll fill in the Geologists ($G$) using the formula $G = 15 - B - E$ to make sure no team breaks the rules.
* Team A: E=7, B=2, G=6. (Sum = 15, all $\ge 2$. Works. $G=6$ matches the prompt.)
* Team B: E=6, B=7, G=2. (Sum = 15, all $\ge 2$, $B > E$. Works.)
* Team C: E=5, B=6, G=4. (Sum = 15, all $\ge 2$, $B > E$. Works.)
* Team D: E=4, B=6, G=5. (Sum = 15, all $\ge 2$, $B > E$. Works.)
* Team E: E=3, B=4, G=8. (Sum = 15, all $\ge 2$, $B > E$. Works.)
Now, let's verify total Geologists:
$$6 + 2 + 4 + 5 + 8 = 25$$
Perfectly balanced, as all things should be. The board is fully validated and legally solved.

Final Answer: 4

The Setup:
This is a classic absolute value distance problem masquerading as pure algebra. We need to decode the 1D geometry hidden in the equation and min-max the constraints like we are optimizing a character build. No cap, this looks intimidating, but it's actually free points once you see the matrix.

Step 1: Decoding the Modulus (The Geometry Meta)
Let's look at the core equation:
$$|a-b| + |b-c| = |c-a|$$
In 1D geometry, $|x-y|$ represents the absolute distance between point $x$ and point $y$ on a number line.
The equation is literally saying: "The distance from $a$ to $b$, plus the distance from $b$ to $c$, equals the total distance from $a$ to $c$."
For this to hold true, point $b$ must lie exactly between $a$ and $c$ on the number line.

In both scenarios, $b$ is sandwiched in the middle. It can *never* be the largest of the three numbers.

Step 2: Pushing to the Limit (Max Stats)
We are given strict constraints for our variables:
* They are natural numbers (positive integers: 1, 2, 3...).
* They are distinct (no duplicates allowed).
* They are all less than 100.

To maximize $b$, we need to drag the entire sequence as high up the number line as possible.
The absolute ceiling is 100, but the numbers must be strictly *less* than 100.
So, our absolute maximum possible integer in this domain is 99.

Let's assign 99 to our top-end variable (let's say $a = 99$).
Since $b$ must be strictly less than the top-end variable ($b < a$), the largest possible integer we can assign to $b$ without hitting 99 is 98.
Then $c$ just has to be any natural number less than 98 (e.g., $c = 97$).

Step 3: The Audit (Double Check Protocol)
Running the numbers back to ensure we aren't throwing.
Let $a = 99$, $b = 98$, and $c = 97$. (All distinct natural numbers $< 100$. Checked.)
Plug them into the original equation:
$$|99 - 98| + |98 - 97| = |97 - 99|$$
$$|1| + |1| = |-2|$$
$$1 + 1 = 2$$
$$2 = 2$$
The logic is flawlessly validated. The absolute ceiling for $b$ is locked at 98.

Final Answer: 98

The Setup:
We are dealing with a round-robin tournament combinatorics problem. The base logic requires calculating the total number of matches in a perfect bracket, and then subtracting the matches that got canceled because a team got hit with the ban hammer. I have set up a stat box to extract the core data before we run the calculations.

Step 1: Extracting the Meta (Stat Box)
Let's map out exactly what is happening in this bracket before the suspension ruins the schedule.

Step 2: The Base Timeline
In a flawless, perfectly run round-robin tournament, every team plays every other team exactly once. The formula to find total unique handshakes (or matches) is $^nC_2$:
$$^8C_2 = \frac{8 \times 7}{2}$$
$$^8C_2 = 28$$
So, the organizers originally scheduled exactly 28 matches.

Step 3: Calculating the Dropped Matches
One team gets toxic and gets suspended.
Every single team in this tournament was scheduled to play 7 matches.
This suspended team managed to play exactly 3 matches before getting kicked.
To find the number of canceled matches, subtract what they played from what they were supposed to play:
$$7 - 3 = 4$$
Exactly 4 scheduled matches literally evaporated from the bracket.

Step 4: The Final Tally
Subtract the canceled matches from the total base schedule to find out how many matches actually happened.
$$28 - 4 = 24$$
There were 24 matches officially played that year.

Step 5: The Audit (Double Check Protocol)
Running it back using an alternative method to guarantee we aren't throwing.
Let's look at the tournament from the perspective of the 7 teams that *didn't* get banned.
If those 7 teams just played a private tournament among themselves, the total matches would be:
$$^7C_2 = \frac{7 \times 6}{2} = 21$$
Now, we just add the matches that the banned team played against 3 of these valid teams before getting kicked:
$$21 + 3 = 24$$
Both methods independently output exactly 24. The logic is completely locked in and validated. No cap.

Final Answer: 24

The Setup:
At first glance, this looks like a cursed sequence of logarithms, but if we peel back the formatting, it is literally just an Arithmetic Progression (AP) in disguise. We just need to unpack the logs, find the common difference to establish our AP meta, calculate the sum of the first 21 terms, and then repackage it to find our $m$ and $n$ values.

Step 1: Unpacking the Logs (The Vibe Check)
Let's analyze the first three terms to figure out exactly what kind of progression we are dealing with. Using the logarithm quotient rule ($\ln(x/y) = \ln(x) - \ln(y)$) and exponent rules, we can break them down:
* Term 1 ($T_1$): $\ln(\frac{a}{b}) = \ln(a) - \ln(b)$
* Term 2 ($T_2$): $\ln(\frac{a}{b\sqrt{b}}) = \ln(\frac{a}{b^{1.5}}) = \ln(a) - 1.5\ln(b)$
* Term 3 ($T_3$): $\ln(\frac{a}{b^2}) = \ln(a) - 2\ln(b)$

Step 2: **Finding the Common Difference ($D$)**
To confirm this is a standard AP and to find our step size, we subtract $T_1$ from $T_2$:
$$D = T_2 - T_1$$
$$D = (\ln(a) - 1.5\ln(b)) - (\ln(a) - \ln(b))$$
$$D = -0.5\ln(b)$$
The sequence is linearly dropping by $0.5\ln(b)$ every single term. This confirms we are working with an AP where the first term $A = \ln(a) - \ln(b)$ and the common difference $D = -0.5\ln(b)$.

Step 3: The Carry (Summing 21 Terms)
Now we deploy the standard AP sum formula for 21 terms:
$$S_n = \frac{n}{2} [2A + (n-1)D]$$
Plug in our $n = 21$, $A$, and $D$ values:
$$S_{21} = \frac{21}{2} [2(\ln(a) - \ln(b)) + (21-1)(-0.5\ln(b))]$$
$$S_{21} = \frac{21}{2} [2\ln(a) - 2\ln(b) + 20(-0.5\ln(b))]$$
$$S_{21} = \frac{21}{2} [2\ln(a) - 2\ln(b) - 10\ln(b)]$$
Combine the $\ln(b)$ terms to clean up the bracket:
$$S_{21} = \frac{21}{2} [2\ln(a) - 12\ln(b)]$$
Factor out the 2 inside the bracket to cancel the denominator and nerf the equation:
$$S_{21} = 21 [\ln(a) - 6\ln(b)]$$

Step 4: Repackaging the File
The question demands the final answer in the format $\ln(\frac{a^m}{b^n})$. We need to compress our result back into a single log expression using power rules ($k\ln(x) = \ln(x^k)$).
First, distribute the 21:
$$S_{21} = 21\ln(a) - 126\ln(b)$$
Now apply the power rule to push the coefficients back into the logs:
$$S_{21} = \ln(a^{21}) - \ln(b^{126})$$
Finally, use the quotient rule to merge them into one fraction:
$$S_{21} = \ln\left(\frac{a^{21}}{b^{126}}\right)$$

Step 5: The Audit (Double Check Protocol)
Let's match our final expression against the target form $\ln(\frac{a^m}{b^n})$.
By direct comparison:
$$m = 21$$
$$n = 126$$
The prompt asks for the value of $m + n$.
$$m + n = 21 + 126 = 147$$
Math is verified, rules applied correctly, logic is absolutely flawless.

Final Answer: 147

The Setup:
We are tackling a system of linear equations disguised as a set theory and word problem. It’s all about mapping out the states (Passed, Failed, Did Not Appear) for two separate exams. We just need to define our variables, translate the English into algebra, and solve the system without getting lost in the sauce.

Step 1: Defining the Variables (The Roster)
Let's define the base variables using the Math exam stats to keep it clean.
Let $x$ = Students who did not appear for Math.
Let $z$ = Students who appeared but failed Math.
Let $y$ = Students who appeared but failed English (our target variable).

Now we translate the constraints for the English exam and the rest of the Math exam based on the prompt:
* "Did not appear for English is twice did not appear for Math" $\rightarrow 2x$
* "Passed Math is twice appeared but failed English" $\rightarrow 2y$
* "Passed English is twice appeared but failed Math" $\rightarrow 2z$

Step 2: Building the State Equations
For both exams, the total class size is strictly locked at 120.
Total = (Passed) + (Failed) + (Did Not Appear)

Math Exam Equation:
$$2y (\text{Passed}) + z (\text{Failed}) + x (\text{Did Not Appear}) = 120$$
$$x + 2y + z = 120$$

English Exam Equation:
$$2z (\text{Passed}) + y (\text{Failed}) + 2x (\text{Did Not Appear}) = 120$$
$$2x + y + 2z = 120$$

Step 3: Solving the System (Speedrun Strat)
We have a 2-equation system and need to isolate $y$. Let's use the elimination method.
Take the Math equation and multiply the entire thing by 2 to align the $x$ and $z$ coefficients:
$$2(x + 2y + z) = 2(120)$$
$$2x + 4y + 2z = 240$$

Now, subtract the English equation from this scaled-up Math equation:
$$(2x + 4y + 2z) - (2x + y + 2z) = 240 - 120$$
The $x$ and $z$ terms completely cancel each other out, leaving us with a clean isolation:
$$3y = 120$$
$$y = 40$$

Step 4: The Audit (Double Check Protocol)
Let's run the numbers back to guarantee the logic holds.
If $y = 40$, we plug it into the Math equation:
$$x + 2(40) + z = 120 \rightarrow x + z = 40$$
If we plug it into the English equation:
$$2x + 40 + 2z = 120 \rightarrow 2x + 2z = 80 \rightarrow x + z = 40$$
The system is completely consistent. Because $x + z = 40$ in both cases, the exact distribution of $x$ and $z$ doesn't even matter (e.g., it could be $x=20, z=20$, or $x=10, z=30$). The value for $y$ is strictly locked at 40 no matter what. No cap, the solution is mathematically bulletproof.

Final Answer: 40

The Setup: We are literally entering the Matrix for this one. This is a linear algebra scaling problem where we need to find the cube of a $2 \times 2$ matrix, equate it to a scaled target matrix, and extract the hidden variables. I have fully audited the matrix multiplication below to ensure zero dropped frames.

Step 1: Squaring the Matrix (Level 1)
First, we need to find $A^2$ by multiplying matrix $A$ by itself. We use the standard row-by-column dot product method.
$$A^2 = \begin{bmatrix} 2 & n \\ 4 & 1 \end{bmatrix} \begin{bmatrix} 2 & n \\ 4 & 1 \end{bmatrix}$$
$$A^2 = \begin{bmatrix} (2)(2)+(n)(4) & (2)(n)+(n)(1) \\ (4)(2)+(1)(4) & (4)(n)+(1)(1) \end{bmatrix}$$
$$A^2 = \begin{bmatrix} 4+4n & 3n \\ 12 & 4n+1 \end{bmatrix}$$

Step 2: Cubing the Matrix (Boss Phase)
Now we multiply our $A^2$ result by $A$ to reach the final form, $A^3$.
$$A^3 = \begin{bmatrix} 4+4n & 3n \\ 12 & 4n+1 \end{bmatrix} \begin{bmatrix} 2 & n \\ 4 & 1 \end{bmatrix}$$
Let's calculate each element one by one to avoid throwing:
* Top-Left: $(4+4n)(2) + (3n)(4) = 8 + 8n + 12n = 8+20n$
* Top-Right: $(4+4n)(n) + (3n)(1) = 4n^2 + 4n + 3n = 4n^2+7n$
* Bottom-Left: $(12)(2) + (4n+1)(4) = 24 + 16n + 4 = 16n+28$
* Bottom-Right: $(12)(n) + (4n+1)(1) = 12n + 4n + 1 = 16n+1$

So, our fully loaded $A^3$ matrix is:
$$A^3 = \begin{bmatrix} 8+20n & 4n^2+7n \\ 16n+28 & 16n+1 \end{bmatrix}$$

Step 3: Decoding the Target Matrix
The problem gives us the target state for $A^3$. Let's distribute that scalar multiplier (27) into the matrix so we can match it element for element.
$$A^3 = 27\begin{bmatrix} 4 & q \\ p & r \end{bmatrix} = \begin{bmatrix} 108 & 27q \\ 27p & 27r \end{bmatrix}$$

Step 4: Extracting the Lore (Solving for Variables)
We now set the elements of our calculated $A^3$ equal to the target matrix. The top-left element is the key to unlocking the entire board because it only relies on $n$.
$$8+20n = 108$$
$$20n = 100$$
$$n = 5$$

Now substitute $n=5$ into the other elements to find $p$, $q$, and $r$:
* **Top-Right ($q$):** $4(5)^2 + 7(5) = 100 + 35 = 135$
$$27q = 135 \rightarrow q = 5$$
* **Bottom-Left ($p$):** $16(5) + 28 = 80 + 28 = 108$
$$27p = 108 \rightarrow p = 4$$
* **Bottom-Right ($r$):** $16(5) + 1 = 80 + 1 = 81$
$$27r = 81 \rightarrow r = 3$$

Step 5: The Final Calculation
The question asks for the sum of $p+q+r$. Just add up our freshly extracted stats.
$$4 + 5 + 3 = 12$$

Step 6: The Audit (Double Check Protocol)
Let's run a determinant check to confirm the matrix integrity.
If $n=5$, matrix $A = \begin{bmatrix} 2 & 5 \\ 4 & 1 \end{bmatrix}$.
The determinant of $A$ is $(2)(1) - (5)(4) = -18$.
Using determinant properties, $\det(A^3) = (\det(A))^3 = (-18)^3 = -5832$.
Now let's check the determinant of our target matrix $27\begin{bmatrix} 4 & 5 \\ 4 & 3 \end{bmatrix}$:
$$\det = 27^2 \times ((4)(3) - (5)(4)) = 729 \times (12 - 20) = 729 \times (-8) = -5832$$.
The determinants match perfectly. The math is completely flawless.

Final Answer: 12

The Setup:
We are literally back in the exact same lobby as Question 2. This is a follow-up question utilizing the same logical matrix we already decoded. Since we previously theory-crafted the exact distribution of all 75 members across the grid, we can just pull up our cached data and run a quick stat check to find out who has higher Geologist DPS than Biologist DPS. Free points, honestly.

Step 1: Retrieving the Master Matrix (From Memory)
Let's pull the fully solved grid we established earlier. Remember, every team has exactly 15 members, and each class (Explorer, Biologist, Geologist) totals exactly 25 across all teams.

Step 2: The Stat Check
The prompt asks for the number of teams where Geologists > Biologists ($G > B$). Let's run down the roster and vibe check every single team:
* Team A: $G=6$, $B=2$. ($6 > 2$) $\rightarrow$ Valid (W)
* Team B: $G=2$, $B=7$. ($2 < 7$) $\rightarrow$ Invalid (L)
* Team C: $G=4$, $B=6$. ($4 < 6$) $\rightarrow$ Invalid (L)
* Team D: $G=5$, $B=6$. ($5 < 6$) $\rightarrow$ Invalid (L)
* Team E: $G=8$, $B=4$. ($8 > 4$) $\rightarrow$ Valid (W)

Only Team A and Team E meet the specific criteria.

Step 3: The Audit (Double Check Protocol)
Let's do a quick sanity check to ensure our base matrix didn't glitch.
Are there exactly 25 of each role?
Explorers: $7+6+5+4+3 = 25$ (Check).
Biologists: $2+7+6+6+4 = 25$ (Check).
Geologists: $6+2+4+5+8 = 25$ (Check).
Do all teams have 15 members? Yes.
Does every team have $\ge 2$ in each role? Yes.
Do C and D have 6 Biologists? Yes.
Does A have 6 Geologists? Yes.
Does every team except A have $B > E$?
Team B ($7 > 6$), Team C ($6 > 5$), Team D ($6 > 4$), Team E ($4 > 3$). Yes.
Does $E$ strictly decrease from A to E? $7 > 6 > 5 > 4 > 3$. Yes.
The matrix is perfectly locked in. The final count of teams with $G > B$ is strictly 2.

Final Answer: 2

The Setup:
This question is trying to gatekeep arithmetic progressions behind a wall of logarithms. But if we use basic log properties, we can crack the code and reveal a super simple sequence underneath. I've audited the math to ensure it is fully locked in.

Step 1: The Arithmetic Progression Meta
If three terms $A$, $B$, and $C$ are in an AP, then the middle term is the average of the other two, meaning $2B = A + C$. Let's plug our log terms into this core rule.
$$2\log_3(2x^2+1) = \log_3(x^2-1) + \log_3(6x^2+3)$$

Step 2: Deploying Log Rules
Use the power rule on the left side ($k\log(x) = \log(x^k)$) and the product rule on the right side ($\log(x) + \log(y) = \log(xy)$).
$$\log_3((2x^2+1)^2) = \log_3((x^2-1)(6x^2+3))$$
Since the bases are the exact same, we can just drop the logs entirely and work with the pure algebra.
$$(2x^2+1)^2 = (x^2-1)(6x^2+3)$$

Step 3: Nerfing the Polynomial
Before we expand this and accidentally create a massive, toxic degree-4 polynomial, notice that we can factor a 3 out of the right side to find a matching term.
$$(2x^2+1)^2 = 3(x^2-1)(2x^2+1)$$
Since $\log_3(x^2-1)$ exists in the prompt, $x^2-1 > 0$, which means $x^2 > 1$. Therefore, $(2x^2+1)$ is definitely a positive non-zero number. We can safely divide both sides by $(2x^2+1)$ without losing any valid roots.
$$2x^2+1 = 3(x^2-1)$$
$$2x^2+1 = 3x^2-3$$
$$x^2 = 4$$

Step 4: Revealing the Sequence
Now plug $x^2 = 4$ back into the original three log terms to see what this AP actually looks like in practice.
* Term 1: $\log_3(4-1) = \log_3(3) = 1$
* Term 2: $\log_3(2(4)+1) = \log_3(9) = 2$
* Term 3: $\log_3(6(4)+3) = \log_3(27) = 3$
The progression is literally just 1, 2, 3... Absolute baby numbers.

Step 5: The Final Carry
The question asks for the sum of the *next* three terms of this progression.
The sequence continues: 4, 5, 6.
$$4 + 5 + 6 = 15$$

Step 6: The Audit (Double Check Protocol)
Let's run it back to verify.
If $x^2 = 4$, our sequence is $\log_3(3)$, $\log_3(9)$, $\log_3(27)$.
These evaluate to $1, 2, 3$. This is a valid AP with a common difference of $1$.
The next three terms are $4, 5, 6$.
Sum = $15$.
The math is completely flawless. Zero errors.

Final Answer: 15

The Setup: We are dropping into a coordinate geometry map for this one. We have a square bounding box and a circle spawning inside it, touching the walls. By setting a strategic origin point, we can turn this messy geometry problem into a pure algebra speedrun. I have fully audited the coordinates to ensure the hitbox interactions are completely accurate.

Step 1: Setting the Origin (The Spawn Point)
Let's anchor the square's corner $B$ exactly at the origin $(0,0)$.
Since the square's side length is $AB = 18$ cm, we can lock in the corner coordinates:
* $B = (0,0)$
* $C = (18,0)$
* $A = (0,18)$
* $D = (18,18)$

Step 2: Defining the Circle's Hitbox
The circle has a radius $r = 13$ cm. It touches side $AB$ (which sits on the y-axis) and side $BC$ (which sits on the x-axis).
Because it is perfectly tangent to both axes in the positive quadrant, its center $O$ must be at $(r, r)$, which is $(13, 13)$.
The equation of the circle is locked in:
$$(x-13)^2 + (y-13)^2 = 13^2$$
$$(x-13)^2 + (y-13)^2 = 169$$

Step 3: Locating the Intersections
The circle touches $AB$ at $M$, so $M$ is simply the y-intercept at $(0, 13)$.
The circle intersects $CD$ at point $P$. Side $CD$ is the vertical line $x = 18$.
Substitute $x = 18$ into the circle's equation to find $P$'s exact y-coordinate:
$$(18-13)^2 + (y-13)^2 = 169$$
$$5^2 + (y-13)^2 = 169$$
$$25 + (y-13)^2 = 169$$
$$(y-13)^2 = 144$$
$$y-13 = \pm 12$$
Since $P$ must lie on the physical segment $CD$, its y-coordinate must be between 0 and 18. So we take the subtraction route: $y = 13 - 12 = 1$.
Our point $P$ is officially at $(18, 1)$.

Step 4: Calculating the Triangle Area
We need the area of $\triangle PMD$. Let's pull the coordinates of our vertices:
* $M = (0, 13)$
* $P = (18, 1)$
* $D = (18, 18)$

Notice that $P$ and $D$ both lie on the exact same vertical line ($x = 18$). We can treat the segment $PD$ as the base of our triangle to completely cheese the calculation.
Base length $PD = 18 - 1 = 17$ units.
The height of the triangle is the perpendicular horizontal distance from the base line ($x=18$) back to the third point $M$ (at $x=0$).
Height $= 18 - 0 = 18$ units.
$$\text{Area} = \frac{1}{2} \times \text{base} \times \text{height}$$
$$\text{Area} = \frac{1}{2} \times 17 \times 18$$
$$\text{Area} = 17 \times 9 = 153$$

Step 5: The Audit (Double Check Protocol)
Running the shoelace formula (determinant method) to double-check the area calculation and guarantee zero errors.
$$\text{Area} = 0.5 \times |x_1(y_2-y_3) + x_2(y_3-y_1) + x_3(y_1-y_2)|$$
$$\text{Area} = 0.5 \times |0(1-18) + 18(18-13) + 18(13-1)|$$
$$\text{Area} = 0.5 \times |0 + 18(5) + 18(12)|$$
$$\text{Area} = 0.5 \times |90 + 216|$$
$$\text{Area} = 0.5 \times 306 = 153$$
Both methods yield exactly 153. The geometry holds up perfectly. The math is flawless.

Final Answer: 153

The Setup: We are running it back with the Monica age progression problem. This was literally the tutorial boss, but now it is officially slotted as Q11 in this specific paper's roster. We need to project the current timeline into the future where the age ratio shifts from one-third to one-half. I have double-checked the logic to guarantee zero errors.

Step 1: Establish the Current Era
Monica is currently 18 years old. Since she is explicitly stated to be one-third her dad's age, we multiply her age by 3 to lock in his current stats.
$$18 \times 3 = 54$$
Her dad is currently 54 years old.

Step 2: Set Up the Future Timeline
Let $x$ be the number of years it takes for this timeline shift to happen. Fast forward $x$ years: Monica will be $18+x$ years old, and her dad will level up to $54+x$ years old. The problem states that at this point, her age will be exactly half of his.
$$18+x = \frac{1}{2}(54+x)$$

Step 3: Solve the Equation (No Cap)
Multiply both sides by 2 to clear the fraction and avoid messy calculations.
$$2(18+x) = 54+x$$
$$36+2x = 54+x$$
Now, isolate $x$ by subtracting $x$ from both sides, and moving the 36 over.
$$x = 18$$
It will take exactly 18 years for this ratio to hit.

Step 4: Calculate the Final Age
Don't get baited by the $x$ value. The question asks for her age when this happens, not how many years it takes. Add the 18 years to her current age of 18.
$$18+18 = 36$$

Step 5: The Audit (Double Check Protocol)
Let's run the numbers back.
Current ages: Monica is 18, Dad is 54. ($18 \times 3 = 54$. Checked).
In 18 years: Monica will be 36, Dad will be 72.
Is 36 exactly half of 72? Yes.
The math is completely flawless.

Final Answer: 36