Skip to main content
2 of 3
added 245 characters in body
Alex Kruckman
  • 5k
  • 2
  • 24
  • 33

Suppose we have sets $A,B,C$ which are $n$-equidistant.

Then $n=|A\triangle C|=|(A\triangle B)\triangle (B\triangle C)|$. But $A\triangle B$ and $B\triangle C$ are finite sets of size $n$, and the size of the symmetric difference of two finite sets of equal size is always even.

Why? If $|X|=|Y|=n$, then $|X\triangle Y|=|X\setminus (X\cap Y)|+|Y\setminus (X\cap Y)| = 2(n-|X\cap Y|)$.

Thus $M_n=2$ whenever $n$ is odd.

Alex Kruckman
  • 5k
  • 2
  • 24
  • 33