2004 USAMO Problems/Problem 6

Revision as of 18:45, 23 February 2012 by Kubluck (talk | contribs) (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== ==...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Problem

For what values of $k > 0$ is it possible to dissect a $1 \times k$ rectangle into two similar, but incongruent, polygons?

Solution

Resources

2004 USAMO (ProblemsResources)
Preceded by
Problem 5
Followed by
Problem 4
1 2 3 4 5 6
All USAMO Problems and Solutions