Modular Arithmetic

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.

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值