USAMO 2004 Problem 3

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

Dataset text AI-MO AoPS. Quoted with source.

Solutions

No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

Locator usamo/2004/p3 · Tag DF6TDY0873 · Edit this page on GitHub · Keys: j next, k previous