HMMT 1998 V6
- Advanced Topics
- Answer
In the diagram below, how many distinct paths are there from January 1 to December 31, moving from one adjacent dot to the next either to the right, down, or diagonally down to the right?
| Jan. | * | * | * | * | * | * | * | * | * | * | |
|---|---|---|---|---|---|---|---|---|---|---|---|
| * | * | * | * | * | * | * | |||||
| * | * | * | * | * | * | * | * | * | * | ||
| * | * | * | * | * | |||||||
| * | * | * | * | * | * | * | * | * | * | <-Dec. 31 |
Dataset text NuminaMath olympiads. Quoted with source.
Show the answer
372
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.