Difference between revisions of "2024 AIME I Problems/Problem 15"

Revision as of 11:57, 4 February 2024

Problem

Let $\textit{B}$ be the set of rectangular boxes with surface area $54$ and volume $23$ . Let $r$ be the radius of the smallest sphere that can contain each of the rectangular boxes that are elements of $\textit{B}$ . The value of $r^2$ can be written as $\frac{p}{q}$ , where $p$ and $q$ are relatively prime positive integers. Find $p+q$ .

Solution 1

Observe that the "worst" possible box is one of the maximum possible length. By symmetry, the height and the width are the same in this antioptimal box. (If the height and width weren't the same, the extra difference between them could be used to make the length longer.) Thus, let the width and height be of length $a$ and the length be $L$ .

We're given that the volume is $23$ ; thus, $a^2L=23$ . We're also given that the surface area is $54=2\cdot27$ ; thus, $a^2+2aL=27$ .

From the first equation, we can get $L=\dfrac{23}{a^2}$ . We do a bunch of algebra:

\begin{align*} L&=\dfrac{23}{a^2} \\ 27&=a^2+2aL \\ &=a^2+2a\left(\dfrac{23}{a^2}\right) \\ &=a^2+\dfrac{46}a \\ 27a&=a^3+46 \\ a^3-27a+46&=0. \\ \end{align*}

We can use the Rational Root Theorem and test a few values. It turns out that $a=2$ works. We use synthetic division to divide by $a-2$ :

As we expect, the remainder is $0$ , and we are left with the polynomial $x^2+2x-23$ . We can now simply use the quadratic formula and find that the remaining roots are $\dfrac{-2\pm\sqrt{4-4(-23)}}2=\dfrac{-2\pm\sqrt{96}}2=\dfrac{-2\pm4\sqrt{6}}2=-1\pm2\sqrt6$ . We want the smallest $a$ to maximize $L$ , and it turns out that $a=2$ is in fact the smallest root. Thus, we let $a=2$ . Substituting this into $L=\dfrac{23}{a^2}$ , we find that $L=\dfrac{23}4$ . However, this is not our answer! This is simply the length of the box; we want the radius of the sphere enclosing it. We know that the diameter of the sphere is the diagonal of the box, and the 3D Pythagorean Theorem can give us the space diagonal. Applying it, we find that the diagonal has length $\sqrt{2^2+2^2+\left(\dfrac{23}4\right)^2}=\sqrt{8+\dfrac{529}{16}}=\sqrt{\dfrac{128+529}{16}}=\dfrac{\sqrt{657}}4$ . This is the diameter; we halve it to find the radius, $\dfrac{\sqrt{657}}8$ . We then square this and end up with $\dfrac{657}{64}$ , giving us an answer of $657+64=\boxed{721}$ .

~Technodoggo

Solution 2 (constrained optimization with Lagrangian multiplier)

Denote by $x$ , $y$ , $z$ the length, width, and height of a rectangular box. We have \begin{align*} xy + yz + zx & = \frac{54}{2} \hspace{1cm} (1) \\ xyz & = 23 \hspace{1cm} (2) \end{align*}

We have \begin{align*} 4 r^2 & = x^2 + y^2 + z^2 \\ & = \left( x + y + z \right)^2 - 2 \cdot \left( xy + yz + zx \right) \\ & = \left( x + y + z \right)^2 - 54 . \end{align*}

Therefore, we solve the following constrained optimization problem: \begin{align*} \max_{x,y,z} \ & x + y + z \\ \mbox{subject to } & (1), (2) \end{align*}

First, we prove that an optimal solution must have at least two out of $x$ , $y$ , $z$ that are the same.

Denote by $\lambda$ and $\eta$ lagrangian multipliers of constraints (1) and (2), respectively. Consider the following Lagrangian: \begin{align*} \max_{x,y,z, \lambda, \eta} & x + y + z + \lambda \left( xy + yz + zx - 27 \right) + \eta \left( xyz - 23 \right) . \end{align*}

Taking first-order-condition with respect to $x$ , $y$ , $z$ , respectively, we get \begin{align*} 1 + \lambda \left( y + z \right) + \eta yz & = 0 \hspace{1cm} (3) \\ 1 + \lambda \left( z + x \right) + \eta zx & = 0 \hspace{1cm} (4) \\ 1 + \lambda \left( x + y \right) + \eta xy & = 0 \hspace{1cm} (5) \end{align*}

Suppose there is an optimal solution with $x$ , $y$ , $z$ that are all distinct.

Taking $(4)-(3)$ , we get $\left( x - y \right) \left( \lambda + \eta z \right) = 0 .$

Because $x \neq y$ , we have $\lambda + \eta z = 0 \hspace{1cm} (6)$

Analogously, we have \begin{align*} \lambda + \eta x & = 0 \hspace{1cm} (7) \end{align*}

Taking $(6) - (7)$ , we get $\eta \left( z - x \right) = 0$ . Because $z \neq x$ , we have $\eta = 0$ . Plugging this into (6), we get $\lambda = 0$ .

However, the solution that $\lambda = \eta = 0$ is a contradiction with (3). Therefore, in an optimal solution, we cannot have $x$ , $y$ , and $z$ to be all distinct.

W.L.O.G, in our remaining analysis, we assume an optimal solution satisfies $y = z$ .

Therefore, we need to solve the following two-variable optimization problem: \begin{align*} \max_{x,y} \ & x + 2y \\ \mbox{subject to } & 2 xy + y^2 = 27 \\ & xy^2 = 23 \end{align*}

Replacing $x$ with $y$ by using the constraint $xy^2 = 23$ , we solve the following single-variable optimization problem: \begin{align*} \max_y \ & \frac{23}{y^2} + 2y \hspace{1cm} (8) \\ \mbox{subject to } & \frac{46}{y} + y^2 = 27 \hspace{1cm} (9) \end{align*}

By solving (9), we get $y = 2$ and $-1 + 2 \sqrt{6}$ .

Plugging $y = 2$ into (8), we get $\frac{23}{y^2} + 2y = \frac{39}{4}$ .

Plugging $y = -1 + 2 \sqrt{6}$ into (8), we get $\frac{23}{y^2} + 2y = \frac{96 \sqrt{6} - 21}{23}$ .

We have $\frac{96 \sqrt{6} - 21}{23} < \frac{39}{4}$ . Therefore, the maximum value of $x + y + z$ is $\frac{39}{4}$ .

Therefore, \begin{align*} r^2 & = \frac{1}{4} \left( \left( x + y + z \right)^2 - 54 \right) \\ & = \frac{1}{4} \left( \left( \frac{39}{4} \right)^2 - 54 \right) \\ & = \frac{657}{64} . \end{align*}

Therefore, the answer is $657 + 64 = \boxed{\textbf{(721) }}$ .

~Steven Chen (Professor Chen Education Palace, www.professorchenedu.com)

Solution 3 (Vieta's and Cardano's Formula)

Video Solution 1 by OmegaLearn.org (super short)

https://youtu.be/Io5TLjC3d0U

Video Solution 2 (constrained optimization with Lagrangian multiplier)

https://www.youtube.com/watch?v=KjEy2Ju2z8A

~Steven Chen (Professor Chen Education Palace, www.professorchenedu.com)

@@ Line 127: / Line 127: @@
 ~Steven Chen (Professor Chen Education Palace, www.professorchenedu.com)
+==Solution 3 (Vieta's and Cardano's Formula)==
 ==Video Solution 1 by OmegaLearn.org (super short)==

2024 AIME I (Problems • Answer Key • Resources)
Preceded by Problem 14	Followed by Last Problem
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15
All AIME Problems and Solutions

Page

Toolbox

Search