I have this problem from USAMO 2004:
"For what values of $k > 0$ is it possible to dissect a $1 \times k$ rectangle into two similar, but incongruent, polygons?"
I feel that all values of k will satisfy, since for any rectangle with a given k, I draw a line which intersects the opposite sides of the rectangle at unequal distances from the opposite vertices and I get 2 polygons which are similar but incongruent. However, I have a few doubts, this is USAMO so I personally don't think such a solution would be deemed correct, moreover the answer says that k should not be equal to one
Why is that so? And any mistakes with my solution?
I think there might be a fractal solution, with two shapes bounded by this sequence of horizontal and vertical lines:
$$(0,0),(1,0),(1,x),(1+x^2,x),(1+x^2,x+x^3),(1+x^2+x^4,x+x^3),...$$ end at the far corner
$$\left(\frac1{1-x^2},\frac x{1-x^2}\right)$$