Partition of a rectangle into squares problem

Revision as of 21:42, 24 June 2006 by Solafidefarms (talk | contribs) (stubbed)

This article is a stub. Help us out by expanding it.

Problem statement

Show that a rectangle can be partitioned into finitely many squares if and only if the ratio of its sides is rational

Proof via Dirichlet's simultaneous rational approximation theorem

We can choose an integer $q$ such that the product of every coordinate of any vertex of