Maths Olympiad Prep

Library / /1 of 7

, 2018

Number theory Difficulty 7.6 National olympiad, round 2 Prove it Saudi Arabia

Let pp be a prime number of the form 9k+19k+1. Show that there exists an integer nn such that pn33n+1p \mid n^{3}-3n+1.

Solution

Note that the existence of an govern integer as described in the problem can be equivalently stated as follows: the polynomial x33x+1x^{3}-3x+1 has a root in Fp\mathbb{F}_{p}. Following the classical method for solving cubic equations, we set x=w+1wx = w + \frac{1}{w}. Then
x33x+1=(w+1w)33(w+1w)+1=w3+1w3+1 x^{3}-3x+1 = \left(w + \frac{1}{w}\right)^{3} - 3\left(w + \frac{1}{w}\right) + 1 = w^{3} + \frac{1}{w^{3}} + 1
We then observe that the solutions of the equation λ+1λ+1=0\lambda + \frac{1}{\lambda} + 1 = 0 are cubic roots of unity. If p=9k+1p = 9k + 1 and gg is a primitive root (mod p)(\bmod\ p), then g3kg^{3k} is a cubic root of unity in Fp\mathbb{F}_{p}. Thus we look for ww such that w3=g3kw^{3} = g^{3k}, so we let w=gkw = g^{k}.
It is now easy to verify that x=w+1w=gk+g8kx = w + \frac{1}{w} = g^{k} + g^{8k} is a root of the original cubic polynomial.

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 and solution reproduced as published; topic and difficulty added by this site.