It is shown that, for every n is an element of{3, 4,...}, every rectangle R can be dissected into n rectangles that are mutually similar, but of different size. For the case n = 2, a partition of that kind exists if and only if the quotient of the edge lengths of R is larger than 2.