设{ax1+by1=gcd(a,b)bx2+(amodb)y2=gcd(b,amodb)gcd(a,b)=gcd(b,amodb)所以ax1+by1=bx2+(amodb)y2又因为amodb=a−(⌊ba⌋×b)所以有ax1。
拓展欧几里得算法
设
{ a x 1 + b y 1 = g c d ( a , b ) b x 2 + ( a m o d b ) y 2 = g c d ( b , a m o d b ) \left\{\begin{matrix} a x_1 + b y_1 = gcd ( a , b ) \\ b x_2 + ( a m o d b ) y_2 = gcd ( b , a m o d b ) \end{matrix}\right. {
ax1+by1=gcd(a,b)bx2+(a mod b)y2=gcd(b,a mod b)由欧几里得定理可知： g c d ( a , b ) = g c d ( b , a m o d b ) gcd ( a , b ) = gcd ( b , a m o d b ) gcd(a,b)=gcd(b,a mod b)
所以 a x 1 + b y 1 = b x 2 + ( a m o d b ) y 2 a x_1 + b y_1 = b x_2 + ( a m o d b ) y_2 ax1+by1=bx2+(a mod b)y2
又因为 a m o d b = a − ( ⌊ a b ⌋ × b ) a\bmod b=a-(\lfloor\frac{a}{b}\rfloor\times b) amodb=a−(⌊ba⌋×b)
所以有 a x 1 + b y 1 = b x 2 + ( a − ( ⌊ a b ⌋ × b ) ) y 2 ax_1+by_1=bx_2+(a-(\lfloor\frac{a}{b}\rfloor\times b))y_2 ax1+by1=bx2+(a−(⌊ba⌋×b))y2化简得
a x 1 + b y 1 = a y 2 + b x 2 − ⌊ a b ⌋ × b y 2 = a y 2 + b ( x 2 − ⌊ a b ⌋ y 2 ) ax_1+by_1=ay_2+bx_2-\lfloor\frac{a}{b}\rfloor\times by_2=ay_2+b(x_2-\lfloor\frac{a}{b}\rfloor y_2) ax1+by1=ay2+bx2−⌊ba⌋×by2
最低0.47元/天 解锁文章
888
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
