theory of elementary divisors [数] 初等因子理论
Zero divisors 零因子
Common left divisors 共左除数
divisors of zero 零因子
More Divisors 反素数模板
Armor Divisors 护甲除数
divisors sum 约数和
small divisors 小除数
By using Riemann-Roch Theorem we give a short proof that any divisor of degree 0 is uniquely equivalent to a reduced divisor.
利用Riemann-Roch定理,证明了任何一个度数为零的除子唯一等价于一个约化除子。
参考来源 - 超椭圆曲线密码体制研究At multiplication, the multiplicative arithmetic of 1 bit BCD was improved and presented new arithmetic. At division, it presented the resolvent when divisor being zero.
算术运算方面着重在乘法运算中对1位BCD码相乘算法作了改进,提出了相乘过程中调整的新算法;除法运算中给出了除数为零的解决方案;开方根运算则采用newton迭代算法,并对求初值的方法给予改进,提出分段求初值的新方法。
参考来源 - 基于4位MCU的通用计算器芯片数学运算系统的研究与实现·2,447,543篇论文数据,部分数据来源于NoteExpress
N a number or quantity to be divided into another number or quantity (the dividend) 除数
I've got a number, I want to find the divisors.
我得到了一个数,我想要找到。
A composite is a positive integer with more than two divisors.
复合数就是具有一个以上约数的正整数。
A prime number is an integer greater than or equal to 2 that has exactly two distinct natural number divisors, 1 and itself.
素数是指大于等于2且只有两个不同约数的整数:1和它自己。
Suppose I want to find all the divisors of some integer, I want to figure out what all the divisors are that go evenly into it.
也就是遍历所有的整数来寻找,一个数的平方根,让我们再来看一个例子吧,为了找出另外一种的解决方法。
Again as I suggested if I've got two integers and I want to find common divisors I could take those two lists and walk through them.
我还要说如果我们有了两个整数,并且想求两者的公因数的话我,可以把这两个整数的。
I've got a number, I want to find the divisors.
我得到了一个数,我想要找到。
词组短语
应用推荐