Suppose we have two concentric circles of radii and , respectively. Let be the largest rectangle with two adjacent vertices on the radius circle and two adjacent vertices on the radius circle.
Let and be the dimensions of , with . Then if , where and are positive coprime integers, find .
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.
Orient the two circles on an x y -grid centered at the origin. Let the rectangle be symmetric about the x -axis, with the vertices on the radius 4 circle to the right of those on the radius 3 circle.
Now let y be the vertical dimension of the rectangle and x the horizontal dimension. Then by Pythagoras we have that
x = 3 2 − ( 2 y ) 2 + 4 2 − ( 2 y ) 2 .
(Note that it should be clear that the left side of the rectangle of largest area will be to the left of the y -axis. If it's not clear, then for now just assume this to be the case.)
The area A of the rectangle is then
A = x y = 2 1 ∗ y ∗ [ 3 6 − y 2 + 6 4 − y 2 ] .
We then need to find where d y d A = 0 to find where A is maximized. Doing this we find that
d y d A = ( 2 1 ) [ 3 6 − y 2 + 6 4 − y 2 − 3 6 − y 2 y 2 − 6 4 − y 2 y 2 ] = 0 when
y 2 = 3 6 − y 2 6 4 − y 2 ⟹ y 4 = 2 3 0 4 − 1 0 0 y 2 + y 4 ⟹ y 2 = 1 0 0 2 3 0 4 ⟹ y = 5 2 4 .
Plugging this back into the equation for x yields x = 5 , and so x − y = 5 1 . Thus a = 1 , b = 5 and a + b = 6 .