1.实现求乘法逆元的函数,给定a和m,求a模m的乘法逆元,无解时请给出无解提示,并且只返回正整数。进而给出求解同余方程(ax = b mod m)的函数,即给定a,b,m,输出满足方程的x,无解给出无解提示
#include<iostream>
using namespace std;
int egcd(int a, int b, int &r, int &s) {
r = 1, s = 0;
int r1 = 0, s1 = 1, q;
int temp;
while (b) {
q = a / b;
r = r - q * r1;
s = s - q * s1;
temp = a;
a = b;
b = temp % b;
swap(r, r1);
swap(s, s1);
}
return a;
}
int func(int a, int m) {
int x = 0, y = 0;
int val = egcd(a, m, x, y);
return val = 1 ? x : 0;
}
int main() {
int a, m;
cin >> a >> m;
if (func(a, m)) { cout << "乘法逆元是:" << func(a, m) << endl; }
else cout << "无解" << endl;
return 0;
}
2.实现模指数运算的函数,给定x、y和m,求x的y次方模m
int func(int x, int y, int p) {
int val = 0;
while (y > 0)
{
if ((y & 1) == 1) { val = (val * x) % p; }
y = y / 2;
x = x * x % p;
}
return val;
}
3.设p = 23和a = 5,使用费尔马小定理计算a^{2020} mod p
5 2020 m o d 23 = 5 ( 23 − 1 ) ∗ 91 + 18 m o d 23 = 5 18 m o d 23 = 6 5^{2020} mod 23 = 5^{(23−1)∗91+18} mod 23 = 5^{18} mod 23 =6 52020mod23=5(23−1)∗91+18mod23=518mod23=6
4.使用欧拉定理计算2^{100000} mod 55
由题:
Φ
(
55
)
=
40
Φ(55) = 40
Φ(55)=40
2
Φ
(
n
)
≡
1
m
o
d
(
55
)
2^{Φ(n)} ≡ 1 mod (55)
2Φ(n)≡1mod(55)
2
100000
m
o
d
55
=
2
40
∗
2500
m
o
d
55
=
1
2^{100000} mod 55 = 2^{40 * 2500} mod55 = 1
2100000mod55=240∗2500mod55=1
5.手动计算7^{1000}的最后两个数位等于什么
计算 7 1000 7^{1000} 71000 最后两位数就是求 7 1000 m o d 100 7^{1000} mod 100 71000mod100
又 Φ ( 100 ) = 40 Φ(100) = 40 Φ(100)=40
所以 7 40 ≡ 1 m o d ( 100 ) 7^{40} ≡ 1 mod (100) 740≡1mod(100)
计算后可知答案为1
综上所述:最后两位数位数位等于:01