1. The problem statement, all variables and given/known data I'm suppose to prove that if (x,7)=1, then x to the 6th is congruent to 1 mod 7. 2. Relevant equations 3. The attempt at a solution Now, i have the proof by induction when (a,p)=1 but how do i apply this to prove it when a=x and p=7?