Each of the six spaces is filled with a distinct positive integer For each of the four smaller triangles formed, if their vertices are filled with the integers we must have Find the maximum possible value of the sum of the numbers in the circles.
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.
Let the largest element in the all-circles triangle be m . It follows that the sum of the values in the circles must be 2 m + 5 , so we want to maximize m .
When considering the two adjacent squares to m , note that they must each be bigger than m ; otherwise, the square would need an equal value to the circle opposite it in the diagram, which is not possible since the integers must be distinct. Call those values for the squares n 1 > m and n 2 > m , and call the other two circle values v 1 and v 2 , corresponding to the squares they share a triangle with.
Now, we have three equations: v 1 + v 2 − 5 = m , m + v 1 − n 1 = 5 , and m + v 2 − n 2 = 5 . Thus, 3 m − 5 = n 1 + n 2 .
Taking ( n 1 , n 2 ) = ( 2 5 , 2 4 ) gives 3 m − 5 = 4 9 , so m = 1 8 . Then, v 1 , v 2 = 1 2 , 1 1 , and we can fill the final square with 6 . The largest possible sum is thus 2 ⋅ 1 8 + 5 = 4 1 .