MathDB
Problems
Contests
National and Regional Contests
USA Contests
USA - College-Hosted Events
Harvard-MIT Mathematics Tournament
2016 Harvard-MIT Mathematics Tournament
34
34
Part of
2016 Harvard-MIT Mathematics Tournament
Problems
(1)
2016 Guts #34
Source:
12/24/2016
<
s
p
a
n
c
l
a
s
s
=
′
l
a
t
e
x
−
b
o
l
d
′
>
(
C
a
o
s
)
<
/
s
p
a
n
>
<span class='latex-bold'>(Caos)</span>
<
s
p
an
c
l
a
ss
=
′
l
a
t
e
x
−
b
o
l
d
′
>
(
C
a
os
)
<
/
s
p
an
>
A cao [sic] has 6 legs, 3 on each side. A walking pattern for the cao is defined as an ordered sequence of raising and lowering each of the legs exactly once (altogether 12 actions), starting and ending with all legs on the ground. The pattern is safe if at any point, he has at least 3 legs on the ground and not all three legs are on the same side. Estimate
N
N
N
, the number of safe patterns.An estimate of
E
>
0
E > 0
E
>
0
earns
⌊
20
min
(
N
/
E
,
E
/
N
)
4
⌋
\left\lfloor 20\min(N/E, E/N)^4 \right\rfloor
⌊
20
min
(
N
/
E
,
E
/
N
)
4
⌋
points.