olymmath

HMMT 2006 T1

  • Team 1
  • Answer

For this problem, our lawn consists of a row of nn clumps of grass. This row runs in an east-west direction. In our formation, each mobot may be oriented toward the north, south, east, or west. One example of an allowable formation if n=6n=6 is symbolized below:

⋅⟵↑↓\cdot \longleftarrow \uparrow^{\downarrow}

(The mobot on the third clump will move westward, mowing the first three clumps. Each of the last three clumps is mowed by a different mobot.) Here's another allowable formation for n=6n=6, considered different from the first:

Compute the number of different allowable formations for any given nn.

Dataset text NuminaMath olympiads. Quoted with source.

Show the answer

2^{n+2}-n-3

Solutions

No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

Add a solution

Similar problems

These problems have the most words in common with this statement.

Locator hmmt/2006/t1 · Tag CDE3NNCPSV · Edit this page on GitHub · Keys: j next, k previous