2004 USAMO Problems/Problem 3

Revision as of 13:48, 8 April 2013 by Yrushi (talk | contribs)

Problem

For what values of $k > 0$ is it possible to dissect a $1 \times k$ 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 (ProblemsResources)
Preceded by
Problem 2
Followed by
Problem 4
1 2 3 4 5 6
All USAMO Problems and Solutions