(adsbygoogle = window.adsbygoogle || []).push({}); number theorm -- Euler theorem

1. The problem statement, all variables and given/known data

let be an integer that not divisible by 3. Prove that n^7[itex]\equiv[/itex]n mod 63

2. Relevant equations

none

3. The attempt at a solution

it is suffice to prove that n^7[itex]\equiv[/itex]n mod 7,n^7[itex]\equiv[/itex]n mod 9, i get

n^7[itex]\equiv[/itex]n mod 7 by Euler theorem , how to prove n^7[itex]\equiv[/itex]n mod 9

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

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

# Number theorm - Euler theorem

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