We consider three dimensional L-tetrominoes. We show that there exists at least one way to tile every three dimensional rectangle whose side lengths are at least 3 and area is congruent to 1(mod4) such that one square goes untiled. In addition, we show that every three dimensional rectangle is tileable provided one side has length at least 2 and the other is a multiple of 4
Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.