Let $latex R$ be a rectangle with side lengths $latex a$ and $latex b$. Show that if $latex R$ is tiled by rectangles each of which has at least one integer side, then at least one of $latex a$ and $latex b$ is an integer.
Due day is May 10.
Let $latex R$ be a rectangle with side lengths $latex a$ and $latex b$. Show that if $latex R$ is tiled by rectangles each of which has at least one integer side, then at least one of $latex a$ and $latex b$ is an integer.
Due day is May 10.