Prove that if you have a rectangle and you partition it into smaller rectangles such that every rectangle has at least 1 edge of integer length, then the large rectangle has 1 edge of integer length.

The proof is supposed to be simple by using the fact that in a graph the number of nodes with odd degrees is even, and it's generalized for R

^{n}, but I'm still stuck even on R

^{2}...

**Edited by Anza Power, 11 June 2012 - 12:51 PM.**