MathDB
rectangular blocks of size a x b x c, to fill up a cubic box of edge 10

Source: Austrian - Polish 1996 APMC

May 3, 2020
combinatoricsTilingcovering

Problem Statement

For any triple (a,b,c)(a, b, c) of positive integers, not all equal, We are given sufficiently many rectangular blocks of size a×b×ca \times b \times c. We use these blocks to fill up a cubic box of edge 1010. (a) Assume we have used at least 100100 blocks. Show that there are two blocks, one of which is a translate of the other. (b) Find a number smaller than 100100 (the smaller, the better) for which the above statement still holds.