A good FLOORING problem!!!
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)
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
0 solutions
No explanations have been posted yet. Check back later!