WOLFRAM|DEMONSTRATIONS PROJECT

Tin Box with Maximum Volume

​
a
3
b
3
Vary the height x
0.6
Show integer dimensions a and b with rational height for biggest box:
Tin box holds the most when x =
1
2
.
Problem: A piece of sheet tin three feet square is to be made into a rectangular box open at the top by cutting out equal squares from the corners and bending up the sides of the resulting piece parallel with the edges. Among all such boxes, to find the box of greatest volume.
This is the problem J. L. Walsh used in his 1947 Classroom Note in The American Mathematical Monthly to illustrate a rigorous analysis of maximum-minimum problems. A version of the problem appears in many calculus books and in Walsh’s 1962 booklet.
Let the tin sheet have dimensions
a×b
, with
a≥b
, and suppose a square with side
x
is cut from each corner. The volume of the resulting box is
V(x)=x(a-2x)(b-2x)
,
0≤x≤
b
2
.
Walsh’s rigorous analysis uses the extreme value theorem: A continuous function on a closed bounded interval has minimum and maximum values, and the critical point theorem: If a function has an extreme value at an interior point of an interval, its derivative at the point is either zero or does not exist. A proof of the extreme value theorem is best left to an advanced calculus course, but the critical point theorem depends only on the definition of derivative. An extreme value cannot occur where
f'(x)>0
or
f'(x)<0
.
Since
V(x)
is continuous on
0≤x≤
b
2
, it has a maximum value there, by the extreme value theorem.
Let the maximum occur at
x=
x
0
.
Since
V(0)=V
b
2
=0
, and
V(x)>0
when
0<x<b
, we have
0<
x
0
<
b
2
.
Since
V'(x)
exists for
0<x<
b
2
, the critical point theorem implies
V'(
x
0
)=0
.
Since
′
V
(x)=-4x(a+b)+ab+12
2
x
,
′
V
(
x
0
)=0
for
0<
x
0
<
b
2
when
x
0
=
1
6
a+b-
2
a
-ab+
2
b

.
Therefore, with
a=b=3
, the box has maximum volume when
x
0
=
1
2
.
Calculations are easiest and the biggest box is easiest to make when
a
and
b
are integers and
x
0
is rational. These are the triples
{a,b,
x
0
}
with this property, where
1≤
b
0
≤
a
0
≤100
and
a
and
b
are relatively prime:
1,1,
1
6
,8,3,
2
3
,{8,5,1},15,7,
3
2
,15,8,
5
3
,21,5,
7
6
,{21,16,3},35,11,
5
2
,35,24,
14
3
,40,7,
5
3
,{40,33,6},{48,13,3},48,35,
20
3
,55,16,
11
3
,55,39,
15
2
,65,9,
13
6
,{65,56,10},{77,32,7},77,45,
55
6
,{80,17,4},80,63,
35
3
,91,40,
26
3
,91,51,
21
2
,96,11,
8
3
,{96,85,15},99,19,
9
2
,99,80,
44
3
.
This Demonstration lets you choose one of these triples and an integer multiplier. For example, choosing the first triple and multiplier 3 gives
3,3,
1
2

, the case in the stated problem. It is somewhat surprising how shallow the biggest box is.