密码学 数论入门 Fermat Theorem 实战

• 水清波 发布于
• 1517 收藏

对两个连续整数n和n+1，为什么gcd(n,n+1)=1? Because when n+1 is divided by n then remainder is 1. Therefore 1 is  the GCD of n, n+1   利用费马定理计算3^201 mod 11 Fermat theorem explains a^p-1 =1 mod p, where p is a prim...