Provided that gcd(b,n)=1, Euler's theorem tells us that bk≡1(modn) is satisfied by k=φ(n), but φ(n) need not be the smallest positive integer value of k ...
確定! 回上一頁