Maths Olympiad Prep

Library / /104 of 520

Combinatorics Difficulty 6.5 National olympiad Find the answer

Let a,ba, b be distinct real numbers and k,mk,m be positive integers k+m=n3,k2m,m2kk + m = n \ge 3, k \le 2m, m \le 2k. Consider sequences x1,,xnx_1,\dots , x_n with the following properties:
(i) kk terms xix_i, including x1x_1, are equal to aa;
(ii) mm terms xix_i, including xnx_n, are equal to bb;
(iii) no three consecutive terms are equal.
Find all possible values of xnx1x2+x1x2x3++xn1xnx1x_nx_1x_2 + x_1x_2x_3 + \cdots + x_{n-1}x_nx_1.

Solution

1. **Substitute m m with nk n - k in the inequalities k2m k \leq 2m and m2k m \leq 2k :**

Given k+m=n k + m = n , we can replace m m with nk n - k . Thus, the inequalities become:
k2(nk)andnk2k k \leq 2(n - k) \quad \text{and} \quad n - k \leq 2k
Simplifying these inequalities:
k2n2k    3k2n    k2n3 k \leq 2n - 2k \implies 3k \leq 2n \implies k \leq \frac{2n}{3}
nk2k    n3k    kn3 n - k \leq 2k \implies n \leq 3k \implies k \geq \frac{n}{3}

2. **Determine the range of k k :**

Since k k is an integer, it can range from n3 \lceil \frac{n}{3} \rceil to 2n3 \lfloor \frac{2n}{3} \rfloor , inclusive.

3. **Analyze the sum xnx1x2+x1x2x3++xn1xnx1 x_nx_1x_2 + x_1x_2x_3 + \cdots + x_{n-1}x_nx_1 :**

Each term in the sum is either a2b a^2b or ab2 ab^2 due to condition (iii) that no three consecutive terms are equal. Let y y be the number of terms a2b a^2b and ny n - y be the number of terms ab2 ab^2 . Therefore, the sum can be expressed as:
(a2b)y+(ab2)(ny) (a^2b)y + (ab^2)(n - y)

4. **Count the number of a a 's in the sum:**

Each a a is counted three times in the sum. Since there are k k terms equal to a a , the total number of a a 's in the sum is 3k 3k . Thus, we have:
2y+(ny)=3k    y=3kn 2y + (n - y) = 3k \implies y = 3k - n

5. Determine the possible values for the sum:

Since y=3kn y = 3k - n and k k ranges from n3 \lceil \frac{n}{3} \rceil to 2n3 \lfloor \frac{2n}{3} \rfloor , the number of possible values for y y is equal to the number of possible values for k k . Therefore, the number of possible values for the sum is:
2n3n3+1 \lfloor \frac{2n}{3} \rfloor - \lceil \frac{n}{3} \rceil + 1

Want a route through all this instead of an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

Source: NuminaMath-1.5, licensed Apache-2.0. Statement and solution reproduced as published; topic and difficulty added by this site.