(adsbygoogle = window.adsbygoogle || []).push({}); 1. The problem statement, all variables and given/known data

let a and b be integers that not divisible by the prime number p

if a^p[itex]\equiv[/itex]b^p, prove that a^p[itex]\equiv[/itex]b^p mod p^2

2. Relevant equations

if a^p[itex]\equiv[/itex]b^p, prove that a[itex]\equiv[/itex]b mod p

3. The attempt at a solution

I already get that a[itex]\equiv[/itex]b mod p , then how can I get a^p[itex]\equiv[/itex]b^p mod p^2 under the a^p[itex]\equiv[/itex]b^p mod p

**Physics Forums | Science Articles, Homework Help, Discussion**

Dismiss Notice

Join Physics Forums Today!

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

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

# Homework Help: Number thory- fermet's little theorm

**Physics Forums | Science Articles, Homework Help, Discussion**