divisor的例句大全

In 4 divided by 2, the number 2 is the divisor and 4 is the dividend.

在4被2除中, 2是除数,4是被除数.

In Verilog HDL code , division is improved by quantizing the divisor, which makes hardware realization easy.

在描述硬件过程中,论文对算法中的除法运算进行改进,将除数进行量化处理, 使其更易于硬件实现.

The divisor problem in additive square complements is studyied, which improves results ever deduced.

研究了平方补数集合中的除数问题, 改进并推广了原有的结果.

The divisor is subtracted from the dividend.

从被除数中减去除数.

Please tell me how to work out the divisor and how to work out the dividend.

师:请同学们归纳求除数和被除数的关系式.先让学生小组讨论,自行探究.

Is it possible for the divisor in a division operation to be zero?

是否存在除法运算中分母为零的情况?

Divide the dividend by the quotient, if you can get the divisor right.

方法二:用商去除被除数, 看是不是等于除数.

The Business Cost Unit is divisor of the total Business Cost and the Economic Value.

单位商务成本是总商务成本与经济增加值的商.

A simulation of a circuit to calculate GCD Greater Common Divisor.

模拟电路来计算最大公因子大公因式.

In this paper, we will completely characterize all power endomorphisms of rings without zero divisor.

本文将完全刻划出无零因子环的所有幂自同态.

This operation only allowed for ( integer ) and the divisor must not be ( zero ).

此运算只可容许 ( 整数 ),而且除数不可以是 ( 零 ).

Work out dividend or divisor according to the rules.

难点:判断求除数或被除数用哪个关系式.

Divisor scalar multiplication is the key operation in hyperelliptic curve cryptosystem.

除子标量乘是超椭圆曲线密码体制中的关键运算.

GCD and LCM. Determine the greatest divisor and least common multiple of a pair of integers.

最大公约数和最小公倍数请计算两个整数的最大公约数和最小公倍数.

We divide both by their common divisor.

用它们的公因子去除两个数.

The greatest common divisor of 24 and 30 is 6 24.

和30的最大公约数为6.

The common divisor pact is the most important self-government regulation.

业主公约是全体业主的最高 自治 规则.

Funny Money ON DIVISOR PROBLEMS Hence, what's important is money divisor.

因而，在货币供给创造过程中，最重要的是货币除数。

In this paper , we study the zero-divisor semigroups of tournaments.

讨论了竞赛图的零因子半群.

In this paper the relationship between memory contention and ( a, M), the greatest common divisor of a and M, is investigated, where M is the number of parallel memory modules, and a is a constant increment of address.

本文论述了以增量a（常数）访问M个体组成的并行存储器时，存取碰头和（a，M）的关系，这里（a，M）表示a和M的最大公因数。