Let n be a positive integer such that n ≥ 3 , then
n n n n − n n n
is divisible by
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
I am not sure if I can follow the proof. in case 1, where you assumed 3 ∤ n and used Euler-Fermat afterwards, I do not think you have used the theorem correctly. In such a case, you can have n n n n ≡ n n n m o d 3 2 if n n n ≡ n n m o d ϕ ( 3 2 ) . I might be wrong, so advise me accordingly.
Log in to reply
so we assume that if 3 does not divide n, then gcd(3,n)=1, then we apply Euler-Fermat theorem.
Problem Loading...
Note Loading...
Set Loading...