- #1
yeland404
- 23
- 0
Homework Statement
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
Homework Equations
if a^p[itex]\equiv[/itex]b^p, prove that a[itex]\equiv[/itex]b mod p
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