2004 General, part 1 #10
Source:
March 8, 2024
combinatorics
Problem Statement
A floor is tiled with equilateral triangles of side length , as shown. If you drop a needle of length 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.)
https://cdn.artofproblemsolving.com/attachments/5/6/e7555c22ffe890b46a3ebdbda2169d23e43700.png