Let be a non-equilateral triangle with integer sides. Let and be respectively the mid-points of and . Let be the centroid of triangle . Suppose are concyclic. Find the least possible perimeter of triangle .
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.
Suppose that the points A , B , C are represented by complex numbers a , b , 0 respectively. Without loss of generality, we can assume that a is a positive real. We therefore also require that u = ∣ a ∣ = a , v = ∣ b ∣ and w = ∣ a − b ∣ are positive integers. We can also assume that u ≥ v .
The fact that C , D , E , G are concyclic means that the four complex numbers 0 , 2 1 a , 2 1 b , 3 1 ( a + b ) are concyclic. This means that their cross-ratio is real, and hence 2 ( b 2 − a 2 ) b ( 2 b − a ) = 2 1 ( b − a ) 3 1 ( b + a ) 2 1 b ( 3 1 b − 6 1 a ) = 2 1 λ for some real λ . This implies that ( 2 − λ ) b 2 − a b + λ a 2 = 0 Since we want A B C to be a nontrivial triangle, b cannot be a real multiple of a , and so we deduce that 4 λ ( 2 − λ ) > 1 , with b = 2 ( 2 − λ ) a { 1 ± i 4 λ ( 2 − λ ) − 1 } From this we deduce that u = a v = a 2 − λ λ w = 2 − λ a From this we deduce that λ = w 2 v 2 and hence that u 2 + v 2 = 2 w 2 Since u 2 + v 2 is even, u and v must have the same parity. If we define nonnegative integers p , q by setting u + v = 2 p , u − v = 2 q , we deduce that p 2 + q 2 = w 2 . We therefore need to consider Pythagorean triples.