29. (ROM 4) A flock of 155 birds sit down on a circle $C$. Two birds $P_{i}, P_{j}$ are mutually visible if $m\left(P_{i} P_{j}\right) \leq 10^{\circ}$. Find the smallest number of mutually visible pairs of birds. (One assumes that a position (point) on $C$ can be occupied simultaneously by several birds.)
29. Let $P_{i}$, sitting at the place $A$, and $P_{j}$ sitting at $B$, be two birds that can see each other. Let $k$ and $l$ respectively be the number of birds visible from $B$ but not from $A$, and the number of those visible from $A$ but not from
$B$. Assume that $k \geq l$. Then if all birds from $B$ fly to $A$, each of them will see $l$ new birds, but won't see $k$ birds anymore. Hence the total number of mutually visible pairs does not increase, while the number of distinct positions occupied by at least one bird decreases by one. Repeating this operation as many times as possible one can arrive at a situation in which two birds see each other if and only if they are in the same position. The number of such distinct positions is at most 35 , while the total number of mutually visible pairs is not greater than at the beginning. Thus the problem is equivalent to the following one:
(1) If $x_{i} \geq 0$ are integers with $\sum_{j=1}^{35} x_{j}=155$, find the least possible value of $\sum_{j=1}^{35}\left(x_{j}^{2}-x_{j}\right) / 2$.

If $x_{j} \geq x_{i}+2$ for some $i, j$, then the sum of $\left(x_{j}^{2}-x_{j}\right) / 2$ decreases (for $x_{j}-x_{i}-2$ ) if $x_{i}, x_{j}$ are replaced with $x_{i}+1, x_{j}-1$. Consequently, our sum attains its minimum when the $x_{i}$ 's differ from each other by at most 1 . In this case, all the $x_{i}$ 's are equal to either $[155 / 35]=4$ or $[155 / 35]+1=5$, where $155=20-4+15$ - 5 . It follows that the (minimum possible) number of mutually visible pairs is $20 \cdot \frac{4 \cdot 3}{2}+15 \cdot \frac{5 \cdot 4}{2}=270$.
Semond solution for (1). Considering the graph consisting of birds as vertices and pairs of mutually nonvisible birds as edges, we see that there is no complete 36-subgraph. Turan's theorem gives the answer immediately. (See problem (SL89-17).)