Problem 1733

1. Initial Setup and Definitions:
- Let $n$ be a natural number and consider a circle with circumference $n$.
- On the circle, in a clockwise direction, numbers $0, 1, 2, \ldots, n-1$ are written, each at equal distances.
- Each number is colored either red or blue, with at least one number of each color.
- There exists a set $S \subsetneq \{0, 1, 2, \ldots, n-1\}$ with $|S| \geq 2$ such that if $(x, y)$ is a circle sector with endpoints of distinct colors and $y - x \in S$, then $y \in S$.

2. Claim:
- We claim that there exists a divisor $d$ of $n$ different from $1$ and $n$ such that if $(x, y)$ are different points of distinct colors and their distance is divisible by $d$, then both $x$ and $y$ are divisible by $d$.

3. Basic Additive Number Theory:
- For any set of integers $\{s_1, s_2, \ldots, s_{|S|}\}$ such that $\gcd(s_1, s_2, \ldots, s_{|S|}, n) = d$, we can find coefficients $c_1, c_2, \ldots, c_{|S|}$ such that:
$$\sum_{i=1}^{|S|} c_i s_i \equiv d \pmod{n}$$
- This implies that for $d \neq 1$, $x$ and $x + d$ must be the same color for every $d \neq x$.

4. Induction Proof:
- Base case: For $|S| = 1$, this is just the Euclidean algorithm.
- Inductive step: Assume it is true for $k = |S|$. This means we can find coefficients $c_1, \ldots, c_{|S|}$ such that:
$$\sum_{i=1}^{|S|} c_i s_i \equiv d_S \pmod{n}$$
where $d_S$ is the gcd of $S = \{s_1, \ldots, s_{|S|}\}$.
- For $k = |S| + 1$, let the new set $S' = \{s_1, \ldots, s_{|S|}\} \cup \{t\}$. The gcd of the new set is $(d_S, t) = d_{S'}$. By the Euclidean algorithm, we can find coefficients $l$ and $m$ such that:
$$ld_S + mt = d_{S'}$$
- Setting $c_i' = l \cdot c_i$ and $c_{|S|+1}' = m$, we verify that the claim holds true.

5. Extremal Chaining:
- Consider the remaining numbers (attacking numbers) in the set $E = \{0, 1, \ldots, n-1\} - S$.
- We show that $E$ can be divided into two sets $E_A$ and $E_B$ which behave similarly to $A$ and $B$.

6. Chaining Down:
- If $e \in E_A$, then $e - b$ (for $b \in B$) also belongs to $E_A$, and their sizes are equal.
- This is proven by considering the minimal representation of $e$ and showing that it can be chained down to $s_1$.

7. Set Theory Argument:
- If $a \in A$ and $b \in B$, then $a + b$ must not be an attacking number, or else it would lead to a contradiction.
- This implies that all members of $E$ must be of unison color.

8. Final Argument:
- Suppose there exists some $d \mid n$ with $d \neq n$ such that $S + d = S$.
- The minimal $d'$ which satisfies this equation will work for the problem.
- If not, then all numbers from $\{0, 1, \ldots, n-1\} - \{0\}$ have the same color, contradicting the problem statement.

9. Conclusion:
- We have shown that there exists a divisor $d$ of $n$ different from $1$ and $n$ such that if $(x, y)$ are different points of distinct colors and their distance is divisible by $d$, then both $x$ and $y$ are divisible by $d$.

$\blacksquare$