Difference between revisions of "2004 USAMO Problems/Problem 3"
m |
|||
| Line 8: | Line 8: | ||
{{USAMO newbox|year=2004|num-b=2|num-a=4}} | {{USAMO newbox|year=2004|num-b=2|num-a=4}} | ||
| + | {{MAA Notice}} | ||
Revision as of 13:40, 4 July 2013
Problem
For what values of 
is it possible to dissect a 
rectangle into two similar, but incongruent, polygons?
Solution
This problem needs a solution. If you have a solution for it, please help us out by adding it.
Resources
| 2004 USAMO (Problems • Resources) | ||
| Preceded by Problem 2 |
Followed by Problem 4 | |
| 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. 
