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 4 of 5: Even nn is impossible: a pigeonhole argument
In plain words

Too many pairs must share too few possible "witness" points, so some point ends up equidistant from three others.

(n2)=n(n−1)2 pairs,⌈n(n−1)/2n⌉=n2 for even n\binom n2 = \tfrac{n(n-1)}2 \text{ pairs},\quad \Big\lceil \tfrac{n(n-1)/2}{n}\Big\rceil=\tfrac n2 \text{ for even } n
Detailed analysis

Suppose VV is balanced, center-free, and ∣V∣=n|V|=n is even. For each of the (n2)=n(n−1)2\binom n2=\frac{n(n-1)}2 unordered pairs {A,B}⊂V\{A,B\}\subset V, fix one witness C(A,B)∈VC(A,B)\in V with C(A,B)A=C(A,B)BC(A,B)A=C(A,B)B. These n(n−1)2\frac{n(n-1)}2 pairs are distributed among the nn points of VV as possible witnesses, so by pigeonhole some point PP witnesses at least ⌈n(n−1)/2n⌉=⌈n−12⌉=n2\big\lceil\frac{n(n-1)/2}{n}\big\rceil=\big\lceil\frac{n-1}2\big\rceil=\frac n2 pairs (the last equality uses that nn is even, so n−1n-1 is odd).