Rings
Maths and statistics discussion, revision, exam and homework help.
-
Rings
A bit of a proof that I don't understand again.

First of all I'll state the theorem
If
where
and p is prime then
.
Starting about halfway through it says this, "Suppose p divides a (
). Then
and
." Why is
if p divides a?
EDIT: IF more information is needed let me know, I'm just too lazy to type it all out if it is not needed.Last edited by JBKProductions; 13-05-2012 at 22:10. -
Re: RingsI think because(Original post by JBKProductions)
A bit of a proof that I don't understand again.
First of all I'll state the theorem
If
where
and p is prime then
.
Starting about halfway through it says this, "Suppose p divides a (
). Then
and
." Why is
if p divides a?
-
Re: RingsThink about what(Original post by JBKProductions)
I have attached the proof here, can someone explain the last part to me, I'm not sure exactly why there are exactly p^{k-1} elements divisible by p.
is: it's (essentially) the remainder that you get when you divide an integer by
; that is
. How many of these are divisible by
? Well you have
. (Note that
.)
How many of these are there?Last edited by nuodai; 13-05-2012 at 23:46. -
Re: RingsEDIT: I understand it now, thanks.(Original post by nuodai)
Think about what
is: it's (essentially) the remainder that you get when you divide an integer by
; that is
. How many of these are divisible by
? Well you have
. (Note that
.)
How many of these are there?Last edited by JBKProductions; 14-05-2012 at 00:21.
