Solve Congruence Problem for Prime & Integer

  • Thread starter Thread starter Ed Aboud
  • Start date Start date
Join the discussion
Registration is free. Ask a follow-up in this thread, or start your own.
10 replies · 3K views
Ed Aboud
Messages
200
Reaction score
0

Homework Statement



Let p be a prime and let a be an integer not divisible by p satisfying [itex]a \not \equiv 1 mod p[/itex]
Show that [tex] 1 + a + a^2 + a^3 + ... + a^p^-^2 \equiv 0 mod p [/tex]

Homework Equations


The Attempt at a Solution



[tex]a^\phi^(^p^) = a^p^-^1 \equiv 1 mod p[/tex]

[tex]a^p^-^1 -1 \equiv 0 mod p[/tex]

[tex](a^p^-^1 -1)^p \equiv 0 mod p[/tex]
From a previous theorem that we did in class we showed that [itex]p[/itex] | [itex]p\choose m[/itex]

[tex]a^p^(^p^-^1^) - a^p^-^1^(^p^-^1^) + ... <br /> - a^(^p^-^1^) \equiv 0 mod p[/tex]

I'm stuck here. I think I can sense that I am on the right track but I don't know which direction to go from here.

Any help would be greatly appreciated!
 
Last edited:
Physics news on Phys.org
Oh sorry.

Show that
[tex]1 + a + a^2 + a^3 + ... + a^p^-^2 \equiv 0 mod p[/tex]
 
Yeah I can show that by dividing [itex]a - 1[/itex] into [itex]a^p^-^1[/itex].
But I don't understand where you got the [itex]a -1[/itex] from.
 
Ok. Sorry I don't know how to factor [itex]a^p^-^1[/itex]
 
Dick said:
Can you show a^(p-1)-1=(a-1)(1+a+a^2+...+a^(p-2))?

You answered 'yes' to this question. That's a factorization of a^(p-1)-1. If p is prime and a*b=0 mod p, what can you say about a mod p or b mod p?
 
You can say that p|a or p|b .

I answered yes because I was able to show that [itex]a^p^-^1 -1[/itex] divided by [itex]a - 1[/itex] equals [itex]1 + a + a^2 + ... + a^p^-^2[/itex].

If you hadn't told me that [itex]a^p^-^1 -1 = (a - 1)(1 + a + a^2 + ... + a^p^-^2)[/itex]
I wouldn't have been able to factor [itex]a^p^-^1 -1[/itex] into [itex]a - 1[/itex] by [itex]1 + a + a^2 + ... + a^p^-^2[/itex].

I'm just wondering how did you factor [itex]a^p^-^1 -1[/itex] into [itex]a^p^-^1 -1[/itex] by [itex]1 + a + a^2 + ... + a^p^-^2[/itex] .
 
It's a really common sort of factorization. You can always factor a^n-b^n into (a-b)*(a^(n-1)+a^(n-2)*b+..+a*b^(n-2)+b^(n-1)). I just recognized it. Like a^2-b^2=(a-b)(a+b), a^3-b^3=(a-b)(a^2+ab+b^2) etc etc.
 
Oh ok. Cool it all makes sense now.
Thanks for your help, appreciate it!