- 更多网络例句与素因子相关的网络例句 [注：此内容来源于网络，仅供参考]
-
Using the elementary methods, we studied the hybrid mean value involving Smarandache function and the least prime divisor function, and gave an asymptotic formula.
用初等的方法研究了一个Smarandache函数与最小素因子的均值，并得到一个渐近公式。
-
We establish a relation between μ and the stucture of the group G, and obtain the lower bound of the ratio by the mininal prime divisor of the order and commutator of the group G, and give a necessary and sufficient condition under which this lower bound is attained.
第一部分，记有限群G的阶与不可约特征标个数的比值为μ，我们研究了一般的非交换有限群G的结构和μ之间的关系，通过群G的阶的最小素因子和换位子群G′的最小素因子得到了μ的一个下界，同时给出了达到下界的一个充分必要条件。
-
Health and egg contain harmful bacteria and viruses, in particular, contains egg albumin is an anti-biotin factors, would prevent the use of biotin absorption04-12-11
健康和鸡蛋含有有害的细菌和病毒，尤其是，含有卵清蛋白是一种抗生物素因子，将防止使用生物素的吸收
-
In 2000, F. LUCA proved that Fermat number are anti-sociable numbers, and in 2005, M. H. LE proved all powers of 2 are anti-sociable numbers. We have used the method of M. H. LE to obtain some new results of the anti-sociable numbers. For every integer n containing prime divisors that are 1 mod 4, let p mod 4 be an arbitrary prime divisor of n. There is at least one anti-sociable number in n^2, p^2n^2, p^4n^2, and p^6n^2. Therefore we can prove that anti-sociable numbers have positive density in perfect square numbers. We also give a method to find the exact anti-sociable numbers.
LUCA证明了Fermat数都是孤立数；2005年，乐茂华教授证明了2的方幂都是孤立数，用乐茂华教授的方法给出孤立数的一些新的结果：对于任意含有4w+1型素因子的正整数n，设p为n的任意一个4w+1型素因子，则在n^2，p^2n^2，p^4n^2，p^6n^2里至少有一个是孤立数，因此可以证明孤立数在完全平方数里有正密度，另外也给出求解确定孤立数的方法。
-
This process, known as prime factorization, should output a list of8–6. Prime Factorization.
这个过程叫做求素因子分解，它输出的所有因子之积应该是原来的数字。
-
Prime Factorization. Take your solutions for isprime and getfactors in the previous problems and create a function that takes an integer as input and returns a list of its prime factors.
素因子。以刚才练习中的 isprime 和 getfactors 函数为基础编写一个函数，它接受一个整数作为参数，返回该整数所有素数因子的列表。
-
Prime Factorization.
素因子。以刚才练习中的 isprime 和 getfactors 函数为基础编写一个函数，它接受一个整数作为参数，返回该整数所有素数因子的列表。
-
Nyang and Song proposed a digital signature scheme based on quadratic residue problem.
对Shimada公钥密码体制进行推广，提出一种新的密码体制，这种新的公钥密码体制的安全性建立在一般形式的素因子分解问题之上，攻击这种新的密码体制等价于对一般形式的大整数进行素因子分解，并设计一种新的数字签名方案和新的认证加密方案。
-
There are a lot of investigations on arithmetic functions: and , where is Euler totient function and o is the sum of divisors of n.
设φ表示n的欧拉函数，σ表示n的所有正因子和，ω表示n的不同素因子的个数。
-
There has been a lot of investigations on arithmetic functions σ and φ,where φ is Euler totient function and σ is the sum of divisors of n.
设φ表示n的欧拉函数，σ表示n的所有正因子和，ω表示n的不同素因子的个数。
- 更多网络解释与素因子相关的网络解释 [注：此内容来源于网络，仅供参考]
-
prime dual ideal：素对偶理想
prime divisor 素因子 | prime dual ideal 素对偶理想 | prime element 素元
-
prime factorization：素因子分解
prime factor 素因数 | prime factorization 素因子分解 | prime field 素域
-
Primary factor：准素因子
primary extinction 初次消光,初级消光 | primary factor 准素因子 | primary factor of production 初级生产要素
-
prime conjunction：素连接
prime component 素分量 | prime conjunction 素连接 | prime divisor 素因子
-
prime divisor：素因子
prime conjunction 素连接 | prime divisor 素因子 | prime dual ideal 素对偶理想
-
imaginary prime divisor：虚素因子
258. imaginary potential 虚势 | 259. imaginary prime divisor 虚素因子 | 260. imaginary quadratic field 虚二次域
-
finite prime divisor：有限素因子
finite presentation 有限表示 | finite prime divisor 有限素因子 | finite probability 有限概率
-
infinite prime divisor：无限素因子
infinite population 无限群体,无限总体 | infinite prime divisor 无限素因子 | infinite product 无穷乘积,无穷积
-
prime element：质元(素)
质因子 prime divisor | 质元(素) prime element | 质因子(式)素因子 prime factor
-
Prime factor：素因数
prime element 素元 | prime factor 素因数 | prime factorization 素因子分解