# 2020 AMC 12B Problems/Problem 23

## Problem

How many integers $n \geq 2$ are there such that whenever $z_1, z_2, ..., z_n$ are complex numbers such that $$|z_1| = |z_2| = ... = |z_n| = 1 \text{ and } z_1 + z_2 + ... + z_n = 0,$$ then the numbers $z_1, z_2, ..., z_n$ are equally spaced on the unit circle in the complex plane? $\textbf{(A)}\ 1 \qquad\textbf{(B)}\ 2 \qquad\textbf{(C)}\ 3 \qquad\textbf{(D)}\ 4 \qquad\textbf{(E)}\ 5$

## Solutions

### Solution 1

For $n=2$, we see that if $z_{1}+z_{2}=0$, then $z_{1}=-z_{2}$, so they are evenly spaced along the unit circle.

For $n=3$, WLOG, we can set $z_{1}=1$. Notice that now $\Re(z_{2}+z_{3})=-1$ and $\Im\{z_{2}\}=-\Im\{z_{3}\}$. This forces $z_{2}$ and $z_{3}$ to be equal to $e^{i\frac{2\pi}{3}}$ and $e^{-i\frac{2\pi}{3}}$, meaning that all three are equally spaced along the unit circle.

We can now show that we can construct complex numbers when $n\geq 4$ that do not satisfy the conditions in the problem.

Suppose that the condition in the problem holds for some $n=k$. We can now add two points $z_{k+1}$ and $z_{k+2}$ anywhere on the unit circle such that $z_{k+1}=-z_{k+2}$, which will break the condition. Now that we have shown that $n=2$ and $n=3$ works, by this construction, any $n\geq 4$ does not work, making the answer $\boxed{\textbf{(B)} 2}$.

-Solution by Qqqwerw

### Solution 2

(for people not used to notation)

Note: I personally don't think the question was very well worded; it should explicitly state that if the first two conditions/equations are satisfied, then the final condition MUST be satisfied as well. The question can be misinterpreted as "how many different sizes of a list of complex numbers exist such that at least one satisfies the conditions" (in which case the answer would be infinitely many).

The problem asks for the number of list lengths that satisfy the three conditions given; i.e. how many different sizes can the list of complex numbers be such that the elements in the list always satisfy the conditions. This means that for a list of length 3, for example, all possible lists have to satisfy the conditions. If even one variation of a list of length 3 does not satisfy the conditions, then 3 is not an acceptable value of n.

A complex number can be written in the form $a + bi$ where $a$ represents the real part and $b$ represents the coefficient of the imaginary part. If a complex number is plotted on the complex plane, then $a$ becomes the x-coordinate, and $b$ becomes the y-coordinate.

The first condition states that the absolute value of each complex number is equal to 1; i.e. the point (a, b) is a distance of one from the origin. If all of the complex numbers are a distance of 1 from the origin, they must all be on the unit circle. This condition simply allows us to be able to check condition 3, think of it as a sort of "given".

The second condition states that the sum of all the complex numbers is equal to 0. Therefore, the sum of all the x-coordinates and the y-coordinates will yield 0. However, we know that real numbers and complex numbers cannot be simplified together (assuming that $a$ and $b$ are real numbers). This means that the real parts of the complex numbers, i.e. the x-coordinates, must sum to 0 by themselves. The same is true for the imaginary parts (the y-coordinates).

The third condition states that the complex numbers must be evenly spaced along the unit circle. This condition can be used to determine acceptable values of x.

Start with $n = 2$. If we have 2 complex numbers, in order to satisfy the second condition, the x coordinates must be opposites. The same is true for the y-coordinates. After drawing (or imagining) we find that the two points are directly across from one another on the unit circle. Upon further thought, we find that whenever we have an even number of points, if they are paired up in this way, they will always satisfy the first and second conditions. However, it is possible to arrange these pairs of points (whenever we have at least 2 pairs) such as the points are not evenly spaced out. Therefore, any even value of $n$ greater than 2 will not work (since we proved that not all variations satisfy the last condition).

Now we consider $n = 3$. It is much easier to consider 2 numbers instead of 3, so we will assume that $z_{1}=1$, or $(1, 0)$ (we can do this because a circle has rotational symmetry). Since the y-coordinate of the first number is 0, the y-coordinates of the other 2 numbers must be opposites. Since the x coordinate of the first number is 1, the x-coordinates of the other 2 numbers must sum to -1. Using this knowledge, we find that the coordinates of the other 2 numbers are $-\frac{1}{2}$ $+$ $\sqrt{3}$ and $-\frac{1}{2}$ $-$ $\sqrt{3}$

After calculating angle measurements, we see that the 3 points are, indeed, equally spaced apart. Therefore 3 is an acceptable value of $n$ (all variations of $n = 3$ are simply rotations of this specific case, and therefore satisfy all of the conditions).

Lastly we consider the odd numbers. If we start with the same arrangement of points as above, we see that adding pairs of opposite points will continue to satisfy conditions 1 and 2, but NOT ALWAYS condition 3. Therefore, any odd number greater than 3 is not an acceptable value of $n$.

So we have $n = 2$ and $n = 3$ for a total of 2 possibilities $\rightarrow$ $\boxed{B}$

## Video Solution

The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions. 