olymmath

AUSTRIAN-POLISH 1996 Problem 9

    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.

    Dataset text AI-MO AoPS. Quoted with source.

    Solutions

    No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

    Add a solution

    Similar problems

    These problems have the most words in common with this statement.

    Locator austrian-polish/1996/p9 · Tag 8KFNPJ3PBS · Edit this page on GitHub · Keys: j next, k previous