[math-fun] Packing parallelograms into a triangle
5 Jun
2018
5 Jun
'18
7:19 a.m.
Puzzle: Show that a triangle cannot be written as the union of a finite number of parallelograms with disjoint interiors. Puzzle: Show that you can cover n/(n+1) of the area of a triangle using n parallelograms with disjoint interiors. Problem: is it possible to do better? Jim Propp
2727
Age (days ago)
2727
Last active (days ago)
0 comments
1 participants
participants (1)
-
James Propp