Maths Olympiad Prep

Library / /89 of 106

Geometry Difficulty 8.8 Shortlist Prove it China

In a convex quadrilateral ABCDABCD, the diagonal BDBD bisects neither the angle ABCABC nor the angle CDACDA. The point PP lies inside ABCDABCD and satisfies
PBC=DBA and PDC=BDA.\angle PBC = \angle DBA \text{ and } \angle PDC = \angle BDA.

Prove that ABCDABCD is a cyclic quadrilateral if and only if AP=CPAP = CP.

Solution

(i) Necessity.

Assume that ABCDABCD is a cyclic quadrilateral. Let the circle Γ\Gamma be the circumcircle of quadrilateral ABCDABCD. Extend BPBP and DPDP beyond PP to meet the circle Γ\Gamma at XX and YY respectively.

Since DBDB does not bisect ABC\angle ABC and PP lies inside ABCDABCD, it follows from PBC=DBA\angle PBC = \angle DBA that CX=AD\overline{CX} = \overline{AD}, DXD \neq X, and the points DD and XX lie in the same half-plane bounded by the line ACAC. Hence DXACDX \parallel AC. Similarly, BYB \neq Y and BYACBY \parallel AC.

The points DD, XX, AA, CC, BB, YY lie on the circle Γ\Gamma, as mentioned above. So the points DD and XX, the points AA and CC, the points BB and YY are symmetrical with respect to the perpendicular bisector ll of ACAC respectively.

Since P=DYBXP = DY \cap BX, then PP is on the line ll, or AP=CPAP = CP. This completes the proof of the necessity.

(ii) Sufficiency.

Lemma. Let ll be a fixed line and A,B,CA, B, C be fixed points such that AA and BB, CC lie in the different half-planes bounded by the line ll. Assume that the point XX lies on the line ll. Let α(X)\alpha(X) be the smallest angle of rotation from the line XAXA to the line ll anticlockwise. Let β(X)\beta(X) be the smallest angle of rotation from the line XCXC to the line XBXB anticlockwise. If α(X)=β(X)\alpha(X) = \beta(X), then XX is called a good point. Prove that there are at most two good points.

Proof of the lemma

We set up a coordinate system with the line ll as the xx-axis and the perpendicular of ll as the yy-axis.
Let A(a,b)A(a, b), B(c,d)B(c, d), C(e,f)C(e, f), X(x,0)X(x, 0). Then A=a+biA = a+bi, B=c+diB = c+di, C=e+fiC = e+fi, and X=xX = x. Hence
AX=ax+bi,(ax+bi)(cosα(X)+isinα(X))=(ax)cosα(X)bsinα(X)+[(ax)sinα(X)+bcosα(X)]i. \begin{aligned} A - X &= a - x + bi, \\ (a - x + bi)(\cos \alpha(X) + i\sin \alpha(X)) \\ &= (a - x)\cos \alpha(X) - b\sin \alpha(X) + [(a - x)\sin \alpha(X) + b\cos \alpha(X)]i. \end{aligned}

Rotate the line XAXA by α(X)\alpha(X) anticlockwise, coinciding with ll. So
(ax)cosα(X)+bcosα(X)=0(1) (a-x)\cos\alpha(X) + b\cos\alpha(X) = 0 \quad (1)

Moreover, since XC=ex+fi\vec{XC} = e-x+fi, XB=cx+di\vec{XB} = c-x+di, then XC\vec{XC} after being rotated by β(X)\beta(X) anticlockwise becomes
(ex+fi)(cosβ(X)+isinβ(X))=(ex)cosβ(X)fsinβ(X)+[(ex)sinβ(X)+fcosβ(X)]i (e-x+fi)(\cos\beta(X) + i\sin\beta(X)) = (e-x)\cos\beta(X) - f\sin\beta(X) + [(e-x)\sin\beta(X) + f\cos\beta(X)]i
which is parallel to XB\vec{XB}. Thus,
(cx)[(ex)sinβ(X)+fcosβ(X)]d[(ex)cosβ(X)fsinβ(X)]=0, (c-x)[(e-x)\sin\beta(X) + f\cos\beta(X)] - d[(e-x)\cos\beta(X) - f\sin\beta(X)] = 0,
and
[(cx)(ex)+df]sinβ(X)+[(cx)fd(ex)]cosβ(X)=0.(2) [(c-x)(e-x) + df]\sin\beta(X) + [(c-x)f - d(e-x)]\cos\beta(X) = 0. \quad (2)

Since sinθ\sin\theta and cosθ\cos\theta are not 0 at the same time, so
XX is a good point α(X)=β(X)\Leftrightarrow \alpha(X) = \beta(X) \Leftrightarrow the simultaneous equations in uu and vv.
{(ax)u+bv=0,[(cx)(ex)+df]u+[(cx)fd(ex)]v=0 \begin{cases} (a-x)u+bv=0, \\ [(c-x)(e-x)+df]u+[(c-x)f-d(e-x)]v=0 \end{cases}
have the non-zero solutions
b[(cx)(ex)+df]+(ax)[(cx)fd(ex)]=0(b+df)x2+(af+cfbcbeaded)x(b+df)x2+(af+cfbcbeaded)x+bce+bdf+adeacf=0. \begin{align*} & \Leftrightarrow b[(c-x)(e-x)+df] + (a-x)[(c-x)f - d(e-x)] = 0 \\ & \Leftrightarrow (b+d-f)x^2 + (af+cf-bc-be-ad-ed)x \\ & \phantom{\Leftrightarrow (b+d-f)x^2 + (af+cf-bc-be-ad-ed)x} + bce+bdf+ade-acf = 0. \end{align*}

Let g(x)=(b+df)x2+(af+cfbcbeaded)x+bce+bdf+adeacfg(x) = (b+d-f)x^2 + (af+cf-bc-be-ad-ed)x + bce+bdf+ade-acf. If b+df=0b+d-f=0, it follows from b0b \neq 0 that dfd \neq f. Hence BCBC and ll are not parallel. Let BCBC intersect ll at T(t,0)T(t, 0). We have that β(T)=0\beta(T) = 0 and α(T)>0\alpha(T) > 0. Hence TT is not a good point. This implies g(t)0g(t) \neq 0, so the equation g(x)=0g(x) = 0 has at most two solutions.

Hence there are at most two good points.

This completes the proof of the lemma.

Let the points AA, BB, CC, DD be arranged clockwise and AP=CPAP = CP. Let DD^* be the point such that AA, DD^*, CC, BB are concyclic, where DD^* lies on the ray BDBD. Since AP=CPAP = CP and BDBD bisects neither ABC\angle ABC nor ADC\angle ADC, BPBP intersects the perpendicular bisector of ACAC at the unique point PP.

Let DRD^*R be the ray satisfying CDR=ADB\angle CD^*R = \angle AD^*B and P=DRBPP^* = D^*R \cap BP.
Together with (i), we have that PA=PCP^*A = P^*C, or PP^* is the intersection point of ll and the perpendicular bisector of ACAC, so P=PP^* = P. It follows from CDR=ADB\angle CD^*R = \angle AD^*B that ADB=CDP\angle AD^*B = \angle CD^*P.

Replace ll, AA, BB, CC by BDBD, AA, CC, PP. Then BB, DD, DD^* are good points. Since BDB \neq D and BDB \neq D^*, D=DD = D^*. Hence AA, BB, CC, DD is concyclic.

This completes the proof of the sufficiency.

Solution II

We may assume without loss of generality that PP lies in the rectangles ABCABC and BCDBCD.

Figure 1

Assume that the quadrilateral ABCDABCD is cyclic. Let the lines BPBP and DPDP meet ACAC at KK and LL respectively. It follows from the given equalities and ACB=ADB\angle ACB = \angle ADB, ABD=ACD\angle ABD = \angle ACD that the triangles DABDAB, DLCDLC and CKBCKB are similar. This implies DLC=CKB\angle DLC = \angle CKB, so PLK=PKL\angle PLK = \angle PKL. Hence PK=PLPK = PL.

It follows from BDA=PDC\angle BDA = \angle PDC that ADL=BDC\angle ADL = \angle BDC. Since DAL=DBC\angle DAL = \angle DBC, the triangles ADLADL and BDCBDC are similar. Hence
ALBC=ADBD=KCBC, \frac{AL}{BC} = \frac{AD}{BD} = \frac{KC}{BC},
yielding AL=KCAL = KC. It follows from DLC=CKB\angle DLC = \angle CKB that ALP=CKP\angle ALP = \angle CKP. Moreover, since PK=PLPK = PL and AL=KCAL = KC, the triangles ALPALP and CKPCKP are congruent. Hence AP=CPAP = CP.

Want a route through all this instead of an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

Source: MathNet, licensed CC-BY-4.0. Statement and solution reproduced as published; topic and difficulty added by this site.