Difference between revisions of "2022 AIME I Problems/Problem 14"
(→Solution (Geometry + Number Theory)) |
Mathtiger6 (talk | contribs) m (→The NT Part) |
||
(26 intermediate revisions by 7 users not shown) | |||
Line 1: | Line 1: | ||
==Problem== | ==Problem== | ||
− | Given <math>\triangle ABC</math> and a point <math>P</math> on one of its sides, call line <math>\ell</math> the splitting line of <math>\triangle ABC</math> through <math>P</math> if <math>\ell</math> passes through <math>P</math> and divides <math>\triangle ABC</math> into two polygons of equal perimeter. Let <math>\triangle ABC</math> be a triangle where <math>BC = 219</math> and <math>AB</math> and <math>AC</math> are positive integers. Let <math>M</math> and <math>N</math> be the midpoints of <math>\overline{AB}</math> and <math>\overline{AC}</math> | + | Given <math>\triangle ABC</math> and a point <math>P</math> on one of its sides, call line <math>\ell</math> the <math>\textit{splitting line}</math> of <math>\triangle ABC</math> through <math>P</math> if <math>\ell</math> passes through <math>P</math> and divides <math>\triangle ABC</math> into two polygons of equal perimeter. Let <math>\triangle ABC</math> be a triangle where <math>BC = 219</math> and <math>AB</math> and <math>AC</math> are positive integers. Let <math>M</math> and <math>N</math> be the midpoints of <math>\overline{AB}</math> and <math>\overline{AC},</math> respectively, and suppose that the splitting lines of <math>\triangle ABC</math> through <math>M</math> and <math>N</math> intersect at <math>30^\circ.</math> Find the perimeter of <math>\triangle ABC.</math> |
==The Geometry Part - Solution 1== | ==The Geometry Part - Solution 1== | ||
Line 20: | Line 20: | ||
We now need to solve <math>a^2+ab+b^2 = 3^2\cdot 73^2</math>. A quick <math>(\bmod 9)</math> check gives that <math>3\mid a</math> and <math>3\mid b</math>. Thus, it's equivalent to solve <math>x^2+xy+y^2 = 73^2</math>. | We now need to solve <math>a^2+ab+b^2 = 3^2\cdot 73^2</math>. A quick <math>(\bmod 9)</math> check gives that <math>3\mid a</math> and <math>3\mid b</math>. Thus, it's equivalent to solve <math>x^2+xy+y^2 = 73^2</math>. | ||
− | Let <math>\omega</math> be one root of <math>\omega^2+\omega+1=0</math>. Then, recall that <math>\mathbb Z[\omega]</math> is the ring of integers of <math>\mathbb Q[\sqrt{-3}]</math> and is a unique factorization domain. Notice that <math>N(x-y\omega) = (x-y\omega)(x-y\omega^2) = x^2 | + | Let <math>\omega</math> be one root of <math>\omega^2+\omega+1=0</math>. Then, recall that <math>\mathbb Z[\omega]</math> is the ring of integers of <math>\mathbb Q[\sqrt{-3}]</math> and is a unique factorization domain. Notice that <math>N(x-y\omega) = (x-y\omega)(x-y\omega^2) = x^2+xy+y^2</math>. Therefore, it suffices to find an element of <math>\mathbb Z[\omega]</math> with the norm <math>73^2</math>. |
To do so, we factor <math>73</math> in <math>\mathbb Z[\omega]</math>. Since it's <math>1\pmod 3</math>, it must split. A quick inspection gives <math>73 = (8-\omega)(8-\omega^2)</math>. Thus, <math>N(8-\omega) = 73</math>, so | To do so, we factor <math>73</math> in <math>\mathbb Z[\omega]</math>. Since it's <math>1\pmod 3</math>, it must split. A quick inspection gives <math>73 = (8-\omega)(8-\omega^2)</math>. Thus, <math>N(8-\omega) = 73</math>, so | ||
Line 244: | Line 244: | ||
− | ==Solution (Number Theory)== | + | ==Solution (Number Theory Part)== |
We wish to solve the Diophantine equation <math>a^2+ab+b^2=3^2 \cdot 73^2</math>. It can be shown that <math>3|a</math> and <math>3|b</math>, so we make the substitution <math>a=3x</math> and <math>b=3y</math> to obtain <math>x^2+xy+y^2=73^2</math> as our new equation to solve for. | We wish to solve the Diophantine equation <math>a^2+ab+b^2=3^2 \cdot 73^2</math>. It can be shown that <math>3|a</math> and <math>3|b</math>, so we make the substitution <math>a=3x</math> and <math>b=3y</math> to obtain <math>x^2+xy+y^2=73^2</math> as our new equation to solve for. | ||
− | Notice that <math>r^2+r+1=(r-\omega)(r-{\omega}^2)</math>, where <math>\omega=e^{i\frac{ | + | Notice that <math>r^2+r+1=(r-\omega)(r-{\omega}^2)</math>, where <math>\omega=e^{i\frac{2\pi}{3}}</math>. Thus, |
<cmath>x^2+xy+y^2 = y^2((x/y)^2+(x/y)+1) = y^2 (\frac{x}{y}-\omega)(\frac{x}{y}-{\omega}^2) = (x-y\omega)(x-y{\omega}^2).</cmath> | <cmath>x^2+xy+y^2 = y^2((x/y)^2+(x/y)+1) = y^2 (\frac{x}{y}-\omega)(\frac{x}{y}-{\omega}^2) = (x-y\omega)(x-y{\omega}^2).</cmath> | ||
Line 253: | Line 253: | ||
<cmath>\begin{align} | <cmath>\begin{align} | ||
(8-\omega)^2(8-{\omega}^2)^2&=73^2\\ | (8-\omega)^2(8-{\omega}^2)^2&=73^2\\ | ||
− | (63-17\omega)(63-17{\omega}^2) | + | (63-17\omega)(63-17{\omega}^2)&=73^2. |
\end{align}</cmath> | \end{align}</cmath> | ||
− | Thus, by <math>(2)</math>, <math>(63, 17)</math> is a solution to <math>x^2+xy+y^2=73^2</math>. This implies that <math>a=189</math> and <math>b=51</math>, so our final answer is <math>189+51+ | + | Thus, by <math>(2)</math>, <math>(63, 17)</math> is a solution to <math>x^2+xy+y^2=73^2</math>. This implies that <math>a=189</math> and <math>b=51</math>, so our final answer is <math>189+51+219=\boxed{459}</math>. |
+ | |||
+ | ~ Leo.Euler | ||
+ | |||
+ | ==Solution(Visual geometry)== | ||
+ | [[File:AIME-I-2022-14a.png|400px|right]] | ||
+ | [[File:AIME-I-2022-14b.png|400px|right]] | ||
+ | [[File:AIME-I-2022-14c.png|400px|right]] | ||
+ | We look at upper and middle diagrams and get <math>\angle BAC = 120^\circ</math>. | ||
+ | |||
+ | Next we use only the lower Diagram. Let <math>I</math> be incenter <math>\triangle ABC</math>, E be midpoint of biggest arc <math>\overset{\Large\frown} {BC}.</math> | ||
+ | Then bisector <math>AI</math> cross circumcircle <math>\triangle ABC</math> at point <math>E</math>. Quadrilateral <math>ABEC</math> is cyclic, so | ||
+ | <cmath> \angle BEC = 180^\circ - \angle ABC = 60^\circ \implies BE = CE = IE = BC.</cmath> | ||
+ | <cmath>AE \cdot BC = AB \cdot CE + AC \cdot BE \implies AE = AB + AC</cmath> | ||
+ | <math>\implies AI +EI = AB + AC, \hspace{10mm} AI = AB+ AC – BC</math> is integer. | ||
+ | <cmath>AI = \frac {2AB \cdot AC \cdot cos \angle CAI}{AB+AC + BC} = \frac {AB \cdot AC}{AB+AC + BC} =</cmath> | ||
+ | <cmath>= AB + AC – BC \implies AC^2 + AB^2 + AB \cdot AC = BC^2.</cmath> | ||
+ | A quick <math>(\mod9)</math> check gives that <math>3\mid AC</math> and <math>3\mid AB</math>. | ||
+ | <cmath>AI \le A_0I_0 = EA_0 – EI_0 = \frac{2 BC}{\sqrt{3}} – BC = \frac {2 - \sqrt{3}}{\sqrt{3}} BC = 33.88.</cmath> | ||
+ | Denote <math>a= \frac {BC}{3}= 73, b = \frac {AC}{3}, c = \frac {AB}{3}, l = \frac {AI}{3} \le 11.</math> | ||
+ | |||
+ | We have equations in integers | ||
+ | <math>\frac{bc}{a+b+c} = b + c – a = l \le 11.</math> | ||
+ | |||
+ | The solution <math>(b > c)</math> is | ||
+ | <cmath>b = \frac{a + l +\sqrt{a^2 – 6al – 3l^2}}{2}, | ||
+ | c = \frac{a + l -\sqrt{a^2 – 6al – 3l^2}}{2}.</cmath> | ||
+ | Suppose, <math>a^2 – 6al – 3l^2 = (a – 3l – t)^2 \implies \frac {12l^2}{t} + t + 6l= 2a = 146.</math> | ||
+ | |||
+ | Now we check all possible <math>t = {2,3,4,6,12, ml}.</math> | ||
+ | |||
+ | Case <math>t = 2 \implies 6l^2 + 6l = 146 – 2 \implies l^2 + l = 24 \implies \O </math> | ||
+ | |||
+ | Case <math>t = 3 \implies 4l^2 + 6l = 146 – 3 = 143\implies \O.</math> | ||
+ | |||
+ | Case <math>t = 4 \implies 3l^2 + 6l = 146 – 4 =142 \implies \O.</math> | ||
+ | |||
+ | Case <math>t = 6 \implies 2l^2 + 6l = 146 – 6 = 140 \implies l = 7, b = 63, c = 17.</math> | ||
+ | |||
+ | Case <math>t = 12 \implies l^2 + 6l = 146 – 12 = 134 \implies \O.</math> | ||
+ | |||
+ | Case <math>t = ml \implies \frac{12l}{m} + 6l + ml = 146 \implies \frac{12}{m} + 6 + m = \frac{73 \cdot 2}{l}\implies \O.</math> | ||
+ | |||
+ | '''vladimir.shelomovskii@gmail.com, vvsss''' | ||
+ | |||
+ | ==Video Solution== | ||
+ | https://youtu.be/T6zq1e1RZdg | ||
+ | |||
+ | ~MathProblemSolvingSkills.com | ||
+ | |||
==Video Solution== | ==Video Solution== | ||
Line 262: | Line 311: | ||
~Steven Chen (wwww.professorchenedu.com) | ~Steven Chen (wwww.professorchenedu.com) | ||
+ | |||
+ | ==Animated Video Solution== | ||
+ | https://youtu.be/o-aDdxdnTWY | ||
+ | |||
+ | ~Star League (https://starleague.us) | ||
==See Also== | ==See Also== |
Latest revision as of 01:56, 4 January 2023
Contents
Problem
Given and a point on one of its sides, call line the of through if passes through and divides into two polygons of equal perimeter. Let be a triangle where and and are positive integers. Let and be the midpoints of and respectively, and suppose that the splitting lines of through and intersect at Find the perimeter of
The Geometry Part - Solution 1
Consider the splitting line through . Extend on ray such that . Then the splitting line bisects segment , so in particular it is the midline of triangle and thus it is parallel to . But since triangle is isosceles, we can easily see is parallel to the angle bisector of , so the splitting line is also parallel to this bisector, and similar for the splitting line through . Some simple angle chasing reveals the condition is now equivalent to .
- MortemEtInteritum
The Geometry Part - Solution 2
Let and be the splitting lines. Reflect across to be and across to be . Take and , which are spiral similarity centers on the other side of as such that and . This gets that because and , then and are on 's circumcircle. Now, we know that and so because and , then and and and .
We also notice that because and correspond on and , and because and correspond on and , then the angle formed by and is equal to the angle formed by and which is equal to . Thus, . Similarly, and so and .
- kevinmathz
The NT Part
We now need to solve . A quick check gives that and . Thus, it's equivalent to solve .
Let be one root of . Then, recall that is the ring of integers of and is a unique factorization domain. Notice that . Therefore, it suffices to find an element of with the norm .
To do so, we factor in . Since it's , it must split. A quick inspection gives . Thus, , so giving the solution and , yielding and , so the sum is . Since and are primes in , the solution must divide . One can then easily check that this is the unique solution.
- MarkBcc168
Solution (Geometry + Number Theory)
Denote , , .
Let the splitting line of through (resp. ) crosses at another point (resp. ).
WLOG, we assume .
: .
We extend segment to , such that . We extend segment to , such that .
In this case, is the midpoint of , and is the midpoint of .
Because and are the midpoints of and , respectively, . Because and are the midpoints of and , respectively, .
Because , . Because , .
Let and intersect at . Because and , the angle formed between lines and is congruent to . Hence, or .
We have
Hence, we must have , not . Hence, .
This implies and . This contradicts the condition specified for this case.
Therefore, this case is infeasible.
: .
We extend segment to , such that . We extend segment to , such that .
In this case, is the midpoint of , and is the midpoint of .
Because and are the midpoints of and , respectively, . Because and are the midpoints of and , respectively, .
Because , . Because , .
Let be a point of , such that . Hence, .
Because and and , the angle formed between lines and is congruent to . Hence, or .
We have
Hence, we must have , not . Hence, .
This implies and . This contradicts the condition specified for this case.
Therefore, this case is infeasible.
: .
We extend segment to , such that . We extend segment to , such that .
In this case, is the midpoint of , and is the midpoint of .
Because and are the midpoints of and , respectively, . Because and are the midpoints of and , respectively, .
Because , . Because , .
Because and , the angle formed between lines and is congruent to . Hence, or .
We have
Hence, we must have , not . Hence, .
In , by applying the law of cosines, we have
Because , we have
Now, we find integer solution(s) of this equation with .
Multiplying this equation by 4, we get
Denote . Because , .
Because , . Thus, . This implies .
We also have . Hence, . This implies .
Denote and . Hence, . Hence, Equation (1) can be written as
Now, we solve this equation.
First, we find an upper bound of .
We have . Hence, . Hence, . Because is an integer, we must have .
Second, we find a lower bound of .
We have . Hence, . Hence, . Because is an integer, we must have .
Now, we find the integer solutions of and that satisfy Equation (2) with .
First, modulo 9,
Hence .
Second, modulo 5,
Because , we must have . Hence, .
Third, modulo 7,
Because , we must have . Hence, .
Given all conditions above, the possible are 74, 83, 88, 92, 97, 101, 106, 109, 116, 118, 127.
By testing all these numbers, we find that the only solution is . This implies .
Hence, and . Hence, .
Therefore, the perimeter of is .
~Steven Chen (www.professorchenedu.com)
Solution (Number Theory Part)
We wish to solve the Diophantine equation . It can be shown that and , so we make the substitution and to obtain as our new equation to solve for.
Notice that , where . Thus,
Note that . Thus, . Squaring both sides yields Thus, by , is a solution to . This implies that and , so our final answer is .
~ Leo.Euler
Solution(Visual geometry)
We look at upper and middle diagrams and get .
Next we use only the lower Diagram. Let be incenter , E be midpoint of biggest arc Then bisector cross circumcircle at point . Quadrilateral is cyclic, so is integer. A quick check gives that and . Denote
We have equations in integers
The solution is Suppose,
Now we check all possible
Case
Case
Case
Case
Case
Case
vladimir.shelomovskii@gmail.com, vvsss
Video Solution
~MathProblemSolvingSkills.com
Video Solution
https://www.youtube.com/watch?v=kkous52vPps&t=3023s
~Steven Chen (wwww.professorchenedu.com)
Animated Video Solution
~Star League (https://starleague.us)
See Also
2022 AIME I (Problems • Answer Key • Resources) | ||
Preceded by Problem 13 |
Followed by Problem 15 | |
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.