I am not sure how to prove this:

If a has order t modulo a prime p, show that a^(t-1)+a^(t-2)+...+a+1 == 0(mod p).

Printable View

- March 22nd 2010, 01:17 PMtarheelbornOrder modulo a prime
I am not sure how to prove this:

If a has order t modulo a prime p, show that a^(t-1)+a^(t-2)+...+a+1 == 0(mod p). - March 22nd 2010, 01:42 PMchiph588@
- March 22nd 2010, 01:47 PMtarheelborn
I can't untangle the algebra of this move... Sorry, can you break it down into a couple of steps? Thanks.

- March 22nd 2010, 01:51 PMchiph588@
- March 22nd 2010, 02:19 PMtarheelborn
You would get (a*a^(t-1)+a*a^(t-2)+...+a^2+a-a^(t-1)-a^(t-2)-1), right?

- March 22nd 2010, 02:22 PMchiph588@
- March 22nd 2010, 02:24 PMtarheelborn
Yes, actually I did notice that...

- March 22nd 2010, 02:30 PMtarheelborn
So since a^t == 1 (mod p), (a^t)-1 == 0 (mod p), is that the idea?

- March 22nd 2010, 03:25 PMchiph588@