Browse · MathNet
Print66th Belarusian Mathematical Olympiad
Belarus counting and probability
Problem
Vertices of a regular -gon are marked on a circumference. Integer numbers are placed at the vertices such that the difference of any two adjacent numbers equals or . At a moment, simultaneously, the half-sums of each pair of the adjacent numbers are placed at the midpoints of the arcs subtending the corresponding sides of the -gon. Find all possible values of for which after some such moves there exist a pair of opposite points, among points thus obtained, with the same numbers at them. (M. Karpuk)
Solution
Answer: all even . The following example shows that does not satisfy the problem condition. We number clockwise the vertices of the -gon as and place the number at the vertex . Since is odd, the pairs of antipodal points have the form «vertex-midpoint of an arc». But the integer numbers are placed at the vertices while the fractional numbers are placed at the midpoints of all arcs (except for the arc at the midpoint of which the number is placed). Show that for there exist antipodal points with the same numbers. We number clockwise the vertices of the -gon as , and let be the numbers at these vertices, respectively. For convenience we assume that and . Consider the numbers The absolute value of the difference between any two adjacent terms of sequence (1) is less than or equal to 2. Indeed, since, by condition, , for all and . If there is zero between the terms of (1), then there are antipodal points with the same numbers. Suppose that there is no zero in sequence (1). Since the first and the last terms of (1) have different signs (their sum is equal to 0), there are two adjacent terms and with different signs. Since all terms of (1) are integer, 0 does not belongs to (1), and (2) holds, we see that exactly one of these two adjacent numbers is equal to 1 while the other is equal to -1. Therefore, their sum , i.e., . Hence the numbers placed at the antipodal points (midpoints of the arcs and ) are equal. Thus all even satisfy the problem condition.
Final answer
all even n
Techniques
Invariants / monovariantsIntegers