Difference between revisions of "2025 AIME I Problems/Problem 12"
Mathkiddus (talk | contribs) |
|||
Line 1: | Line 1: | ||
==Problem== | ==Problem== | ||
The set of points in <math>3</math>-dimensional coordinate space that lie in the plane <math>x+y+z=75</math> whose coordinates satisfy the inequalities <cmath>x-yz<y-zx<z-xy</cmath>forms three disjoint convex regions. Exactly one of those regions has finite area. The area of this finite region can be expressed in the form <math>a\sqrt{b},</math> where <math>a</math> and <math>b</math> are positive integers and <math>b</math> is not divisible by the square of any prime. Find <math>a+b.</math> | The set of points in <math>3</math>-dimensional coordinate space that lie in the plane <math>x+y+z=75</math> whose coordinates satisfy the inequalities <cmath>x-yz<y-zx<z-xy</cmath>forms three disjoint convex regions. Exactly one of those regions has finite area. The area of this finite region can be expressed in the form <math>a\sqrt{b},</math> where <math>a</math> and <math>b</math> are positive integers and <math>b</math> is not divisible by the square of any prime. Find <math>a+b.</math> | ||
+ | ==Solution 1== | ||
+ | Rewriting we have <math>z=75-x-y.</math> | ||
− | ==Solution== | + | From the inequality <math>x-yz<y-zx</math> we can rewrite to get, |
+ | <cmath>x-y(75-x-y)< y-x(75-x-y).</cmath> <cmath>76x-76y+y^2-x^2<0.</cmath> <cmath>(x+y+76)(x-y)<0.</cmath> | ||
+ | |||
+ | Similarly from the inequality <math>y-zx<z-xy</math> we rewrite to get, | ||
+ | <cmath>y-x(75-x-y)<(75-x-y)-xy.</cmath> | ||
+ | <cmath>2y + 2xy + x^2 - 74x - 75 < 0.</cmath> | ||
+ | <cmath>(x + 1)(2y + x - 75) < 0.</cmath> | ||
+ | Our next step is a visual which can be seen by roughly graphing the two inequalities. The first inequality is similar to a bow tie(you have to graph to see it lol) with bounds of <math>x-y=0</math> and <math>76+x+y=0.</math> The second one is a bow tie with edges of <math>x+1=0</math> and <math>2y+x-75=0.</math>Here is the region of our solutions. | ||
+ | <asy> | ||
+ | import graph; | ||
+ | size(400, 400); | ||
+ | real xmin = -250, xmax = 250; | ||
+ | real ymin = -150, ymax = 150; | ||
+ | draw((xmin,0)--(xmax,0), black+0.8bp, Arrow); | ||
+ | draw((0,ymin)--(0,ymax), black+0.8bp, Arrow); | ||
+ | pair A = (-38, -38), | ||
+ | B = (-10, -10), | ||
+ | C = (-227, 151), | ||
+ | D = (-10, 85/2), | ||
+ | E = (25, 25); | ||
+ | path L1 = (xmin, xmin)--(xmax, xmax); | ||
+ | path L2 = (xmin, -76-xmin)--(xmax, -76-xmax); | ||
+ | path L3 = ((-10, ymin)--(-10, ymax)); | ||
+ | path L4 = (xmin, (75-xmin)/2)--(xmax, (75-xmax)/2); | ||
+ | fill(B--D--E--cycle, lightgreen); | ||
+ | draw(L1, blue); | ||
+ | draw(L2, blue); | ||
+ | draw(L3, red); | ||
+ | draw(L4, red); | ||
+ | dot(A, black); label("$(-38,-38)$", A, SW); | ||
+ | dot(B, black); label("$(-1,-1)$", B, SE); | ||
+ | dot(C, black); label("$(-227,151)$", C, NW); | ||
+ | dot(D, black); label("$(-1,38)$", D, NE); | ||
+ | dot(E, black); label("$(25,25)$", E, SE); | ||
+ | </asy> | ||
+ | It is simple to find the intersections of those which are <math>(-1,38),(25,25)</math> and <math>(-1,-1).</math> The sidelengths of this triangle are <math>39\sqrt{2},26\sqrt{6},13\sqrt{6}</math> which is a <math>30-60-90</math> gives us an area of <cmath>\frac{1}{2}(39\sqrt{2})(13\sqrt{6})=507\sqrt{3}\implies\boxed{510}.</cmath> | ||
+ | ~mathkiddus ~plang2008 | ||
+ | ==Solution 2== | ||
Consider <math>x-yz<y-zx<z-xy</math>. From <math>x-yz<y-zx</math>, we find <math>z(y-x)>x-y</math>. Thus, if <math>x>y</math>, then <math>z<-1</math>, and if <math>x<y</math>, then <math>z>-1</math>. Similarly, taking another pair of the inequalities yields <math>y>-1</math> when <math>z>x</math> and <math>y<-1</math> when <math>x>z</math>. Finally, taking the third pair yields <math>x>-1</math> if <math>z>y</math> and <math>x<-1</math> if <math>z<y</math>. | Consider <math>x-yz<y-zx<z-xy</math>. From <math>x-yz<y-zx</math>, we find <math>z(y-x)>x-y</math>. Thus, if <math>x>y</math>, then <math>z<-1</math>, and if <math>x<y</math>, then <math>z>-1</math>. Similarly, taking another pair of the inequalities yields <math>y>-1</math> when <math>z>x</math> and <math>y<-1</math> when <math>x>z</math>. Finally, taking the third pair yields <math>x>-1</math> if <math>z>y</math> and <math>x<-1</math> if <math>z<y</math>. | ||
Revision as of 21:48, 13 February 2025
Problem
The set of points in -dimensional coordinate space that lie in the plane
whose coordinates satisfy the inequalities
forms three disjoint convex regions. Exactly one of those regions has finite area. The area of this finite region can be expressed in the form
where
and
are positive integers and
is not divisible by the square of any prime. Find
Solution 1
Rewriting we have
From the inequality we can rewrite to get,
Similarly from the inequality we rewrite to get,
Our next step is a visual which can be seen by roughly graphing the two inequalities. The first inequality is similar to a bow tie(you have to graph to see it lol) with bounds of
and
The second one is a bow tie with edges of
and
Here is the region of our solutions.
It is simple to find the intersections of those which are
and
The sidelengths of this triangle are
which is a
gives us an area of
~mathkiddus ~plang2008
Solution 2
Consider . From
, we find
. Thus, if
, then
, and if
, then
. Similarly, taking another pair of the inequalities yields
when
and
when
. Finally, taking the third pair yields
if
and
if
.
Consider the first two resultant pairs of inequalities. Taking them pairwise (one from the first set and one from the second set) results in four cases:
1. Combining if
and
if
yields
, a contradiction.
2. Combining if
and
if
yields
.
3. Combining if
and
if
yields
.
4. Combining if
and
if
yields
, a contradiction.
Now we have only two satisfactory inequalities. We now consider the third pair of inequalities ( if
and
if
). Taking the two sets pairwise:
1. Combining and
if
yields
. Consider some valid
that satisfy
and
. We can infinitely increase
while decreasing
by the same amount, leading to another valid triple, so this case is infinite and we do not consider this case (for instance, if
, then
is a valid triple for all nonnegative
).
2. Combining and
if
yields
. This case is finite due to the lower bound.
3. Combining and
if
yields
. There are no possible solutions since
are negative from this inequality, but at least one must be positive to satisfy
, a contradiction.
4. Combining and
if
yields
. By the same argument as in Case 1, this is an infinite case.
Thus we are tasked with finding the area of the figure formed by all triples satisfying
and
. We consider edge cases, so we maximize each variable by the largest amount possible to find three triples
. We assume that these are the only edge cases (so the figure forms a triangle), and we can use the Distance formula. We find that the three side lengths of our triangle are
. These side lengths just so happen to form a
triangle with legs
and
, so the area of the triangle is
Thus the answer is . ~eevee9406
Solution 2
Decomposing the inequality chain:
which is equivalent to
Substituting
with
and simplifying yields
See that the solution to the first inequality is
Applying a similar method results in the solution to the second:
Trying each grouping (i.e. let
and
,
and
,
and
, or
and
be satisfied at the same time) and graphing shows that when
and
are both satisfied, a triangle whose vertices are
,
, and
is formed. Further calculations show that the area of the triangle is
. However, this is not the final answer. We have projected the original shape to the
-plane by substituting
. We know that for a surface defined by the equation
, the area element
for this surface is given by
where
and
are the partial derivatives of the function
with respect to
and
. For the plane
where
, computation gives
Substituting these into the original equation to get
This implies that to find the area of the original shape, we have to multiply the area of its projection on the
-plane by
. Therefore, the area of the original shape is
, with final answer
.
See also
2025 AIME I (Problems • Answer Key • Resources) | ||
Preceded by Problem 11 |
Followed by Problem 13 | |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 | ||
All AIME Problems and Solutions |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.