MathDB
2016 Guts #34

Source:

December 24, 2016

Problem Statement

<spanclass=′latex−bold′>(Caos)</span><span class='latex-bold'>(Caos)</span> 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 NN, the number of safe patterns.
An estimate of E>0E > 0 earns ⌊20min⁡(N/E,E/N)4⌋\left\lfloor 20\min(N/E, E/N)^4 \right\rfloor points.
Back to ProblemsView on AoPS