MathDB
Problems
Contests
National and Regional Contests
USA Contests
USA - College-Hosted Events
Harvard-MIT Mathematics Tournament
2016 Harvard-MIT Mathematics Tournament
12
12
Part of
2016 Harvard-MIT Mathematics Tournament
Problems
(1)
2016 Guts #12
Source:
12/24/2016
Let
R
R
R
be the rectangle in the Cartesian plane with vertices at
(
0
,
0
)
,
(
2
,
0
)
,
(
2
,
1
)
,
(0,0), (2,0), (2,1),
(
0
,
0
)
,
(
2
,
0
)
,
(
2
,
1
)
,
and
(
0
,
1
)
(0,1)
(
0
,
1
)
.
R
R
R
can be divided into two unit squares, as shown; the resulting figure has seven edges. [asy] size(3cm); draw((0,0)--(2,0)--(2,1)--(0,1)--cycle); draw((1,0)--(1,1)); [/asy] Compute the number of ways to choose one or more of the seven edges such that the resulting figure is traceable without lifting a pencil. (Rotations and reflections are considered distinct.)