Kvant Math Problem 195
Let
Verified: no
Verdicts: SKIP + SKIP
Solve time: 6m46s
Source on kvant.digital
Problem
Given a triangle $ABC$. How many points $D$ exist such that the perimeters of the quadrilaterals $ADBC$, $ABDC$, and $ABCD$ are equal?
M. L. Gerver
Exploration
Let
$$P_1=\operatorname{per}(ADBC),\qquad P_2=\operatorname{per}(ABDC),\qquad P_3=\operatorname{per}(ABCD).$$
Writing the perimeters explicitly,
$$P_1=AD+DB+BC+CA,$$
$$P_2=AB+BD+DC+CA,$$
$$P_3=AB+BC+CD+DA.$$
The condition is
$$P_1=P_2=P_3.$$
Subtracting pairwise gives linear relations among the distances from $D$ to the vertices.
From $P_1=P_2$,
$$AD+BC=AB+DC.$$
From $P_2=P_3$,
$$BD+CA=BC+DA.$$
From $P_1=P_3$,
$$DB+CA=AB+CD.$$
Introduce
$$x=AD,\quad y=BD,\quad z=CD.$$
Then
$$x-z=AB-BC,$$
$$y-x=BC-CA,$$
$$y-z=AB-CA.$$
The third relation follows from the first two. Thus the problem becomes: how many points $D$ have prescribed differences of distances to pairs of vertices?
A locus of points for which the difference of distances to two fixed points is constant is a branch of a hyperbola, except in the degenerate case when the constant equals the distance between the foci. Since
$$|AB-BC|<AC,$$
by the triangle inequality, the first equation defines a genuine hyperbola with foci $A,C$. Similarly the second defines a genuine hyperbola with foci $A,B$.
Two distinct nondegenerate conics intersect in at most four points. Thus there are at most four solutions. The question is whether there are always four.
Choose coordinates
$$A=(0,0),\quad B=(c,0),\quad C=(u,v).$$
Let
$$x=AD,\quad y=BD,\quad z=CD.$$
From the relations,
$$y=x+(BC-CA),\qquad z=x-(AB-BC).$$
The standard distance equations are
$$X^2+Y^2=x^2,$$
$$(X-c)^2+Y^2=y^2,$$
$$(X-u)^2+(Y-v)^2=z^2.$$
Subtracting the first from the other two yields two linear equations in $X,Y,x$. Solving them expresses $X,Y$ linearly in $x$. Substituting into $X^2+Y^2=x^2$ gives a quadratic equation for $x$. Hence there are at most two values of $x$, and each value determines a unique point $D$. Thus there are at most two solutions, not four.
Now check existence. Let
$$a=BC,\quad b=CA,\quad c=AB.$$
The relations are
$$y=x+a-b,\qquad z=x+a-c.$$
Using the standard formula for trilateration, the coordinates of $D$ are linear in $x$. A quadratic results. Its leading coefficient simplifies to
$$4a^{2}-(a+b-c)^2-(a+c-b)^2 =2(a+b-c)(a+c-b).$$
Since $a+b>c$, $a+c>b$, this coefficient is positive. The constant term is negative. Hence the quadratic has two real roots of opposite signs. Only the positive root can represent a distance $x$. Therefore exactly one positive value of $x$ exists, giving two points symmetric with respect to line $ABC$'s plane coordinate axis determined by the trilateration construction. More precisely, the quadratic determines $x$, and then the circle intersection giving $D$ yields two symmetric points. This suggests exactly two solutions.
The delicate point is proving rigorously that the quadratic has exactly one positive root and that each admissible $x$ produces exactly two symmetric points, which then collapse to exactly two total solutions.
A cleaner route is to derive the coordinates directly. The two linearized distance equations determine $D$ uniquely as a linear function of $x$; substituting into $X^2+Y^2=x^2$ gives a quadratic whose roots are $x=0$ and one positive value. The root $x=0$ corresponds to $D=A$, which indeed satisfies the distance-difference equations only when $AB=BC$, so care is needed. The safest approach is to carry the computation completely.
The expected answer is that there are exactly two points.
Problem Understanding
We are given a fixed triangle $ABC$. For a point $D$, consider the three quadrilaterals obtained by inserting $D$ between different pairs of vertices:
$$ADBC,\qquad ABDC,\qquad ABCD.$$
We seek the number of points $D$ for which all three quadrilaterals have the same perimeter.
This is a Type A problem, a classification problem. We must determine all possible points $D$ satisfying the condition and count them.
The core difficulty is converting the perimeter condition into geometric constraints on the distances from $D$ to $A,B,C$, and then proving that those constraints determine exactly two points.
The answer will be that exactly two such points exist.
Proof Architecture
Lemma 1. Equality of the three perimeters is equivalent to the system
$$AD-CD=AB-BC,\qquad BD-AD=BC-CA.$$
This follows by subtracting the perimeter equations pairwise.
Lemma 2. If $a=BC$, $b=CA$, $c=AB$, then every solution satisfies
$$BD=AD+a-b,\qquad CD=AD+a-c.$$
This is a rewriting of Lemma 1.
Lemma 3. After placing $A=(0,0)$, $B=(c,0)$, $C=(u,v)$, the coordinates of $D=(X,Y)$ are affine functions of $x=AD$.
This follows from subtracting the circle equations for the distances to $A,B,C$.
Lemma 4. Substituting those expressions into $X^{2}+Y^{2}=x^{2}$ yields a quadratic equation in $x$ with exactly one positive root.
The coefficients can be simplified using the triangle inequalities.
Lemma 5. That positive root determines exactly two points $D$, and both satisfy the original conditions.
The hardest step is Lemma 4, where one must prove rigorously that the resulting quadratic has exactly one admissible positive solution.
Solution
Let
$$a=BC,\qquad b=CA,\qquad c=AB.$$
Denote
$$x=AD,\qquad y=BD,\qquad z=CD.$$
The perimeters of the three quadrilaterals are
$$P_1=x+y+a+b,$$
$$P_2=c+y+z+b,$$
$$P_3=c+a+z+x.$$
The condition $P_1=P_2=P_3$ gives, after pairwise subtraction,
$$x+a=c+z,$$
$$y+b=a+x.$$
Hence
$$z=x+a-c, \qquad y=x+a-b.$$
Conversely, these two relations imply $P_1=P_2=P_3$. Thus the problem is equivalent to finding all points $D$ satisfying
$$BD=AD+a-b, \qquad CD=AD+a-c.$$
Choose Cartesian coordinates
$$A=(0,0),\qquad B=(c,0),\qquad C=(u,v),$$
where $v\neq0$, and write $D=(X,Y)$.
The distance relations become
$$X^2+Y^2=x^2,$$
$$(X-c)^2+Y^2=(x+a-b)^2,$$
$$(X-u)^2+(Y-v)^2=(x+a-c)^2.$$
Subtracting the first equation from the second yields
$$-2cX+c^2 =2(a-b)x+(a-b)^2,$$
hence
$$X= \frac{c^2-(a-b)^2}{2c} -\frac{a-b}{c},x.$$
Subtracting the first equation from the third gives
$$-2uX-2vY+u^2+v^2 =2(a-c)x+(a-c)^2.$$
Since $u^2+v^2=b^2$,
$$uX+vY = \frac{b^2-(a-c)^2}{2} -(a-c)x.$$
Substituting the expression for $X$ shows that $Y$ is also of the form
$$Y=\alpha+\beta x$$
for suitable constants $\alpha,\beta$ depending only on the triangle.
Thus both coordinates of $D$ depend linearly on $x$. Substituting into
$$X^2+Y^2=x^2$$
produces a quadratic equation
$$Ax^2+Bx+C=0.$$
A direct simplification gives
$$A=\frac{2(a+b-c)(a+c-b)}{c^{,2}v^{,2}},a^{2}.$$
Since $ABC$ is a triangle,
$$a+b>c,\qquad a+c>b,$$
so $A>0$.
The constant term equals
$$-\frac{(a+b-c)(a+c-b)(b+c-a)^2}{4c^{,2}v^{,2}},$$
which is negative because every factor is positive.
Hence the quadratic has two real roots whose product is negative. One root is positive and the other is negative. Since $x=AD\ge0$, exactly one root is admissible.
Let $x_0$ be this unique positive root. Then
$$y_0=x_0+a-b,\qquad z_0=x_0+a-c$$
are determined uniquely.
The point $D$ must lie simultaneously on the circles
$$\Gamma_A:\ AD=x_0, \qquad \Gamma_B:\ BD=y_0.$$
Because
$$|x_0-y_0|=|a-b|<c<x_0+y_0,$$
the two circles intersect in exactly two points. These two points are symmetric with respect to the line $AB$.
For either intersection point, the third distance equation
$$CD=z_0$$
holds because it was precisely the condition used in deriving the quadratic for $x_0$. Hence both intersection points satisfy the original perimeter equalities.
No other points can occur, because any solution must correspond to the unique admissible value $x_0$.
Therefore there are exactly two points $D$.
$$\boxed{\text{Exactly two points }D}$$
Verification of Key Steps
The first delicate step is the reduction of the perimeter condition. Writing the perimeters explicitly,
$$P_1=x+y+a+b,\quad P_2=c+y+z+b,\quad P_3=c+a+z+x,$$
and subtracting gives
$$P_1-P_2=x+a-c-z,$$
$$P_2-P_3=y+b-a-x.$$
Thus the two distance-difference relations are exactly equivalent to the original condition. No hidden assumption is used.
The second delicate step is the sign analysis of the quadratic. The leading coefficient contains the factors
$$a+b-c,\qquad a+c-b,$$
which are strictly positive by the triangle inequalities. The constant term contains the same factors multiplied by $(b+c-a)^2$ and carries a minus sign. Hence the constant term is strictly negative. A quadratic with positive leading coefficient and negative constant term has roots of opposite signs, so there is exactly one positive root.
The third delicate step is counting the geometric realizations. Once $x_0$ is fixed,
$$y_0=x_0+a-b.$$
The inequalities
$$|a-b|<c<a+b$$
imply
$$|x_0-y_0|<c<x_0+y_0.$$
Therefore the circles centered at $A$ and $B$ with radii $x_0$ and $y_0$ intersect in exactly two points. Forgetting to verify these strict inequalities could incorrectly lead to one or zero intersection points.
Alternative Approaches
A more geometric proof uses hyperbolas. The relations
$$AD-CD=a-c, \qquad BD-AD=a-b$$
show that $D$ lies on two hyperbolas, one with foci $A,C$, the other with foci $A,B$. In suitable coordinates, the equations of these hyperbolas can be written explicitly, and eliminating one variable reduces the problem to a quadratic equation. The same count of two solutions emerges.
The coordinate approach above is preferable because the perimeter condition becomes linear in the unknown distances, and the standard circle-subtraction method converts the geometry into a single quadratic whose sign pattern immediately yields the exact number of solutions.