Number theoryDifficulty 7.6National olympiad, round 2Prove itSaudi Arabia
Let p be a prime number of the form 9k+1. Show that there exists an integer n such that p∣n3−3n+1.
Solution
Note that the existence of an govern integer as described in the problem can be equivalently stated as follows: the polynomial x3−3x+1 has a root in Fp. Following the classical method for solving cubic equations, we set x=w+w1. Then x3−3x+1=(w+w1)3−3(w+w1)+1=w3+w31+1 We then observe that the solutions of the equation λ+λ1+1=0 are cubic roots of unity. If p=9k+1 and g is a primitive root (modp), then g3k is a cubic root of unity in Fp. Thus we look for w such that w3=g3k, so we let w=gk. It is now easy to verify that x=w+w1=gk+g8k 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.