First, if N is prime, then ab≡0 (mod N) is true if and only if a≡0(mod N) or b≡0(mod N). In other words, if a prime number N divides a prime number N divides a product of two numbers, it divides at least one of the two numbers.
Second, if N is prime, then the equation ax≡1(mod N) has a unique solution(mod N) for all 0<a<N. This solution, 0<x<N, is the multiplicative inverse.
Third, if N is prime, then the equation x2≡a(mod N) has either two solutions (mod N) for all 0<a<N, or it has no solutions.
最后
以上就是温暖悟空最近收集整理的关于Modular Arithmetic的全部内容，更多相关Modular内容请搜索靠谱客的其他文章。
本图文内容来源于网友提供，作为学习参考使用，或来自网络收集整理，版权属于原作者所有。
发表评论 取消回复