My first blog entry also is my first english math proof ( GCD(a,b)=min{a*x+b*y, a*x+b*y>0} )
来源:互联网 发布:mac ssh连接服务器 编辑:程序博客网 时间:2024/06/07 18:17
theorem 31.2
If a and b are any integers,not both zero,then GCD(a,b) is the smallest positive element of the set {a*x+b*y} of linear combination of a and b.
Proof:
1.Let s be the smallest positive element in the set {ax+by},q=(int)a/s.
then a mod s=a-q*s=a-q*(a*x+b*y)=(a-q*a)*x-q*b*y.
that means a mod s also is a linear combination of the a and b.
Besides,a mod s<s and s is the smallest element in the set.
Therefore a mod s should be a nonpositive integer,but acutually a mod s>=0.
Thus,a mod s must be equal to zero.
so s|a.
By analogous reasoning,we could get s|b,then s|GCD(a,b).
2.On the other hand,GCD(a,b)|a and GCD(a,b)|b,
so GCD(a,b)|(a*x+b*y),then GCD(a,b)|s.
beacause GCD(a,b)|s and s|GCD(a,b),we could conclude that GCD(a,b) is equal to s.
I'ts a original edition,I wish everyone wants to reproduce indicate the source.
- My first blog entry also is my first english math proof ( GCD(a,b)=min{a*x+b*y, a*x+b*y>0} )
- BZOJ 2301 Problem B(x属于[a,b],y属于[c,d]满足gcd(x,y)=k的(x,y)的有序对数)
- BZOJ 1101([POI2007]Zap-满足x<=a&&y<=b&&gcd(x,y)=d的数对个数)
- 解不定方程a*x+b*y=c
- 解不定方程a*x+b*y=c
- 最大公约数,最小公倍数,a*x+b*y=n
- 扩展欧几里得 a*x+b*y=c的解
- 1 / x + 1 / y = b / a(已知a,b)
- My first blog , a newbie
- if(x == 0) y=a else y=b 其它几种实现方法
- (a,b)=1 ax+by x>0 y>0的最大不能表示数
- 扩展gcd模板,a^x=b。
- A+B=X
- I've been a blogger. This is my first blog.
- POJ 3243 Clever Y 求A^X = B (mod C) / BabyStep_GiantStep
- POJ 3243: Clever Y 求A^X = B (mod C) / BabyStep_GiantStep
- 扩展欧几里得a*y-b*y=1
- 给你5个数a,b,c,d,k。x属于[a,b]y属于[c,d]。 问你有多少对(x,y)的公约数为k
- SQL Server 索引结构及其使用(三)
- SQL Server 索引结构及其使用(四)
- extjs中查看json字符串
- C#语言参考
- POJ 1423 Big Number
- My first blog entry also is my first english math proof ( GCD(a,b)=min{a*x+b*y, a*x+b*y>0} )
- fuse专题
- Android拒绝来电的实现--ITelephony类的反射
- win32 API 图片、音乐的加入代码
- android 和mysql的数据传输方法 求解。
- sql server基本
- 【转】强大!下一代X Window – Wayland, 今生前世之新生
- catalan数
- C#IO流详解