Unofficial archive — problems, solutions & results © IMC, reproduced with permission.

IMC / 2012 / Problems / Day 2, P9

IMC 2012 · Day 2 · P9

very hard

Let n2n \ge 2 be an integer. Find all real numbers aa such that there exist real numbers x1x_1, …, xnx_n satisfying x1(1x2)=x2(1x3)==xn1(1xn)=xn(1x1)=a.(1)\tag{1} x_1 (1 - x_2) = x_2 (1 - x_3) = \dots = x_{n-1} (1 - x_n) = x_n (1 - x_1) = a.

(Proposed by Walther Janous and Gerhard Kirchner, Innsbruck)

Solution (official)

Throughout the solution we will use the notation xn+1=x1x_{n+1} = x_1.

We prove that the set of possible values of aa is (,14]{14cos2kπn ; kN, 1k<n2}.\left( -\infty, \frac{1}{4} \right] \cup \left\{ \frac{1}{4 \cos^2 \frac{k\pi}{n}}\ ;\ k \in \mathbb{N},\ 1 \le k < \frac{n}{2} \right\}. In the case a14a \le \frac{1}{4} we can choose x1x_1 such that x1(1x1)=ax_1 (1 - x_1) = a and set x1=x2==xnx_1 = x_2 = \dots = x_n. Hence we will now suppose that a>14a > \frac{1}{4}.

The system (1) gives the recurrence formula xi+1=φ(xi)=1axi=xiaxi,i=1,,n.x_{i+1} = \varphi(x_i) = 1 - \frac{a}{x_i} = \frac{x_i - a}{x_i}, \quad i = 1, \dots, n. The fractional linear transform φ\varphi can be interpreted as a projective transform of the real projective line R{}\mathbb{R} \cup \{\infty\}; the map φ\varphi is an element of the group PGL2(R)PGL_2(\mathbb{R}), represented by the linear transform M=(1a10)M = \begin{pmatrix} 1 & -a \\ 1 & 0 \end{pmatrix}. (Note that detM0\det M \ne 0 since a0a \ne 0.) The transform φn\varphi^n can be represented by MnM^n. A point [u,v][u, v] (written in homogenous

coordinates) is a fixed point of this transform if and only if (u,v)T(u, v)^T is an eigenvector of MnM^n. Since the entries of MnM^n and the coordinates u,vu, v are real, the corresponding eigenvalue is real, too.

The characteristic polynomial of MM is x2x+ax^2 - x + a, which has no real root for a>14a > \frac{1}{4}. So MM has two conjugate complex eigenvalues λ1,2=12(1±4a1i)\lambda_{1,2} = \frac{1}{2} \left( 1 \pm \sqrt{4a - 1}\, i \right). The eigenvalues of MnM^n are λ1,2n\lambda_{1,2}^n, they are real if and only if argλ1,2=±kπn\arg \lambda_{1,2} = \pm \frac{k\pi}{n} with some integer kk; this is equivalent with ±4a1=tankπn,\pm \sqrt{4a - 1} = \tan \frac{k\pi}{n}, a=14(1+tan2kπn)=14cos2kπn.a = \frac{1}{4} \left( 1 + \tan^2 \frac{k\pi}{n} \right) = \frac{1}{4 \cos^2 \frac{k\pi}{n}}. If argλ1=kπn\arg \lambda_1 = \frac{k\pi}{n} then λ1n=λ2n\lambda_1^n = \overline{\lambda_2^n}, so the eigenvalues of MnM^n are equal. The eigenvalues of MM are distinct, so MM and MnM^n have two linearly independent eigenvectors. Hence, MnM^n is a multiple of the identity. This means that the projective transform φn\varphi^n is the identity; starting from an arbitrary point x1R{}x_1 \in \mathbb{R} \cup \{\infty\}, the cycle x1,x2,,xnx_1, x_2, \dots, x_n closes at xn+1=x1x_{n+1} = x_1. There are only finitely many cycles x1,x2,,xnx_1, x_2, \dots, x_n containing the point \infty; all other cycles are solutions for (1).

Remark. If we write xj=P+Qtantjx_j = P + Q \tan t_j where P,QP, Q and t1,,tnt_1, \dots, t_n are real numbers, the recurrence relation re-writes as (P+Qtantj)(1PQtantj+1)=a(P + Q \tan t_j)(1 - P - Q \tan t_{j+1}) = a (1P)QtantjPQtantj+1=a+P(P1)+Q2tantjtantj+1(j=1,2,,n).(1 - P) Q \tan t_j - P Q \tan t_{j+1} = a + P(P - 1) + Q^2 \tan t_j \tan t_{j+1} \quad (j = 1, 2, \dots, n). In view of the identity tan(αβ)=tanαtanβ1+tanαtanβ\tan(\alpha - \beta) = \frac{\tan\alpha - \tan\beta}{1 + \tan\alpha \tan\beta}, it is reasonable to choose P=12P = \frac{1}{2}, and Q=a14Q = \sqrt{a - \frac{1}{4}}. Then the recurrence leads to tjtj+1arctan4a1(modπ).t_j - t_{j+1} \equiv -\arctan \sqrt{4a - 1} \pmod{\pi}.

How the field did

contestants scored
313
average (of 10)
1.86
solved (≥ 80%)
9.6%
near-0 (≤ 10%)
74.8%
discrimination
0.47

Score distribution (field cohort)

Computed on contestants with a meaningful total (field cohort); discrimination is the corrected item–total correlation.

Similar problems

IMC 2015 · Day 1 · P5very hardavg 1.1/10 · solved 9% · near-0 82% · disc 0.49
IMC 2007 · Day 2 · P11very hardavg 0.9/10 · solved 8% · near-0 89% · disc 0.55
IMC 2021 · Day 1 · P3very hardavg 1.3/10 · solved 8% · near-0 80% · disc 0.50
IMC 2001 · Day 1 · P5very hardavg 1.5/10 · solved 7% · near-0 74% · disc 0.48