Question

Difficulty: Very hardTriangle Properties and Angle Theorems

In ABC\triangle ABC, the side lengths are AB=12AB = 12, BC=15BC = 15, and AC=18AC = 18. A point PP lies strictly inside ABC\triangle ABC. If the lengths of the segments BPBP and CPCP are both integers, what is the maximum possible value of the sum of these two lengths?

  1. A
    26
  2. B
    27
  3. 28Answer
  4. D
    29
  5. E
    30

Answer

28
The correct answer is 28. According to the properties of triangles, for any point PP strictly inside ABC\triangle ABC, the sum of the interior segments is strictly less than the sum of the other two sides: BP+CP<AB+AC=12+18=30BP + CP < AB + AC = 12 + 18 = 30. Since BPBP and CPCP are integers, we check the boundary where PP lies on the side ACAC at an integer distance CP=zCP = z from CC. Applying Stewart's Theorem, the boundary length BP=yboundBP = y_{bound} is z222.5z+225\sqrt{z^2 - 22.5z + 225}. For the largest possible integer value z=17z = 17, the boundary value is approximately 11.4711.47. Because the point must lie strictly inside the triangle, BPBP must be strictly less than this boundary, so the maximum integer value for BPBP is 11. This yields a maximum sum of 11+17=2811 + 17 = 28. Lower integer values of zz yield smaller maximum sums (for example, if z=16z = 16, the boundary is exactly 11, so BPBP can be at most 10, giving a sum of 26).

Step-by-Step Solution

1
Apply the interior point triangle inequality theorem.
For any point PP strictly inside ABC\triangle ABC, the sum of the distances to two vertices is strictly less than the sum of the other two sides: BP+CP<AB+ACBP + CP < AB + AC.
This establishes the theoretical upper bound for the sum of the two segment lengths.
2
Calculate the theoretical upper bound.
Since AB=12AB = 12 and AC=18AC = 18, we have BP+CP<12+18=30BP + CP < 12 + 18 = 30. Since BPBP and CPCP must be integers, the sum BP+CPBP + CP can be at most 29.
This sets the initial integer limit before evaluating if it is geometrically possible.
3
Analyze the boundary conditions for integer lengths using Stewart's Theorem.
Let CP=zCP = z and BP=yBP = y, where yy and zz are integers. As PP approaches the side ACAC, the boundary value yboundy_{bound} represents the distance from BB to a point on ACAC at distance zz from CC. Using Stewart's Theorem, this boundary satisfies: ybound2=z222.5z+225y_{bound}^2 = z^2 - 22.5z + 225. Since PP is strictly inside the triangle, yy must be strictly less than yboundy_{bound}.
This provides the mathematical relationship determining whether a point is inside the triangle for any given integer length of one segment.
4
Test the maximum possible integer value for zz to maximize the sum y+zy + z.
Since PP is strictly inside, zz must be strictly less than AC=18AC = 18, so the maximum integer for zz is 17. For z=17z = 17, the boundary value is ybound=17222.5(17)+225=131.511.47y_{bound} = \sqrt{17^2 - 22.5(17) + 225} = \sqrt{131.5} \approx 11.47. Since y<yboundy < y_{bound}, the maximum integer value for yy is 11. This yields a maximum sum of 11+17=2811 + 17 = 28.
This determines the actual maximum integer sum that can be geometrically realized within the triangle.

Key Concept

Triangle Inequality Theorem and Interior Point Properties
Rate this question