Geometry Meets Number Theory

Geometry Level 5

Five points A , B , C , D , E A, B, C, D, E lie in a plane. For each of the points C , D , C, D, and E , E, the distance to point A A is 2 \sqrt{2} times its distance to B . B. The angle C D E CDE is a right angle.

If the side lengths A B , C D , D E \overline{AB}, \overline{CD}, \overline{DE} are all distinct integers, find the minimum value of A B + C D + D E . \overline{AB} + \overline{CD} + \overline{DE}.


The answer is 21.

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

Patrick Corn
May 24, 2018

Without loss of generality, put A A at the origin and B B at ( b , 0 ) . (b,0). The condition given for C , D , E C,D,E is that they all satisfy the equation x 2 + y 2 = 2 ( ( x b ) 2 + y 2 ) , x^2+y^2 = 2((x-b)^2+y^2), which becomes, after some manipulation, ( x 2 b ) 2 + y 2 = 2 b 2 . (x-2b)^2+y^2 = 2b^2. This is a circle centered at ( 2 b , 0 ) (2b,0) with radius b 2 . b \sqrt{2}. Since C D E CDE is a right triangle whose vertices lie on the circle, C E {\overline{CE}} is a diameter, of length 2 b 2 , 2b\sqrt{2}, and we get C D 2 + D E 2 = 8 b 2 . CD^2 + DE^2 = 8b^2. If C D , D E , b CD,DE,b are all integers (note b = A B b=AB ), then looking mod 8 8 shows that C D , D E CD,DE are both even, say C D = 2 x , D E = 2 y , CD = 2x, DE = 2y, and the equation becomes x 2 + y 2 = 2 b 2 x^2+y^2=2b^2 where x , y x,y are distinct positive integers (and neither equals b / 2 b/2 ).

The set of solutions to this equation can be parameterized, but as we are only looking for the minimal solution, we can just search over small values of b . b. The smallest value of b b where a solution exists with positive, distinct x , y x,y is b = 5 , x = 1 , y = 7 , b=5, x=1, y =7, which leads to A B = 5 , C D = 2 , D E = 14 , AB = 5, CD = 2, DE = 14, and a sum of 21 . \fbox{21}. There are no other such solutions for b 10 , b \le 10, so it's clear that this gives the minimal sum.

Can't CD and DE both be odd?

Atomsky Jahid - 3 years ago

Log in to reply

The squares of odd numbers are 1 1 mod 8 , 8, so the sum of squares of two odd numbers is 2 2 mod 8 , 8, not divisible by 8. 8.

(I guess the same is true mod 4 , 4, so I could have said "looking mod 4 4 " instead of "looking mod 8. 8. ")

Patrick Corn - 3 years ago

Log in to reply

Thanks. I learned the proof for this.

Atomsky Jahid - 3 years ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...