(adsbygoogle = window.adsbygoogle || []).push({}); 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 Forums - The Fusion of Science and Community**

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Congruence Question

Loading...

Similar Threads - Congruence Question | Date |
---|---|

I Congruence Subgroups and Modular Forms Concept Questions | Dec 27, 2016 |

Basic Congruences Confusion | Nov 12, 2012 |

DIVISIBILITY CONGRUENCE question | Nov 18, 2010 |

Congruence Class Question | Nov 1, 2010 |

Question about congruences and orders | Oct 23, 2006 |

**Physics Forums - The Fusion of Science and Community**