A floor is tiled with equilateral triangles of side length 1. If a needle of length 2 is dropped
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 needles, i.e touching along edges or at corners doesn't qualify)

×

Problem Loading...

Note Loading...

Set Loading...