具体而言,对于一个数a,如果存在另一个数b,使得ab=1,那么b就是a的逆元
1.递推求逆元
ll int ny[n + 1];
ny[1] = 1;
for (inty i = 2; i <= n; i++)
{
ny[i] = (ll)(p - p / i) * ny[p % i] % p;
}
2.当模数p为质数时,a的(p-2)次方为a的逆元
long long ksm(long long a, long long b, long long p)
{
long long res = 1;
while (b)
{
if (b & 1)
res = res * a % p;
a = a * a % p;
b >>= 1;
}
return res;
}
ny[1] = 1;
for (int i = 2; i <= 200000; i++)
{
ny[i] = (ll)qm(i, mod - 2, mod) % mod;
}
3.拓展欧里基德
ll x, y;
void gcd(ll a, ll b)
{
if (b == 0)
{
x = 1;
y = 0;
return;
}
gcd(b, a % b);
ll temp = x;
x = y;
y = temp - a / b * y;
return;
}
cout << (x + b) % b << endl;
x,y的值为同余方程(ax+by=gcd(a,b)=1)的值 ,逆元的值为(x+mod)%mod;