ABCD is a cyclic quadrilateral. A circle whose center is on the side AB touches the other three sides. Show that AB=AD+BC. What is the maximum possible area of ABCD in terms of ∣AB∣ and ∣CD∣?
Solution
Solution:
Let the circle have center O on AB and radius r. Let ∠OAD=θ, ∠OBC=φ. Since ABCD is cyclic, ∠ADC=180∘−φ, so ∠ODA=90∘−φ/2.
If AD touches the circle at X, then AD=AX+XD=rcotθ+rtan(φ/2). Similarly, BC=rcotφ+rtan(θ/2). Put t=tan(θ/2). Then cotθ=(1−t2)/2t, so cotθ+tan(θ/2)=2t1+t2=sinθ1. Similarly for φ, so AD+BC=sinθr+sinφr=AO+OB=AB.
Suppose AD and BC meet at H (we deal below with the case where they are parallel). Then HCD and HAB are similar, so area HCD=(AB2CD2)area HAB and area ABCD=(1−AB2CD2)area HAB. Also CDAB=HCHA=HDHB=HC+HDHA+HB=HB−BC+HA−DAHA+HB=HA+HB−ABHA+HB. Hence HA+HB=AB−CDAB2, which is fixed. Now for fixed HA+HB we maximise the area of HAB by taking HA=HB and hence AD=BC.
Put h=CD, k=AB. So kcosθ+h=k. Hence cosθ=1−h/k. Hence sinθ=2h/k−h2/k2. So area ABCD=21(h+k)⋅21ksinθ=(h/2+k/2)hk/2−h2/4(∗).
If AD and BC are parallel then A and B must lie on the circle, so that ∠DAB=∠ABC=90∘. But ABCD is cyclic, so it must be a rectangle. Hence AB=CD and area ABCD=k2/2. In this case (∗) still gives the correct answer.
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 reproduced verbatim; metadata (topic, difficulty) added by this project.