说明:双击或选中下面任意单词,将显示该词的音标、读音、翻译等;选中中文或多个词,将显示翻译。
您的位置:首页 -> 词典 -> 带余除法
1)  Division with Remainder
带余除法
2)  division algorithm
带余除法
1.
Based on a set of constructed integers,this paper uses the minimum number principle to use the problem of the method of summation in the quotient and remainder derived from the theorem of division algorithm,for solving the minimum value point and minimum value.
通过已构造的一个整数集,利用最小数原理将带余除法定理中的商和余数的求法问题转化成求函数的最小值点和最小值问题。
2.
In this paper, by means of the division algorithm and congruence, firstly we discuss the fractions with the simplest decimal expansions; secondly, without having to carry out the actual calculation of the decimal, we discuss the length of the repeating part of the periodic decimal of 1/n and come to the corresponding conclusions.
利用同余及带余除法解决:小数展开式最简单的分数;对任意正整数n,不用直接做小数除法,1/n的小数展开式循环节的长度的上限及相关问题。
3)  division formula with remainder
带余除法公式
1.
Then the division formula with remainder is intuitively proved and applied.
利用等度区间族覆盖数轴的简单知识,给出了有理数对实数逼近的表示方式及其应用;对带余除法公式给出了直观的证明和应用,对分析中的一些结果给出了统一的处理方法。
4)  division with reminder of polynomials
多项式带余除法
1.
According to the complexity of decoding circuit in digital TV and the moderate speed of decoding,a modified Euclidean algorithm is proposed based on the related deduction of division with reminder of polynomials.
针对数字电视译码电路复杂,译码速度不高的特点,基于多项式带余除法的相关推论,提出一种改进型欧几里德算法。
2.
The proposed algorithm use the related deduction of division with reminder of polynomials and the key equation is solved by column transformation of matrix.
该算法利用多项式带余除法的相关推论,通过矩阵的列变换来求解关键方程,这样可以快速地得到商式和余式,从而可以减少迭代运算的次数。
3.
According to the disadvantages of the complexity of decoding circuit in digital TV and the moderate speed of decoding,a modified Euclidean algorithm is proposed by the related deduction of division with reminder of polynomials.
针对数字电视译码电路复杂,译码速度不高的缺点,利用多项式带余除法的相关推论,提出一种改进型欧几里德算法。
5)  division-remainder method
除-余数法
6)  the smallest offcut deletion algorithm
最小余料删除法
1.
To solve the rectangles cutting stock problem,this paper proposes a new algorithm-the smallest offcut deletion algorithm based on analyzing the main disadvantage of the traditional approximate algorithm.
针对矩形件排样优化问题,分析了传统近似算法的主要缺陷,并在此基础上提出了一种新的排样算法———最小余料删除法。
补充资料:余带
1.衣带过长。指形体消瘦。
说明:补充资料仅用于学习参考,请勿用于其它任何用途。
参考词条