A rectangular table has been cut into subrectangles whose edges are parallel to the original table, as in the example above. Given that each subrectangle has at least one side of integer length (in centimeters), is it true that the original table has at least one side of integer length (in centimeters)?
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Impose coordinates parallel to the sides of the rectangle (units centimeters). Label the subrectangles R 1 , … , R n , and the original/large table R .
Given a rectangle [ a , b ] × [ c , d ] , the integral
∫ a b ∫ c d e 2 π i ( x + y ) d y d x
= − 4 π 2 1 ( e 2 π b − e 2 π i a ) ( e 2 π i d − e 2 π i c )
is zero if and only if at least one of d − c , b − a is an integer - that is, if the rectangle has at least one integral side. In particular, note
∫ ∫ R j e 2 π i ( x + y ) d A = 0 for each j .
Therefore,
∫ ∫ R e 2 π i ( x + y ) d A = j = 1 ∑ n ∫ ∫ R j e 2 π i ( x + y ) d A
= j 1 ∑ n 0 = 0 , so the original rectangle (table) must have at least one integral side.