Maths Olympiad Prep

Library / /5 of 52

Algebra Difficulty 7.5 National Olympiad, round 2 Prove it Romania

Given an odd prime pp, determine all polynomials ff and gg with integral coefficients satisfying the condition f(g(X))=k=0p1Xkf(g(X)) = \sum_{k=0}^{p-1} X^k.

Solutions — 3

Solution 1

More generally, let kk be an integer greater than 11 and let PP be a polynomial of degree at most k2k-2 with integral coefficients. The polynomials ff and gg with integral coefficients satisfying the condition f(g(X))=Xk+Xk1+P(X)f(g(X)) = X^k + X^{k-1} + P(X) are: f(X)=(±Xa)k+(±Xa)k1+P(±Xa)f(X) = (\pm X \mp a)^k + (\pm X \mp a)^{k-1} + P(\pm X \mp a) and g(X)=±X+ag(X) = \pm X + a, where aa is an integer, and f(X)=±X+bf(X) = \pm X + b and g(X)=±Xk±Xk1±P(X)bg(X) = \pm X^k \pm X^{k-1} \pm P(X) \mp b, where bb is an integer — in both cases, the signs correspond to one another; for instance, f(X)=(X+a)k+(X+a)k1+P(X+a)f(X) = (-X + a)^k + (-X + a)^{k-1} + P(-X + a) and g(X)=X+ag(X) = -X + a are admissible, but f(X)=(X+a)k+(X+a)k1+P(X+a)f(X) = (-X + a)^k + (-X + a)^{k-1} + P(-X + a) and g(X)=X+ag(X) = X + a are not.

Clearly, degf1\deg f \ge 1, degg1\deg g \ge 1 and the leading coefficients of ff and gg are ±1\pm 1.

If degg=1\deg g = 1, we immediately obtain the first pair of polynomials above.
If degg>1\deg g > 1, write f(X)=i=0maiXif(X) = \sum_{i=0}^{m} a_i X^i and g(X)=i=0nbiXig(X) = \sum_{i=0}^{n} b_i X^i, and notice that f(g(X))=ambnmXmn+mambnm1bn1Xmn1+f(g(X)) = a_m b_n^m X^{mn} + m a_m b_n^{m-1} b_{n-1} X^{mn-1} + \dots. Identification of coefficients yields ambnm=1a_m b_n^m = 1 and mambnm1bn1=1m a_m b_n^{m-1} b_{n-1} = 1. The latter forces m=1m = 1 which leads to the second pair of polynomials above.

Solution 2

The polynomial Φp(X)=k=0p1Xk\Phi_p(X) = \sum_{k=0}^{p-1} X^k is the pp-th cyclotomic polynomial. With the sign convention in the previous solution, the required polynomials are either f(X)=±Xaf(X) = \pm X \mp a and g(X)=±Φp(X)+ag(X) = \pm \Phi_p(X) + a, where aa is an integer, or f(X)=Φp(±Xb)f(X) = \Phi_p(\pm X \mp b) and g(X)=±X+bg(X) = \pm X + b, where bb is an integer.

The proof relies upon the well known fact that both Φp\Phi_p and its (formal) derivative, Φp(X)=k=0p2(k+1)Xk\Phi'_p(X) = \sum_{k=0}^{p-2} (k+1)X^k, are irreducible in Z[X]\mathbb{Z}[X]. This follows from Eisenstein's irreducibility criterion upon substitution XX+1X \mapsto X+1: Φp(X+1)=k=0p1(pk+1)Xk\Phi_p(X+1) = \sum_{k=0}^{p-1} \binom{p}{k+1} X^k and Φp(X+1)=k=0p2(k+1)(pk+2)Xk\Phi'_p(X+1) = \sum_{k=0}^{p-2} (k+1) \binom{p}{k+2} X^k.

Now take the derivative both sides of the relation in the statement to obtain f(g(x))g(X)=Φp(X)f'(g(x))g'(X) = \Phi'_p(X). Since Φp(X)\Phi'_p(X) is irreducible in Z[X]\mathbb{Z}[X] and its coefficients are obviously jointly coprime, either f(g(x))=±1f'(g(x)) = \pm 1 and g(X)=±Φp(X)g'(X) = \pm \Phi'_p(X) or vice versa — as before, the signs correspond to one another. With the same convention for signs, in the former case, g(X)=±Φp(X)+ag(X) = \pm \Phi_p(X) + a and f(X)=±Xaf(X) = \pm X \mp a, where aa is an integer; in the latter, g(X)=±X+bg(X) = \pm X + b and f(X)=Φp(±Xb)f(X) = \Phi_p(\pm X \mp b), where bb is an integer.

Solution 3

We show that if degg>1\deg g > 1, then degg=p1\deg g = p-1. The remaining details are easily filled in and hence omitted.

To begin, let ζ=cos(2π/p)+isin(2π/p)\zeta = \cos(2\pi/p) + i \sin(2\pi/p), let α\alpha be a (complex) root of ff, and let β\beta be a (complex) root of gαg - \alpha. Since Φp(β)=f(g(β))=f(α)=0\Phi_p(\beta) = f(g(\beta)) = f(\alpha) = 0, it follows that β\beta is one of the ζj\zeta^j, j=1,,p1j = 1, \dots, p-1. In particular, gαg - \alpha has no multiple roots, for Φp\Phi_p has no such.

Now let n=degg>1n = \deg g > 1, and let ζk1,,ζkn\zeta^{k_1}, \dots, \zeta^{k_n} be the roots of gαg - \alpha, where 1k1<<knp11 \le k_1 < \dots < k_n \le p-1. Since gg has integral coefficients, a=j=1nζkja = \sum_{j=1}^n \zeta^{k_j} is integral, by the first Vieta relation, so h=j=1nXkjah = \sum_{j=1}^n X^{k_j} - a is a monic non-constant polynomial with integral coefficients. Since Φp\Phi_p is the minimal polynomial of ζ\zeta and h(ζ)=0h(\zeta) = 0, it follows that Φp\Phi_p divides hh, so deghdegΦp=p1\deg h \ge \deg \Phi_p = p-1. On the other hand, degh=knp1\deg h = k_n \le p-1, so degh=p1\deg h = p-1, and since hh is monic, it ...

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: MathNet, licensed CC-BY-4.0. Statement reproduced verbatim; metadata (topic, difficulty) added by this project.