MathLabs

Problem 3

Let P=A1A2⋯AkP=A_1A_2\cdots A_k be a convex polygon in the plane. The vertices A1,A2,…,AkA_1,A_2,\dots,A_k have integer coordinates and lie on a circle. Let SS be the area of PP. An odd positive integer nn is given such that the square of the length of each side of PP is an integer divisible by nn. Prove that 2S2S is an integer divisible by nn.
Step 2 of 5: An inversive generalized Ptolemy relation
In plain words

Inverting the polygon at one of its own vertices turns the cyclic polygon into a set of collinear image points, and Ptolemy's inequality on the original circle becomes an exact linear relation among the inverted distances.

A1A2OA1⋅OA2+A2A3OA2⋅OA3+⋯+AkA1OAk⋅OA1=2⋅A1A2⋯Ai^⋯⋯\frac{A_1A_2}{OA_1\cdot OA_2}+\frac{A_2A_3}{OA_2\cdot OA_3}+\dots+\frac{A_kA_1}{OA_k\cdot OA_1}=2\cdot\frac{A_1A_2\cdots\widehat{A_i}\cdots}{\cdots}
Detailed analysis

Suppose for contradiction the statement fails for some (k+1)(k+1)-gon A1⋯Ak+1A_1\cdots A_{k+1} (all sides' squared lengths divisible by pep^e) with kk minimal among counterexamples, so every diagonal fails to be divisible by pep^e in the same squared sense (otherwise a diagonal would split the polygon into two smaller cyclic polygons with all relevant squared lengths divisible by pep^e, to which the inductive hypothesis on smaller kk would apply). Write O=Ak+1O=A_{k+1} and invert the plane at OO with radius 11. Since inversion sends the circumcircle of the AiA_i to a line, the images of A1,…,AkA_1,\dots,A_k become collinear, and the identity A1A2OA1⋅OA2+A2A3OA2⋅OA3+⋯+Ak−1AkOAk−1⋅OAk=A1AkOA1⋅OAk\frac{A_1A_2}{OA_1\cdot OA_2}+\frac{A_2A_3}{OA_2\cdot OA_3}+\dots+\frac{A_{k-1}A_k}{OA_{k-1}\cdot OA_k}=\frac{A_1A_k}{OA_1\cdot OA_k} (a telescoping sum of inverted-distance segments along that line) is exactly a generalized Ptolemy relation for the inverted points.