HMMT 2003 C2
- Combinatorics
- Answer
You are given a grid of unit squares. Two different squares are adjacent if they share a side. How many ways can one mark exactly nine of the squares so that no two marked squares are adjacent?
Dataset text NuminaMath olympiads. Quoted with source.
Also HMMT 2003 F5.
Show the answer
36
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.