Hey guys, I've been studying some number theory recently and have a question. We know if (a,n) = 1 then a^phi(n) is congruent to 1 (mod n)(adsbygoogle = window.adsbygoogle || []).push({});

where phi(n) = euler's totient function

Now my question is the totient function does not always return the smallest possible integer such that a^k is congruent to 1. So how do i find k if phi(n) does not equal k?

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

Join Physics Forums Today!

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

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

# Multiplicative order

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