olymmath

HMMT 2008 T2

  • Team 1
  • Answer

Let n>2n>2 be a positive integer. Prove that there are 12(n−2)(n+1)\frac{1}{2}(n-2)(n+1) ways to walk from (0,0)(0,0) to (n,2)(n, 2) using only up and right unit steps such that the walk never visits the line y=xy=x after it leaves the origin.

Dataset text NuminaMath olympiads. Quoted with source.

Show the answer

\frac{1}{2}(n-2)(n+1)

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/2008/t2 · Tag 947NWH5CBH · Edit this page on GitHub · Keys: j next, k previous