Solve Congruence Problem for Prime & Integer

  • Thread starter Thread starter Ed Aboud
  • Start date Start date
Click For Summary

Homework Help Overview

The discussion revolves around a congruence problem involving a prime number \( p \) and an integer \( a \) that is not divisible by \( p \) and does not satisfy \( a \equiv 1 \mod p \). The goal is to show that the sum \( 1 + a + a^2 + a^3 + ... + a^{p-2} \equiv 0 \mod p \).

Discussion Character

  • Exploratory, Conceptual clarification, Mathematical reasoning

Approaches and Questions Raised

  • Participants explore the factorization of \( a^{p-1} - 1 \) and its implications for the sum in question. There are attempts to clarify the steps involved in the factorization and the application of Fermat's Little Theorem. Questions arise regarding the reasoning behind certain factorizations and the conditions under which they hold.

Discussion Status

The discussion is active, with participants engaging in clarifying the factorization process and its relevance to the problem. Some participants express understanding and appreciation for the insights shared, while others seek further clarification on specific steps and reasoning.

Contextual Notes

There is a mention of a previous theorem discussed in class, which may provide additional context for the problem. Participants also note the importance of the conditions set by the problem statement, particularly regarding the properties of \( a \) and \( p \).

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 a \not \equiv 1 mod p
Show that <br /> 1 + a + a^2 + a^3 + ... + a^p^-^2 \equiv 0 mod p <br />

Homework Equations


The Attempt at a Solution



a^\phi^(^p^) = a^p^-^1 \equiv 1 mod p

a^p^-^1 -1 \equiv 0 mod p

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

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

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
What are you trying to prove? The problem statement only has the 'Let' part.
 
Oh sorry.

Show that
1 + a + a^2 + a^3 + ... + a^p^-^2 \equiv 0 mod p
 
Can you show a^(p-1)-1=(a-1)(1+a+a^2+...+a^(p-2))?
 
Yeah I can show that by dividing a - 1 into a^p^-^1.
But I don't understand where you got the a -1 from.
 
I just factored a^(p-1)-1. You know that's 0 mod p. It's in your attempt at a solution. It's Fermat's little theorem.
 
Ok. Sorry I don't know how to factor a^p^-^1
 
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 a^p^-^1 -1 divided by a - 1 equals 1 + a + a^2 + ... + a^p^-^2.

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

I'm just wondering how did you factor a^p^-^1 -1 into a^p^-^1 -1 by 1 + a + a^2 + ... + a^p^-^2 .
 
  • #10
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.
 
  • #11
Oh ok. Cool it all makes sense now.
Thanks for your help, appreciate it!
 

Similar threads

Replies
17
Views
3K
Replies
16
Views
3K
  • · Replies 6 ·
Replies
6
Views
2K
Replies
27
Views
4K
  • · Replies 14 ·
Replies
14
Views
2K
Replies
12
Views
4K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 5 ·
Replies
5
Views
3K
Replies
7
Views
2K