HMMT 2016 U6
- Guts
- Answer
Consider a grid of points and a path consisting of straight line segments connecting all these points, starting from the bottom left corner and ending at the upper right corner. Such a path is called efficient if each point is only passed through once and no two line segments intersect. How many efficient paths are there when ?
Dataset text NuminaMath olympiads. Quoted with source.
Show the answer
\binom{4030}{2015}
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.