HMMT 2004 E10
- General 1
- Answer
A floor is tiled with equilateral triangles of side length 1 , as shown. If you drop a needle of length 2 somewhere on the floor, what is the largest number of triangles it could end up intersecting? (Only count the triangles whose interiors are met by the needle - touching along edges or at corners doesn't qualify.)
Dataset text NuminaMath olympiads. Quoted with source.
Show the answer
8
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.