2) numerical factor
数值因素
1.
A numerical factor, the order number, is introduced in the process of numerical solution.
在数值求解的过程中 ,引入了影响外推测试结果精度的数值因素———阶数 ,并通过实例讨论了阶数对外推测试结果的影响程度以及获得满意精度时阶数的选取标准 。
4) prime factors
素因数
1.
The main purpose of this paper is using the Liouville inverse formula to give a new duality formula between prime factors of integers,and generalize K.
主要目的是利用Liouville反转公式来给出整数素因数间的一个新的对偶公式,从而推广了K。
2.
The follwing conclusion is proved:If D>0 is an odd square-free integer which has at most three distinct prime factors,then the equation in title only have two non-trivial solutions D=11,(x,y,z)=(49,20,6) and D=11×89×109,(x,y,z)=(4801,1960,6).
设D为奇数且最多含有3个互不相同的素因数,证明了不定方程组x2-6y2=1,y2-Dz2=4仅有两组非平凡解D=11,(x,y,z)=(49,20,6)和D=11×89×109,(x,y,z)=(4801,1960,6)。
5) prime divisor
素因数
1.
On the prime divisors of(a~p+1)/(a+1);
关于(a~p+1)/(a+1)的素因数
2.
In this paper we prove that if q is a prime,a1(mod q) and(a/q)=1, where(a/q) is the Legendre symbol,then q is a prime divisor of M(a,p).
该文证明了:当q=2p+1是素数时,如果(a/q)=1且a 1(modq),其中(a/q)是Legendre符号,则q必为M(a,p)的素因数。
3.
It is proved that there exists infinitely many positive integer triples (a,b,c) satisfying a+b=c, gcd(a,b,c)=1 and c>32G, where G is the product of distinct prime divisors of abc.
证明了:存在无穷多组正整数(a,b,c)满足a+b=c,gcd(a,b,c)=1,c>32G,其中G是乘积abc中不同素因数的乘积。
6) The mathematical
数学因素
1.
This paper analyses Heidegger s thinking from prescience ,science and the mathematical .
本论文以前科学、科学及数学因素为视角来梳理和浅析海德格尔对科学的追问和沉思。
补充资料：非密度制约因素(见密度制约因素)
非密度制约因素(见密度制约因素)
l焦非密度制约因素见生态因素、密度制约后
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条