Difference between revisions of "2002 USAMO Problems/Problem 6"
m |
m |
||
| Line 6: | Line 6: | ||
{{solution}} | {{solution}} | ||
| − | == | + | == See also == |
| − | + | {{USAMO newbox|year=2002|num-b=5|after=Last question}} | |
| − | |||
| − | |||
[[Category:Olympiad Combinatorics Problems]] | [[Category:Olympiad Combinatorics Problems]] | ||
Revision as of 20:49, 6 April 2013
Problem
I have an 
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 
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 
and 
such that
for all 
.
Solutions
This problem needs a solution. If you have a solution for it, please help us out by adding it.
See also
| 2002 USAMO (Problems • Resources) | ||
| Preceded by Problem 5 |
Followed by Last question | |
| 1 • 2 • 3 • 4 • 5 • 6 | ||
| All USAMO Problems and Solutions | ||
