Day 12: Rotating Tables!

A table with length a a , width b b is small if it can be fully rotated in a room with dimensions a + 2 a + 2 , b + 2 b + 2 (height is discounted).

Find the number of distinct small tables with (positive) integer side lengths.

Note: Rotations and reflections are considered identical.

This problem is part of the set Advent Calendar 2014 .


The answer is 7.

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.

1 solution

Michael Ng
Dec 11, 2014

A rectangle is small if its diagonal is less than or equal to b + 2 b+2 . So we need to find the pairs that satisfy this inequality where a and b are positive integers and a b a \geq b : a 2 + b 2 b + 2 \sqrt{a^2+b^2} \leq b+2 As both sides are positive we can square both sides to give: a 2 + b 2 b 2 + 4 b + 4 a^2+b^2 \leq b^2+4b+4 Therefore: b 2 a 2 4 b + 4 b^2 \leq a^2 \leq 4b+4 We can solve b 2 4 b + 4 b^2 \leq 4b+4 to show that b 2 + 2 2 b \leq 2+2\sqrt{2} so that the possible values of b b are 1 , 2 , 3 1, 2, 3 and 4 4 . Analysing all cases gives the pairs for ( a , b ) (a,b) : ( 1 , 1 ) , ( 2 , 1 ) , ( 2 , 2 ) , ( 3 , 2 ) , ( 3 , 3 ) , ( 4 , 3 ) , ( 4 , 4 ) (1,1),(2,1),(2,2),(3,2),(3,3),(4,3),(4,4) and therefore the answer is 7 \boxed{7} .

Simple but deadly. Took me long enough to solve this.

Jake Lai - 6 years, 1 month ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...