... factor of a polynomial 多项式因子 factor of an integer 整数的因子 factor of composition 合成因子 ...
基于26个网页-相关网页
... 代数曲体的因子 divisor of algebraic variety 整数的因子 divisor of integers 除数问题 divisor problem ...
基于8个网页-相关网页
·2,447,543篇论文数据,部分数据来源于NoteExpress
您还可以编写代码,用一个正整数的因子来确定它是否为素数(定义为大于1的整数,该数字仅有的因子为1和本身)。
You could also write code that USES a positive integer's factors to determine if it is a prime number (defined as an integer greater than 1 whose only factors are 1 and the number itself).
我们将编写一个确定整数因子的类。
We will write a class that determines the factors of an integer.
其中一个构造函数以双精度浮点数作为输入,另一个以整数和换算因子作为输入,还有一个以小数的String表示作为输入。
One takes a double-precision floating point as input, another takes an integer and a scale factor, and another takes a String representation of a decimal number.
n It takes discrete values, multiples of some integer n, and the multiplication factor is the ratio of the Planck constant divided by 2 pi where n takes one, two, three and so on.
这些离散的值乘以整数,乘积因子,是普朗克常数除以2π,其中n可以取1,2,3,等等。
应用推荐