olymmath

ZA-SAMO 1998 Problem 6

    You are given nn squares, not necessarily all of the same size, which have total area 1. Is it always possible to place them without overlapping in a square of area 2?

    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 za-samo/1998/p6 · Tag R4V3EJDDGV · Edit this page on GitHub · Keys: j next, k previous