Let H be the orthocentre and O the circumcentre of a triangle A B C with the length of side B C equal to 2 0 1 8 . Cevians are constructed from vertices B and C so as to be tangent to γ , the circle passing through A and H and congruent to the circle centred at O and tangent to B C .
Let the cevians through B and C touch the circle γ at T and U respectively. If B T and C U are of integer lengths, what is their sum?
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.
Thank you for the number theory part of the solution. As I recall I presented partial solution to this problem as a byproduct of the solution to the Trirectangular Corner Locus problem using vectors. Following the solution using vectors in 3D we get A B 2 = A H × A D + B H × B E - another take on Pythagorean. E is a foot of altitude from B on A C
This problem is inspired by and is a copy of Mystic cevians problem from 4 years ago. Please refer to the solution to that problem for the full solution. Please check my related note Generalization of Pythagorean Theorem with Orthocentre .
In this case we are looking for two numbers which will form a Pythagorean Triple with hypotenuse 2018. They are 1680 and 1118. Using power of point we get:
B T 2 = B H × B E C U 2 = C H × C F
The formulas are: B T 2 = 2 c 2 − b 2 + a 2 C U 2 = 2 b 2 − c 2 + a 2
where E , F are feet of the altitudes from B , C respectively.
One example of such triangle side lengths is: b = 2 9 3 8 . 5 , c = 2 6 5 7 . 5
Note: A H is a diameter of the circle stated in the problem. The circle passes through the points E , F .
You can check my solution to the Trirectangular Corner Locus problem using vectors. Following the solution using vectors in 3D we get A B 2 = A H × A D + B H × B E - another take on Pythagorean. E is a foot of altitude from B on A C
Problem Loading...
Note Loading...
Set Loading...
Neither Maria's proof nor the proof in the previous problem explain why we obtain the Pythagorean triples needed. Let us see how to solve the equation m 2 + n 2 = 2 0 1 8 2 for m , n ∈ N . We need to solve ( m + i n ) ( m − i n ) = 2 2 × 1 0 0 9 2 = − ( 1 + i ) 4 ( 2 8 + 1 5 i ) 2 ( 2 8 − 1 5 i ) 2 where 1 + i and 2 8 + 1 5 i are irreducible in the Euclidean domain Z [ i ] . These numbers are irreducible because N ( 1 + i ) = 2 and N ( 2 8 + 1 5 i ) = 1 0 0 9 are prime numbers, where N ( a + b i ) = a 2 + b 2 is the distance function in Z [ i ] . If u ∈ Z [ i ] is a prime factor of m + i n , then its complex conjugate u ⋆ must be a factor of m − i n .
This means that there are two options. Either m + n i is a unit in Z [ i ] times ( 1 + i ) 2 ( 2 8 + 1 5 i ) ( 2 8 − 1 5 i ) = 2 0 1 8 i , or else m + n i is a unit in Z [ i ] times ( 1 + i ) 2 ( 2 8 + 1 5 i ) 2 = − 1 6 8 0 + 1 1 1 8 i . Thus either { m , n } = { 2 0 1 8 , 0 } , or else { m , n } = { 1 6 8 0 , 1 1 1 8 } . Only the second solution is physically reasonable for this problem.