[math-fun] Packing parallelograms into a triangle

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