MathLabs

Problem 1

We say that a finite set SS of points in the plane is balanced if, for any two different points AA and BB in SS, there is a point CC in SS such that AC=BCAC=BC. We say that SS is center-free if for any three different points AA, BB, CC in SS, there is no point PP in SS such that PA=PB=PCPA=PB=PC. (a) Show that for all integers n≥3n\ge3, there exists a balanced set consisting of nn points. (b) Determine all integers n≥3n\ge3 for which there exists a balanced center-free set consisting of nn points.
Step 1 of 5: Balanced sets of every odd size
In plain words

An equilateral triangle is itself balanced, so gluing several of them at a shared vertex should stay balanced.

V={O,A1,B1,…,Ak,Bk},△OAiBi equilateralV=\{O,A_1,B_1,\dots,A_k,B_k\},\quad \triangle OA_iB_i \text{ equilateral}
Detailed analysis

Fix a circle with center OO and radius rr. For i=1,…,ki=1,\dots,k choose points Ai,BiA_i,B_i on the circle so that △OAiBi\triangle OA_iB_i is equilateral, and let V={O,A1,B1,…,Ak,Bk}V=\{O,A_1,B_1,\dots,A_k,B_k\}, a set of 2k+12k+1 points. Every point other than OO lies at distance rr from OO, so for two such points Ai,AjA_i,A_j we may take C=OC=O. For the pair (O,Ai)(O,A_i), the third vertex BiB_i satisfies BiO=BiAiB_iO=B_iA_i because △OAiBi\triangle OA_iB_i is equilateral. Hence VV is balanced, and ∣V∣=2k+1|V|=2k+1 ranges over every odd number ≥3\ge 3 as k=1,2,…k=1,2,\dots.