- #1
SeReNiTy
- 170
- 0
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)
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?
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?