Problem of the Week # 220 - Jun 14, 2016

  • Thread starter Thread starter Ackbach
  • Start date Start date
  • Tags Tags
    2016
Click For Summary
SUMMARY

The least number $A$ such that any two squares with a combined area of 1 can be packed into a rectangle of area $A$ is determined in this discussion. This problem, originally Problem A-1 in the 1996 William Lowell Putnam Mathematical Competition, remains unsolved by participants, with kiwi recognized for a commendable attempt. The solution is credited to Kiran Kedlaya and his associates, emphasizing the geometric constraints involved in packing squares into rectangles.

PREREQUISITES
  • Understanding of geometric packing problems
  • Familiarity with area calculations of squares and rectangles
  • Knowledge of the William Lowell Putnam Mathematical Competition format
  • Basic principles of combinatorial geometry
NEXT STEPS
  • Research geometric packing theorems and their applications
  • Study the principles of combinatorial geometry in depth
  • Explore previous William Lowell Putnam Mathematical Competition problems
  • Learn about the contributions of Kiran Kedlaya in mathematical problem-solving
USEFUL FOR

Mathematics enthusiasts, competitive problem solvers, and educators looking to enhance their understanding of geometric packing and combinatorial geometry.

Ackbach
Gold Member
MHB
Messages
4,148
Reaction score
94
Here is this week's POTW:

-----

Find the least number $A$ such that for any two squares of combined area $1$, a rectangle of area $A$ exists such that the two squares can be packed into the rectangle (without interior overlap). You may assume that the sides of the squares are parallel to the sides of the rectangle.

-----

Remember to read the http://www.mathhelpboards.com/showthread.php?772-Problem-of-the-Week-%28POTW%29-Procedure-and-Guidelines to find out how to http://www.mathhelpboards.com/forms.php?do=form&fid=2!
 
Physics news on Phys.org
Re: Problem Of The Week # 220 - Jun 14, 2016

This was Problem A-1 in the 1996 William Lowell Putnam Mathematical Competition.

No one answered this week's POTW correctly, though I'm happy to give a shout-out to kiwi for a valiant attempt. The solution, attributed to Kiran Kedlaya and his associates, follows:

If $x$ and $y$ are the sides of two squares with combined area 1, then
$x^2 + y^2 = 1$. Suppose without loss of generality that $x \geq y$.
Then the shorter side of a rectangle containing both squares without
overlap must be at least $x$, and the longer side must be at least
$x+y$. Hence the desired value of $A$ is the maximum of $x(x+y)$.

To find this maximum, we let $x = \cos \theta, y = \sin \theta$ with
$\theta \in [0, \pi/4]$. Then we are to maximize
\begin{align*}
\cos^2 \theta + \sin \theta \cos \theta
&= \frac 12 (1 + \cos 2\theta + \sin 2\theta) \\
&= \frac 12 + \frac{\sqrt{2}}{2} \cos (2\theta - \pi/4) \\
&\leq \frac{1 + \sqrt{2}}{2},
\end{align*}
with equality for $\theta = \pi/8$. Hence this value is the desired
value of $A$.
 

Similar threads

  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 1 ·
Replies
1
Views
1K
Replies
1
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 1 ·
Replies
1
Views
1K