Let P be a point in or on a scalene triangle A B C with integer side lengths, and let f ( P ) = P A + P B + P C . For each triangle A B C , let g A B C = max P f ( P ) and h A B C = min P f ( P ) .
Consider all triangles where g A B C and h A B C are both integers. Over this set, what is the minimum value of g A B C − h A B C ?
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.
Do you want "minimum value of g that is an integer", or do you want "minimum value of g when both max f and min f are integers"?
The question and the assumptions are different from each other.
Log in to reply
As was stated in my further details, it asks of the latter. I was also doubtful that my phrasing was correct, so I will edit it accordingly.
Log in to reply
K. I've edited the problem.
Looking at your solution, I find it really hard to understand what you're doing, and it seems like there are several assumptions / mistakes that you make
Log in to reply
Log in to reply
Log in to reply
@Calvin Lin – Reading through your assumption again, that seems to be the case. I have edited that into the problem.
I can now believe that your answer is correct, but your solution still does not feel rigorous to me. I feel that a big assumption is " h A B C is integer if and only if A B C has an angle ≥ 1 2 0 ∘ ". I agree with the if part, but the only if part isn't immediately obvious to me.
Log in to reply
@Calvin Lin – Thank you for the insights! I really had trouble phrasing the problem, and I was happy that somehow, what I was trying to say (albeit incorrect, perhaps due to my poor command of the language and/or the concept) got through you. I just got the inspiration for my next problem!
Problem Loading...
Note Loading...
Set Loading...
Note that f ( P ) is at its minimum when P coincides with the Fermat point of the triangle.
Now, for f ( P ) to be an integer, we can set it such that P lies along the sides of the triangle A B C itself. This will only be possible when one of the interior angles is ≥ 1 2 0 ∘ , with P on its vertex. Now, the smallest integer triangle to have that is the 3 − 5 − 7 triangle.
The maximum value of f ( P ) can also be established in a similar way; since the distance cannot be maximized when P is inside the triangle, it has to be located on the triangle. Using the same triangle, it can be discovered that f ( P ) is maximum when P is on the vertex opposite the smallest side.
So, for the 3 − 5 − 7 triangle, being the smallest integer triangle to have a 1 2 0 ∘ angle, f ( P ) is minimum when P is at the vertex opposite the longest side. In this case, f ( P ) = 3 + 5 = 8 .
On the other hand, f ( P ) is maximum when P is at the vertex opposite the shortest side, making f ( P ) = 5 + 7 = 1 2 .
And that gives us the max ( f ( P ) ) − min ( f ( P ) ) = 1 2 − 8 = 4 .