Académique Documents
Professionnel Documents
Culture Documents
given by
(f ) = f n ,
n
p
, so that pk does
(x + a)n xn a
is not zero in Zn .
Z[x]
Zn [x]
= r
,
I
(x 1)
r
N r2N
(ni 1)
1id2
1 2 2
(d +1)
< n2d
2N ,
a contradiction.
so that we compute
513 = 58 54 5.
mod n 1.
1007 = 29 + 28 + 27 + 26 + 25 + 23 + 22 + 2 + 1
(google is your friend for this). In particular d = 9. Now
2
and
2811 = 37,
so that 1007 has order 88 > 81 in U89 , the non-zero elements of the
eld F89 . As r is prime, (r) = r 1, so that (89) = 88. Next we
check that n is coprime to every number less than 88. It isnt so we
are done.
If we ignore this and assume we get to the next step, we are supposed
to compute
Z1007 [x]
,
(x + a)n xn a 89
(x 1)
Z[x]
.
(n, xr 1)
7
Then n is prime.
We will assume that n is composite and derive a contradiction. Sup
pose that p is a prime dividing n. Then we have
(x + a)n = xn + a,
in the smaller ring
Z[x]
Fp [x]
= r
.
r
(x 1)
(p, x 1)
Now Fp [x] is a UFD. So the polynomial xr 1 factors into irreducible
polynomials which are prime. Let h(x) Fp [x] be a prime polynomial
dividing xr 1. Then
F=
Z[x]
Fp [x]
=
,
(p, h(x))
(h(x))
MIT OpenCourseWare
http://ocw.mit.edu
For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms.