Difference between revisions of "2004 USAMO Problems/Problem 6"
(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== ==...") |
|||
Line 7: | Line 7: | ||
== Resources == | == Resources == | ||
− | {{USAMO newbox|year=2004|num-b=5| | + | {{USAMO newbox|year=2004|num-b=5|after=Last problem}} |