Difference between revisions of "2022 AIME I Problems/Problem 14"
Kevinmathz (talk | contribs) |
|||
Line 31: | Line 31: | ||
- MarkBcc168 | - MarkBcc168 | ||
+ | |||
+ | ==Solution (Geometry + Number Theory) | ||
+ | |||
+ | Denote <math>BC = a</math>, <math>CA = b</math>, <math>AB = c</math>. | ||
+ | |||
+ | Let the splitting line of <math>\triangle ABC</math> through <math>M</math> (resp. <math>N</math>) crosses <math>\triangle ABC</math> at another point <math>X</math> (resp. <math>Y</math>). | ||
+ | |||
+ | WLOG, we assume <math>c \leq b</math>. | ||
+ | |||
+ | <math>\textbf{Case 1}</math>: <math>a \leq c \leq b</math>. | ||
+ | |||
+ | We extend segment <math>AB</math> to <math>D</math>, such that <math>BD = a</math>. | ||
+ | We extend segment <math>AC</math> to <math>E</math>, such that <math>CE = a</math>. | ||
+ | |||
+ | In this case, <math>X</math> is the midpoint of <math>AE</math>, and <math>Y</math> is the midpoint of <math>AD</math>. | ||
+ | |||
+ | Because <math>M</math> and <math>X</math> are the midpoints of <math>AB</math> and <math>AE</math>, respectively, <math>MX \parallel BE</math>. | ||
+ | Because <math>N</math> and <math>Y</math> are the midpoints of <math>AC</math> and <math>AD</math>, respectively, <math>NY \parallel CD</math>. | ||
+ | |||
+ | Because <math>CB = CE</math>, <math>\angle CBE =\angle CEB = \frac{\angle ACB}{2}</math>. | ||
+ | Because <math>BC = BD</math>, <math>\angle BCD = \angle BDC = \frac{\angle ABC}{2}</math>. | ||
+ | |||
+ | Let <math>BE</math> and <math>CD</math> intersect at <math>O</math>. | ||
+ | Because <math>MX \parallel BE</math> and <math>NY \parallel CD</math>, the angle formed between lines <math>MX</math> and <math>NY</math> is congruent to <math>\angle BOD</math>. Hence, <math>\angle BOD = 30^\circ</math> or <math>150^\circ</math>. | ||
+ | |||
+ | We have | ||
+ | <cmath> | ||
+ | \begin{align*} | ||
+ | \angle BOD & = \angle CBE + \angle BCD \\ | ||
+ | & = \frac{\angle ACB}{2} + \frac{\angle ABC}{2} \\ | ||
+ | & = 90^\circ - \frac{\angle A}{2} . | ||
+ | \end{align*} | ||
+ | </cmath> | ||
+ | |||
+ | Hence, we must have <math>\angle BOD = 30^\circ</math>, not <math>150^\circ</math>. | ||
+ | Hence, <math>\angle A = 120^\circ</math>. | ||
+ | |||
+ | This implies <math>a > b</math> and <math>a >c</math>. This contradicts the condition specified for this case. | ||
+ | |||
+ | Therefore, this case is infeasible. | ||
+ | |||
+ | <math>\textbf{Case 2}</math>: <math>c \leq a \leq b</math>. | ||
+ | |||
+ | We extend segment <math>CB</math> to <math>D</math>, such that <math>BD = c</math>. | ||
+ | We extend segment <math>AC</math> to <math>E</math>, such that <math>CE = a</math>. | ||
+ | |||
+ | In this case, <math>X</math> is the midpoint of <math>AE</math>, and <math>Y</math> is the midpoint of <math>CD</math>. | ||
+ | |||
+ | Because <math>M</math> and <math>X</math> are the midpoints of <math>AB</math> and <math>AE</math>, respectively, <math>MX \parallel BE</math>. | ||
+ | Because <math>N</math> and <math>Y</math> are the midpoints of <math>AC</math> and <math>CD</math>, respectively, <math>NY \parallel AD</math>. | ||
+ | |||
+ | Because <math>CB = CE</math>, <math>\angle CBE =\angle CEB = \frac{\angle ACB}{2}</math>. | ||
+ | Because <math>BA = BD</math>, <math>\angle BAD = \angle BDA = \frac{\angle ABC}{2}</math>. | ||
+ | |||
+ | Let <math>O</math> be a point of <math>AC</math>, such that <math>BO \parallel AD</math>. | ||
+ | Hence, <math>\angle OBC = \angle BDA = \frac{B}{2}</math>. | ||
+ | |||
+ | Because <math>MX \parallel BE</math> and <math>NY \parallel AD</math> and <math>AD \parallel BO</math>, the angle formed between lines <math>MX</math> and <math>NY</math> is congruent to <math>\angle OBE</math>. Hence, <math>\angle OBE = 30^\circ</math> or <math>150^\circ</math>. | ||
+ | |||
+ | We have | ||
+ | <cmath> | ||
+ | \begin{align*} | ||
+ | \angle OBE & = \angle OBC + \angle CBE \\ | ||
+ | & = \frac{\angle ABC}{2} + \frac{\angle ACB}{2} \\ | ||
+ | & = 90^\circ - \frac{\angle A}{2} . | ||
+ | \end{align*} | ||
+ | </cmath> | ||
+ | |||
+ | Hence, we must have <math>\angle OBE = 30^\circ</math>, not <math>150^\circ</math>. | ||
+ | Hence, <math>\angle A = 120^\circ</math>. | ||
+ | |||
+ | This implies <math>a > b</math> and <math>a >c</math>. This contradicts the condition specified for this case. | ||
+ | |||
+ | Therefore, this case is infeasible. | ||
+ | |||
+ | <math>\textbf{Case 3}</math>: <math>c \leq b \leq a</math>. | ||
+ | |||
+ | We extend segment <math>CB</math> to <math>D</math>, such that <math>BD = c</math>. | ||
+ | We extend segment <math>BC</math> to <math>E</math>, such that <math>CE = b</math>. | ||
+ | |||
+ | In this case, <math>X</math> is the midpoint of <math>BE</math>, and <math>Y</math> is the midpoint of <math>CD</math>. | ||
+ | |||
+ | Because <math>M</math> and <math>X</math> are the midpoints of <math>AB</math> and <math>BE</math>, respectively, <math>MX \parallel AE</math>. | ||
+ | Because <math>N</math> and <math>Y</math> are the midpoints of <math>AC</math> and <math>CD</math>, respectively, <math>NY \parallel AD</math>. | ||
+ | |||
+ | Because <math>CA = CE</math>, <math>\angle CAE =\angle CEB = \frac{\angle ACB}{2}</math>. | ||
+ | Because <math>BA = BD</math>, <math>\angle BAD = \angle BDA = \frac{\angle ABC}{2}</math>. | ||
+ | |||
+ | Because <math>MX \parallel AE</math> and <math>NY \parallel AD</math>, the angle formed between lines <math>MX</math> and <math>NY</math> is congruent to <math>\angle DAE</math>. Hence, <math>\angle DAE = 30^\circ</math> or <math>150^\circ</math>. | ||
+ | |||
+ | We have | ||
+ | <cmath> | ||
+ | \begin{align*} | ||
+ | \angle DAE & = \angle BAD + \angle CAE + \angle BAC \\ | ||
+ | & = \frac{\angle ABC}{2} + \frac{\angle ACB}{2} + \angle BAC \\ | ||
+ | & = 90^\circ + \frac{\angle BAC}{2} . | ||
+ | \end{align*} | ||
+ | </cmath> | ||
+ | |||
+ | Hence, we must have <math>\angle OBE = 150^\circ</math>, not <math>30^\circ</math>. | ||
+ | Hence, <math>\angle BAC = 120^\circ</math>. | ||
+ | |||
+ | In <math>\triangle ABC</math>, by applying the law of cosines, we have | ||
+ | <cmath> | ||
+ | \begin{align*} | ||
+ | a^2 & = b^2 + c^2 - 2bc \cos \angle BAC\\ | ||
+ | & = b^2 + c^2 - 2bc \cos 120^\circ \\ | ||
+ | & = b^2 + c^2 + bc . | ||
+ | \end{align*} | ||
+ | </cmath> | ||
+ | |||
+ | Because <math>a = 219</math>, we have | ||
+ | <cmath> | ||
+ | \[ | ||
+ | b^2 + c^2 + bc = 219^2 . | ||
+ | \] | ||
+ | </cmath> | ||
+ | |||
+ | Now, we find integer solution(s) of this equation with <math>c \leq b</math>. | ||
+ | |||
+ | Multiplying this equation by 4, we get | ||
+ | <cmath> | ||
+ | \[ | ||
+ | \left( 2 c + b \right)^2 + 3 b^2 = 438^2 . \hspace{1cm} (1) | ||
+ | \] | ||
+ | </cmath> | ||
+ | |||
+ | Denote <math>d = 2 c + b</math>. Because <math>c \leq b</math>, <math>b < d \leq 3 b</math>. | ||
+ | |||
+ | Because <math>438^2 - 3 b^2 \equiv 0 \pmod{3}</math>, <math>d^2 \equiv 0 \pmod{3}</math>. | ||
+ | Thus, <math>d \equiv 0 \pmod{3}</math>. | ||
+ | This implies <math>d^2 \equiv 0 \pmod{9}</math>. | ||
+ | |||
+ | We also have <math>438^2 \equiv 0 \pmod{9}</math>. | ||
+ | Hence, <math>3 b^2 \equiv 0 \pmod{9}</math>. | ||
+ | This implies <math>b \equiv 0 \pmod{3}</math>. | ||
+ | |||
+ | Denote <math>b = 3 p</math> and <math>d = 3 q</math>. Hence, <math>p < q \leq 3 p</math>. | ||
+ | Hence, Equation (1) can be written as | ||
+ | <cmath> | ||
+ | \[ | ||
+ | q^2 + 3 p^2 = 146^2 . \hspace{1cm} (2) | ||
+ | \] | ||
+ | </cmath> | ||
+ | |||
+ | Now, we solve this equation. | ||
+ | |||
+ | First, we find an upper bound of <math>q</math>. | ||
+ | |||
+ | We have <math>q^2 + 3 p^2 \geq q^2 + 3 \left( \frac{q}{3} \right)^2 = \frac{4 q^2}{3}</math>. | ||
+ | Hence, <math>\frac{4 q^2}{3} \leq 146^2</math>. | ||
+ | Hence, <math>q \leq 73 \sqrt{3} < 73 \cdot 1.8 = 131.4</math>. | ||
+ | Because <math>q</math> is an integer, we must have <math>q \leq 131</math>. | ||
+ | |||
+ | Second, we find a lower bound of <math>q</math>. | ||
+ | |||
+ | We have <math>q^2 + 3 p^2 < q^2 + 3 q^2 = 4 q^2</math>. | ||
+ | Hence, <math>4 q^2 > 146^2</math>. | ||
+ | Hence, <math>q > 73</math>. | ||
+ | Because <math>q</math> is an integer, we must have <math>q \geq 74</math>. | ||
+ | |||
+ | Now, we find the integer solutions of <math>p</math> and <math>q</math> that satisfy Equation (2) with <math>74 \leq q \leq 131</math>. | ||
+ | |||
+ | First, modulo 9, | ||
+ | <cmath> | ||
+ | \begin{align*} | ||
+ | q^2 & \equiv 146^2 - 3 p^2 \\ | ||
+ | & \equiv 4 - 3 \cdot ( 0 \mbox{ or } 1 ) \\ | ||
+ | & \equiv 4 \mbox{ or } 1 . | ||
+ | \end{align*} | ||
+ | </cmath> | ||
+ | |||
+ | Hence <math>q \equiv \pm 1, \pm 2 \pmod{9}</math>. | ||
+ | |||
+ | Second, modulo 5, | ||
+ | <cmath> | ||
+ | \begin{align*} | ||
+ | q^2 & \equiv 146^2 - 3 p^2 \\ | ||
+ | & \equiv 1 + 2 p^2 \\ | ||
+ | & \equiv 1 + 2 \cdot ( 0 \mbox{ or } 1 \mbox{ or } -1 ) \\ | ||
+ | & \equiv 1 \mbox{ or } 3 \mbox{ or } - 1 . | ||
+ | \end{align*} | ||
+ | </cmath> | ||
+ | |||
+ | Because <math>q^2 \equiv 0 \mbox{ or } 1 \mbox{ or } - 1</math>, we must have <math>q^2 \equiv 1 \mbox{ or } - 1</math>. | ||
+ | Hence, <math>5 \nmid q</math>. | ||
+ | |||
+ | Third, modulo 7, | ||
+ | <cmath> | ||
+ | \begin{align*} | ||
+ | q^2 & \equiv 146^2 - 3 p^2 \\ | ||
+ | & \equiv 1 - 3 \cdot ( 0 \mbox{ or } 1 \mbox{ or } 5 \mbox{ or } 2 ) \\ | ||
+ | & \equiv 1 \mbox{ or } 2 \mbox{ or } 3 \mbox{ or } 5 . | ||
+ | \end{align*} | ||
+ | </cmath> | ||
+ | |||
+ | Because <math>q^2 \equiv 0 \mbox{ or } 1 \mbox{ or } 2 \mbox{ or } 4 \pmod{ 7 }</math>, we must have <math>q^2 \equiv 1 \mbox{ or } 2 \pmod{7}</math>. | ||
+ | Hence, <math>q \equiv 1, 3, 4, 6 \pmod{7}</math>. | ||
+ | |||
+ | Given all conditions above, the possible <math>q</math> are 74, 83, 88, 92, 97, 101, 106, 109, 116, 118, 127. | ||
+ | |||
+ | By testing all these numbers, we find that the only solution is <math>q = 97</math>. | ||
+ | This implies <math>p = 63</math>. | ||
+ | |||
+ | Hence, <math>b = 3p = 189</math> and <math>d = 3q = 291</math>. | ||
+ | Hence, <math>c = \frac{d - b}{2} = 51</math>. | ||
+ | |||
+ | Therefore, the perimeter of <math>\triangle ABC</math> is <math>b + c + a = 189 + 51 + 219 = \boxed{\textbf{(459) }}</math>. | ||
+ | |||
+ | ~Steven Chen (wwww.professorchenedu.com) | ||
+ | |||
+ | ==Video Solution== | ||
+ | |||
+ | https://www.youtube.com/watch?v=kkous52vPps&t=3023s | ||
+ | |||
+ | ~Steven Chen (wwww.professorchenedu.com) |
Revision as of 23:06, 17 February 2022
Contents
Problem
Given and a point
on one of its sides, call line
the splitting line 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
\begin{align*}
73^2 &= N((8-\omega)^2) \\
&= N(64 - 16\omega + \omega^2) \\
&= N(64 - 16\omega + (-1-\omega)) \\
&= N(63 - 17\omega),
\end{align*}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 (wwww.professorchenedu.com)
Video Solution
https://www.youtube.com/watch?v=kkous52vPps&t=3023s
~Steven Chen (wwww.professorchenedu.com)