Packing a tetrahedron by similar tetrahedra (Q6181343)

Let \(T_r \subseteq \mathbb R^3\) be the tetrahedron with vertices \((0,0,0)\), \((0,1,0)\), \((1,1,0)\) and \((0,0,1)\). It is shown that, for every sequence of similar images of \(T_r\) whose total volume does not exceed one quarter of the volume of \(T_r\), suitable congruent copies of these images can be packed into \(T_r\) without overlap.