Maths Olympiad Prep

Track / Stage 6 / 206 of 400 #1206 of 1964

Problem 1206

National olympiad, first round
Algebra Difficulty 6.3 Prove it

Theorem Let A1,A2,,AnA_{1}, A_{2}, \cdots, A_{n} be a plane convex nn-sided polygon, with area Δ\Delta, and side lengths AiAi+1=aiA_{i} A_{i+1}=a_{i} (i=1,2,,n,n3\left(i=1,2, \cdots, n, n \geqslant 3\right., and assume An+1=A1A_{n+1}=A_{1}, the same below), and θi(0,π)(i=1,2,,n\theta_{i} \in(0, \pi)(i=1,2, \cdots, n, n3)n \geqslant 3), and i=1nθi=π,n3\sum_{i=1}^{n} \theta_{i}=\pi, n \geqslant 3, then
i=1ncotθiai24Δ\sum_{i=1}^{n} \cot \theta_{i} a_{i}^{2} \geqslant 4 \Delta

Equality holds in (1) if and only if the convex nn-sided polygon is inscribed in a circle, and
a1sinθ1=a2sinθ2==ansinθn=2R\frac{a_{1}}{\sin \theta_{1}}=\frac{a_{2}}{\sin \theta_{2}}=\cdots=\frac{a_{n}}{\sin \theta_{n}}=2 R
( RR is the radius of the circle).

This one wants a proof. Work it on paper, then read the official solution and mark yourself. Be honest about it: the record is only any use to you if it is.

Official solution

None

Translate the text above into English, please retain the original text's line breaks and format, and output the translation result directly.

Note: The provided instruction is a meta-instruction and not part of the text to be translated. Since the text to be translated is "None", the translation is also "None". Here is the formatted output as requested:

None

Source: NuminaMath-1.5, licensed Apache-2.0. Statement and solution reproduced as published; topic, difficulty and ordering added by this site.