2002 USAMO Problems/Problem 6

Revision as of 16:19, 16 July 2014 by 5849206328x (talk | contribs) (Solutions)

Problem

I have an $n \times n$ sheet of stamps, from which I've been asked to tear out blocks of three adjacent stamps in a single row or column. (I can only tear along the perforations separating adjacent stamps, and each block must come out of the sheet in one piece.) Let $b(n)$ be the smallest number of blocks I can tear out and make it impossible to tear out any more blocks. Prove that there are real constants $c$ and $d$ such that

$\dfrac{1}{7} n^2 - cn \leq b(n) \leq \dfrac{1}{5} n^2 + dn$

for all $n > 0$.

Solution

This problem needs a solution. If you have a solution for it, please help us out by adding it.

Alternate solutions are always welcome. If you have a different, elegant solution to this problem, please add it to this page.

See also

2002 USAMO (ProblemsResources)
Preceded by
Problem 5
Followed by
Last question
1 2 3 4 5 6
All USAMO Problems and Solutions

The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions. AMC logo.png