HMMT 2025 C2
- Combinatorics
- Answer
Kelvin the frog is on the bottom-left lily pad of a grid of lily pads, and his home is at the topright lily pad. He can only jump between two lily pads which are horizontally or vertically adjacent. Compute the number of ways to remove 4 of the lily pads so that the bottom-left and top-right lily pads both remain, but Kelvin cannot get home.
Dataset text NuminaMath olympiads. Quoted with source.
Show the answer
29
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.