2004 USAMO Problems/Problem 3: Difference between revisions
Created page with "==Problem== 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== ==..." |
mNo edit summary |
||
| Line 4: | Line 4: | ||
==Solution== | ==Solution== | ||
{{solution}} | |||
== Resources == | == Resources == | ||
{{USAMO newbox|year=2004|num-b=2|num-a=4}} | {{USAMO newbox|year=2004|num-b=2|num-a=4}} | ||
Revision as of 13:48, 8 April 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 | ||
