Re: Order modulo p^n (Number Theory)

On Sun, 14 Sep 2008 08:01:55 -0700 (PDT),
"dark.sorrow.mystery@xxxxxxxxx"
<dark.sorrow.mystery@xxxxxxxxx> wrote:

On Sep 15, 12:37 am, Tonico <Tonic...@xxxxxxxxx> wrote:
On Sep 14, 3:56 pm, "dark.sorrow.myst...@xxxxxxxxx"

<dark.sorrow.myst...@xxxxxxxxx> wrote:
Hello need some help with a question in number theory im attempting

Let p be an odd prime and n > 1 an integer. Find the order of (1 + p)
modulo (p^n).

Cheers

***********************************************************

Hints:

1.- Try with p = 3, 1 + p = 4 and n = 1, 2, 3, 4, and then with p = 5
and 1 + p = 6, and then even with p = 7 and 1 + p = 8...

2.- Now prove your guess or huntch: use Newton's binomial with

(1 + p)^(p^(n-1))...you may want to show that the binomial

coefficient [p^r : r] is divisible by p iff r is a multiple of p...

Regards
Tonio

Cheers, thanks you for your help, I should of used the examples to
find the order. Then try prove it. was trying to come up with the
order via theorems and was getting know where. Thanks Tonio on the
binomial, that really helped with the proof ofthe order.

Can you explain your proof?

My original "proof" was a load of dingo's kidneys (as I would have
realised if I had typed it up neatly to post to sci.math). I think
I've fixed it now, but I'm still reluctant to post it until you've
shown your work.

--
Angus Rodgers
(twirlip@ eats spam; reply to angusrod@)
Contains mild peril
.

Relevant Pages

  • Re: Order modulo p^n (Number Theory)
    ... modulo. ... 2.- Now prove your guess or huntch: ... coefficient is divisible by p iff r is a multiple of p... ... that really helped with the proof ofthe order. ...
    (sci.math)
  • Re: Order modulo p^n (Number Theory)
    ... modulo. ... 2.- Now prove your guess or huntch: ... coefficient is divisible by p iff r is a multiple of p... ...
    (sci.math)