欧几里得
int gcd(int a,int b)
{
int r=a%b;
while (r)
{
a=b;b=r;r=a%b;
}
return b;
}
https://blog.csdn.net/cqlf__/article/details/7953039
扩展欧几里得
int exgcd(int a,int b)
{
if (b==0)
{
x=1;y=0;
return;
}
else
{
exgcd(b,a%b);
int t=y;
y=x-(a/b)*y;
x=t;
}
}
https://blog.csdn.net/zhjchengfeng5/article/details/7786595
费马小定理:
a^(p-1)=1(mod)p
描述为:a的p次方与1 mod p同余,其中p为素数,即gcd(p,a)=1.
https://blog.csdn.net/u014034683/article/details/38341853