A table with length
, width
is
small
if it can be fully rotated in a
room with dimensions
,
(height is discounted).
Find the number of distinct small tables with (positive) integer side lengths.
Note: Rotations and reflections are considered identical.
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.
A rectangle is small if its diagonal is less than or equal to b + 2 . So we need to find the pairs that satisfy this inequality where a and b are positive integers and a ≥ b : a 2 + b 2 ≤ b + 2 As both sides are positive we can square both sides to give: a 2 + b 2 ≤ b 2 + 4 b + 4 Therefore: b 2 ≤ a 2 ≤ 4 b + 4 We can solve b 2 ≤ 4 b + 4 to show that b ≤ 2 + 2 2 so that the possible values of b are 1 , 2 , 3 and 4 . Analysing all cases gives the pairs for ( a , b ) : ( 1 , 1 ) , ( 2 , 1 ) , ( 2 , 2 ) , ( 3 , 2 ) , ( 3 , 3 ) , ( 4 , 3 ) , ( 4 , 4 ) and therefore the answer is 7 .