Congruence Question: Proving m=n (mod p-1)

  • Thread starter Thread starter StudentR
  • Start date Start date
StudentR
Messages
7
Reaction score
0
Congruence Question !

I have a question regarding congruences, I could not find this result in the textbooks.

(note to readers: a^k means a to the power k, and = means congruent)

If we have a congruence: a^m = a^n (mod p) for a,m,n,p>0

It seems likely to deduce that m = n (mod p)

However after attempting a homework question, I discover that

a^m = a^n (mod p) implies m = n (mod p-1)

Is this result true? How does one go about to formally prove the above statement?

Thank you...
 
Physics news on Phys.org
What made you think that's true? Did you try some numerical examples?
 
One would first go about thinking what the correct statement of the above should be: one raised to any power is still one.
 
Consider a^m = a^n (mod p) => m = n (mod p) for m=p, n=1. Then it's obviously not true, and proof that it's not true follows immediately from the little fermat theorem.

Hint: the little fermat theorem is key to understanding the 2nd set of congruences as well
 
Last edited:

Thread 'Trouble understanding an online solution to an exercise in Dummit & Foote'

##\textbf{Exercise 10}:## I came across the following solution online: Questions: 1. When the author states in "that ring (not sure if he is referring to ##R## or ##R/\mathfrak{p}##, but I am guessing the later) ##x_n x_{n+1}=0## for all odd $n$ and ##x_{n+1}## is invertible, so that ##x_n=0##" 2. How does ##x_nx_{n+1}=0## implies that ##x_{n+1}## is invertible and ##x_n=0##. I mean if the quotient ring ##R/\mathfrak{p}## is an integral domain, and ##x_{n+1}## is invertible then...
View full post »

Thread 'Questions about non existence of GCDs vs (coimages, cokernels)'

The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...
View full post »

Thread 'Decomposition into irreps of compact Lie group'

When decomposing a representation ##\rho## of a finite group ##G## into irreducible representations, we can find the number of times the representation contains a particular irrep ##\rho_0## through the character inner product $$ \langle \chi, \chi_0\rangle = \frac{1}{|G|} \sum_{g\in G} \chi(g) \chi_0(g)^*$$ where ##\chi## and ##\chi_0## are the characters of ##\rho## and ##\rho_0##, respectively. Since all group elements in the same conjugacy class have the same characters, this may be...
View full post »

Similar threads

I How to Prove a Congruence Relation for Prime Numbers?
Replies
17
Views
2K
I Congruence for Symmetric and non-Symmetric Matrices for Quadratic Form
Replies
7
Views
2K
I How to show ##p(x)=g(x)x\pm 1\in\Bbb{Q}[x]## is irreducible in ##\Bbb{Q}_{\Bbb{Z}}[x]##?
Replies
48
Views
3K
When n*(n+1)/2 - k is never a square
Replies
2
Views
1K
MHB Congruences - Rotman - Proposition 1.58 - Second Question
Replies
1
Views
1K
What Does a = b (mod pZp) Mean in p-adic Numbers?
Replies
4
Views
3K
The Chinese Remainder Theorem for moduli that aren't relatively prime
Replies
2
Views
4K
MHB Prove Polynomial Congruence $(x+y)^n \equiv x^n + y^n$ (mod $p$)
Replies
2
Views
1K
I Trouble understanding an online solution to an exercise in Dummit & Foote
Replies
21
Views
699
I Trouble with a passage in Zariski & Samuel's Commutative algebra text
Replies
5
Views
638

Hot Threads

Recent Insights

Back
Top