olymmath

HMMT 2001 U16

  • Guts
  • Answer

After walking so much that his feet get really tired, the beaver staggers so that, at each step, his coordinates change by either (+1,+1)(+1,+1) or (+1,−1)(+1,-1). Now he walks from (0,0)(0,0) to (8,0)(8,0) without ever going below the xx-axis. How many such paths are there?

Dataset text NuminaMath olympiads. Quoted with source.

Show the answer

14

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/2001/u16 · Tag P2QG6XNH1B · Edit this page on GitHub · Keys: j next, k previous