Difference between revisions of "2024 AMC 10B Problems/Problem 13"
(→Problem) |
(→Solution 1) |
||
Line 5: | Line 5: | ||
==Solution 1== | ==Solution 1== | ||
− | + | Note that <math>\sqrt{1183}=13\sqrt7</math>. Since <math>x</math> and <math>y</math> are positive integers, and <math>\sqrt{x}+\sqrt{y}=\sqrt{1183}</math>, we can represent each value of <math>\sqrt{x}</math> and <math>\sqrt{y}</math> as the product of a positive integer and <math>\sqrt7</math>. Let's say that <math>\sqrt{x}=m\sqrt7</math> and <math>\sqrt{y}=n\sqrt7</math>, where <math>m</math> and <math>n</math> are positive integers. This implies that <math>x+y=(\sqrt{x})^2+(\sqrt{y})^2=7m^2+7n^2=7(m^2+n^2)</math> and that <math>m+n=13</math>. WLOG, assume that <math>{m}\geq{n}</math>. It is not hard to see that <math>x+y</math> reaches its minimum when <math>m^2+n^2</math> reaches its minimum. We now apply algebraic manipulation to get that <math>m^2+n^2=(m+n)^2-2mn</math>. Since <math>m+n</math> is determined, we now want <math>mn</math> to reach its maximum. Since <math>m</math> and <math>n</math> are positive integers, we can use the AM-GM inequality to get that: <math>\frac{m+n}{2}\geq{\sqrt{mn}}</math>. When <math>mn</math> reaches its maximum, <math>\frac{m+n}{2}={\sqrt{mn}}</math>. This implies that <math>m=n=\frac{13}{2}</math>. However, this is not possible since <math>m</math> and <math>n</math> and integers. Under this constraint, we can see that <math>mn</math> reaches its maximum when <math>m=7</math> and <math>n=6</math>. Therefore, the minimum possible value of <math>x+y</math> is <math>7(m^2+n^2)=7(7^2+6^2)=\boxed{\textbf{(B)}595}</math> | |
− | <math>\sqrt{1183} = 13 \sqrt7 = | + | |
+ | ~[[User:Bloggish|Bloggish]] | ||
==See also== | ==See also== | ||
{{AMC10 box|year=2024|ab=B|num-b=12|num-a=14}} | {{AMC10 box|year=2024|ab=B|num-b=12|num-a=14}} | ||
{{MAA Notice}} | {{MAA Notice}} |
Revision as of 06:15, 14 November 2024
Problem
Positive integers and
satisfy the equation
. What is the minimum possible value of
.
Solution 1
Note that . Since
and
are positive integers, and
, we can represent each value of
and
as the product of a positive integer and
. Let's say that
and
, where
and
are positive integers. This implies that
and that
. WLOG, assume that
. It is not hard to see that
reaches its minimum when
reaches its minimum. We now apply algebraic manipulation to get that
. Since
is determined, we now want
to reach its maximum. Since
and
are positive integers, we can use the AM-GM inequality to get that:
. When
reaches its maximum,
. This implies that
. However, this is not possible since
and
and integers. Under this constraint, we can see that
reaches its maximum when
and
. Therefore, the minimum possible value of
is
See also
2024 AMC 10B (Problems • Answer Key • Resources) | ||
Preceded by Problem 12 |
Followed by Problem 14 | |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 • 16 • 17 • 18 • 19 • 20 • 21 • 22 • 23 • 24 • 25 | ||
All AMC 10 Problems and Solutions |
These problems are copyrighted © by the Mathematical Association of America, as part of the American Mathematics Competitions.