HMMT 2008 T2
- Team 1
- Answer
Let be a positive integer. Prove that there are ways to walk from to using only up and right unit steps such that the walk never visits the line 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.
Similar problems
These problems have the most words in common with this statement.