Euler's theorem says that (mod n). So we need to know . Now, I couldn't find this number on the net, but using my calculator I easily found that (mod 45).

So (mod 45) = 1 (mod 45)

Thus the remainder is 1.

-Dan

December 13th 2006, 04:21 AM

ThePerfectHacker

Quote:

Originally Posted by topsquark

Now, I couldn't find this number on the net, but using my calculator I easily found that (mod 45).

What you found was actually the "order of 11". Euler's theorem says that is always AN exponent that makes the statement true. But not necessarily the smallest (the order of the integer). Whenever the order is that is called a "primitive roots" (in an algebraic way of sense we can think of this a generator of the cyclic group). The number 45 has not primitive roots, as a problem solved by Gauss. It is not one of the standard forms for which primitive roots exists. (primes, power of primes, and doubling power of primes).