Difference between revisions of "2004 USAMO Problems/Problem 3"
5849206328x (talk | contribs) m (→Problem) |
|||
| Line 1: | Line 1: | ||
| − | ==Problem== | + | == Problem == |
| − | + | (''Ricky Liu'') For what values of <math>k > 0 </math> is it possible to dissect a <math> 1 \times k </math> rectangle into two similar, but incongruent, polygons? | |
| − | For what values of <math>k > 0 </math> is it possible to dissect a <math> 1 \times k </math> rectangle into two similar, but incongruent, polygons? | ||
==Solution== | ==Solution== | ||
Revision as of 12:11, 18 July 2014
Problem
(Ricky Liu) 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. 
