2024 AMC 10B Problems/Problem 13: Difference between revisions
m LF |
|||
| (21 intermediate revisions by 7 users not shown) | |||
| 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> | 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 <cmath>x+y=(\sqrt{x})^2+(\sqrt{y})^2=7m^2+7n^2=7(m^2+n^2)</cmath> 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 <cmath>m^2+n^2=(m+n)^2-2mn</cmath> 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> | ||
~[[User:Bloggish|Bloggish]] | ~[[User:Bloggish|Bloggish]] | ||
A similar method is to take <math>y=1183-26\sqrt{7x}-x^2</math>, then noting <math>x=7a^2</math> and bashing to find the value of a where x is closest to y. | |||
~meihk_neiht | |||
==Solution 2 (Guessing & Answer Choices)== | ==Solution 2 (Guessing & Answer Choices)== | ||
Set <math>x=y</math>, giving the minimum possible values. The given equation becomes <cmath>\sqrt{x}=\sqrt{y}=\dfrac{\sqrt{1183}}{2}\implies x=y=\dfrac{1183}{4}.</cmath>This means that <cmath>x+y=\dfrac{1183}{2}=591.5.</cmath>Since this is closest to answer choice <math>\text{(B)}</math>, the answer is <math>\boxed{\textbf{(B) }595}</math> ~Neoronean ~Tacos_are_yummy_1 (latex) | Set <math>x=y</math>, giving the minimum possible values. The given equation becomes <cmath>\sqrt{x}=\sqrt{y}=\dfrac{\sqrt{1183}}{2}\implies x=y=\dfrac{1183}{4}.</cmath>This means that <cmath>x+y=\dfrac{1183}{2}=591.5.</cmath>Since this is closest to answer choice <math>\text{(B)}</math>, the answer is <math>\boxed{\textbf{(B) }595}</math> ~Neoronean ~Tacos_are_yummy_1 (latex) | ||
Note: | |||
If using a solution similar to this one it is recommended to still find valid x and y that add to 595. | |||
~meikh neiht | |||
==Solution 3 (quick, no guessing but still answer choices)== | |||
Square both sides of the equation to get <imath>2\cdot \sqrt{xy} + (x + y) = 1183.</imath> We can plug in possible values for <imath>x + y</imath> based on the answer choices. If we do <imath>585,</imath> we get <imath>\sqrt{xy} = 299 \implies xy = 299^2.</imath> So <imath>y = \frac{299^2}{x}.</imath> Then we have | |||
<imath>x^2 + 299^2 = 585x,</imath> which has no real solutions for <imath>x</imath> since the discriminant is negative. Following the same process for <imath>595</imath> we obtain the equation <imath>x^2 + 294^2 = 595x,</imath> which can be factored as <imath>(x - 252)(x - 343) = 0.</imath> So the answer must be <imath>\boxed{\textbf{(B) }595}</imath>. | |||
~[[User:grogg007|grogg007]] | |||
== Solution 4 (Calculus) == | |||
Since <imath>\sqrt{x}+\sqrt{y}=\sqrt{1183}</imath>, we can express <imath>y</imath> in terms of <imath>x</imath>: <imath>y = x+1183-2\sqrt{1183x}</imath>. <imath>x+y = 2x+1183-2\sqrt{1183x}</imath>. Taking the derivative of this, we get <imath>2-2 \cdot \frac{1}{2\sqrt{1183x}} \cdot 1183</imath>. We find the critical points by setting this expression to equate <imath>0</imath>. Simplifying, we get <imath>2 = \frac{1183}{\sqrt{1183x}}</imath>, and then we get <imath>4 \cdot 1183x = 1183^2</imath>. Dividing by <imath>1183</imath>, we get <imath>4x=1183</imath>, so a critical point is <imath>x=\frac{1183}{4}</imath>. Now, we take the second derivative, we get <imath>\frac{13\sqrt{7x}}{2x^2}</imath>. When <imath>x=\frac{1183}{4}</imath>, the second derivative is positive, meaning the minimum value is obtained at <imath>x=\frac{1183}{4}</imath>. This value is <imath>295.75</imath>. However, the problem asks for positive integers <imath>x</imath> and <imath>y</imath>. We want <imath>x</imath> to be as close to <imath>295.75</imath> as possible. We also want <imath>y</imath> to be an integer, so <imath>x+1183-2\sqrt{1183x}</imath> should be an integer. Notice how since <imath>x</imath> is an integer, we just want <imath>\sqrt{1183x}</imath> to be an integer. Prime factorizing <imath>1183</imath>, we get <imath>1183=7 \cdot 13^2</imath>. Therefore, <imath>x</imath> must contain an odd amount of <imath>7</imath>'s and an even amount of any other prime factor. We quickly find that <imath>2^2 \cdot 3^2 \cdot 7 = 252</imath> is the optimal solution for <imath>x</imath>, and plugging in, we get <imath>y=252 + 1183 - 2 \cdot 2 \cdot 3 \cdot 7 \cdot 13 = 343</imath>. We find <imath>x+y=595</imath>, so the answer is choice <imath>\boxed{\text{(B) 595}}</imath>. | |||
~ lovelearning999 | |||
Note: | |||
It might not be immediately clear why <imath>x=252</imath> is the optimal solution. The following explains why <imath>x=252</imath> is optimal. | |||
<imath>x</imath> must have an odd amount of <imath>7</imath>'s and an even amount of any other prime factor. This means that <imath>x</imath> can be expressed as <imath>7^n \cdot a</imath> where <imath>a</imath> is a perfect square. We can simplify this to <imath>7 \cdot 7^{n-1} \cdot a = 7b</imath>, where <imath>b</imath> is a perfect square, since <imath>n-1</imath> is even. This means that <imath>7b</imath> is as close to <imath>295.75</imath> as possible. This means that <imath>b \approx \frac{295.75}{7}</imath>. <imath>\frac{295.75}{7}</imath> is approximately <imath>42</imath>, so <imath>b \approx 42</imath>. Since <imath>b</imath> is a perfect square, we have two candidates for <imath>b</imath>: <imath>36</imath> and <imath>49</imath>. If <imath>b=36</imath>, <imath>x=252</imath>, and if <imath>b=49</imath>, <imath>x=343</imath>. To find the optimal value for <imath>x</imath>, pick the value closest to <imath>295.75</imath>, and we find that <imath>\left |295.75-252 \right | < \left |295.75 - 343 \right|</imath>, so <imath>x=252</imath> is optimal. From now, proceed in the same way as the original solution. | |||
~ lovelearning999 | |||
==Video Solution 1 by Pi Academy (Fast and Easy ⚡🚀)== | ==Video Solution 1 by Pi Academy (Fast and Easy ⚡🚀)== | ||
| Line 20: | Line 48: | ||
==Video Solution 2 by SpreadTheMathLove== | ==Video Solution 2 by SpreadTheMathLove== | ||
https://youtu.be/7ZKvxU6c75g?si=KvM1x612u6fig_Xc | https://youtu.be/7ZKvxU6c75g?si=KvM1x612u6fig_Xc | ||
==Video Solution 3 by TheBeautyofMath== | |||
https://youtu.be/dfF39udgqc8?t=724 in Rapid Fire | |||
~IceMatrix | |||
==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}} | ||
[[Category: Introductory Algebra Problems]] | |||
Latest revision as of 18:53, 10 November 2025
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
A similar method is to take
, then noting
and bashing to find the value of a where x is closest to y.
~meihk_neiht
Solution 2 (Guessing & Answer Choices)
Set
, giving the minimum possible values. The given equation becomes
This means that
Since this is closest to answer choice
, the answer is
~Neoronean ~Tacos_are_yummy_1 (latex)
Note: If using a solution similar to this one it is recommended to still find valid x and y that add to 595.
~meikh neiht
Solution 3 (quick, no guessing but still answer choices)
Square both sides of the equation to get
We can plug in possible values for
based on the answer choices. If we do
we get
So
Then we have
which has no real solutions for
since the discriminant is negative. Following the same process for
we obtain the equation
which can be factored as
So the answer must be
.
Solution 4 (Calculus)
Since
, we can express
in terms of
:
.
. Taking the derivative of this, we get
. We find the critical points by setting this expression to equate
. Simplifying, we get
, and then we get
. Dividing by
, we get
, so a critical point is
. Now, we take the second derivative, we get
. When
, the second derivative is positive, meaning the minimum value is obtained at
. This value is
. However, the problem asks for positive integers
and
. We want
to be as close to
as possible. We also want
to be an integer, so
should be an integer. Notice how since
is an integer, we just want
to be an integer. Prime factorizing
, we get
. Therefore,
must contain an odd amount of
's and an even amount of any other prime factor. We quickly find that
is the optimal solution for
, and plugging in, we get
. We find
, so the answer is choice
.
~ lovelearning999
Note:
It might not be immediately clear why
is the optimal solution. The following explains why
is optimal.
must have an odd amount of
's and an even amount of any other prime factor. This means that
can be expressed as
where
is a perfect square. We can simplify this to
, where
is a perfect square, since
is even. This means that
is as close to
as possible. This means that
.
is approximately
, so
. Since
is a perfect square, we have two candidates for
:
and
. If
,
, and if
,
. To find the optimal value for
, pick the value closest to
, and we find that
, so
is optimal. From now, proceed in the same way as the original solution.
~ lovelearning999
Video Solution 1 by Pi Academy (Fast and Easy ⚡🚀)
https://youtu.be/YqKmvSR1Ckk?feature=shared
~ Pi Academy
Video Solution 2 by SpreadTheMathLove
https://youtu.be/7ZKvxU6c75g?si=KvM1x612u6fig_Xc
Video Solution 3 by TheBeautyofMath
https://youtu.be/dfF39udgqc8?t=724 in Rapid Fire
~IceMatrix
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.