阅读背景:

My first blog entry also is my first english math proof ( GCD(a,b)=min{a*x+b*y, a*x+b*y>0} )

来源:互联网 

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. If a and b are any intege




你的当前访问异常,请进行认证后继续阅读剩余内容。

分享到: