查询词典 divisors

The semi-simple ring and semi-prime ring. Using properties of zero-divisors, regular elements and diaphysis elements , we obtain some results on the commutativity of Kthe semi-simple ring and semi-prime ring as follows:Let R be aKO|..

the半单纯环、半质环以及任意环的研究，利用零因子、正则元及骨干元的性质以及稠密性定理等相关知识，得到了关于Ko|。。

Using properties of zero-divisors, regular elements and subdirectly irreducible ring , we obtain some results on the commutativity of semi-prime ring and Jacobson semi-simple ring as follows 1 Let R be a semi-prime ring ,a∈R and 2a is not zero-divisor,If R satisfies one of the conditions in this paper , then R is commutative.

在某些特殊环的交换性方面取得了进一步的结果，并得到了一些新的结论，主要有一设R 为半质环，a∈R ，且2a 为非零因子，如果R 满足论文中八个条件之一，则可以证明环R 为交换环。

In Chapter 4, we define the induction of divisors and prove the existence of Galgebras of complete induction; through the analysis of Mackey formula, we give an equivalent characterization of the relationship between Green correspondence and free projectivity.

在第四章中，我们定义了除子的诱导，证明了完备诱导的G-代数的存在性；通过分析Mackey公式，给出了Green对应和自由投射关系的等价刻画。

Is a composite number,it has divisors…….

会判断一个数是不是质数。

Or for short: A prime number is a natural number with exactly two natural divisors. A natural number that is greater than one and is not a prime is called a composite number.

用通俗的话说，就是大偶数=素数+素数*素数或大偶数=素数+素数（注：组成大偶数的素数不可能是偶素数，只能是奇素数。

Help the Distributed Search for Fermat Number Divisors project find unique Fermat Number factors.

协助Fermat因子网络搜寻计划寻找特别的费马数因子。

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里至少有一个是孤立数，因此可以证明孤立数在完全平方数里有正密度，另外也给出求解确定孤立数的方法。

The properties kept by homomorphism of rings are generalized by restricting zero divisors of rings,and some important theorems are proved.

通过对环的零因子进行限制，推广了环同态所保持的性质，证明了几个重要的定理。

It is a popular claim that we should scan at only even divisors like 75, 100, 150 or 300 dpi, and then resample the image to be smaller to get the final size.

这是一种流行声称要扫描只divisors甚至像75，100，150或300dpi，然后resample的形象会较少得到最终规模。

We first characterize the groups in which all m∈cdq〓 contain at most 4 prime divisors; and then show the following: if any m∈cdq〓 is nth-power-free then the derived length of solvable group G is bounded by a function f depended only on n; also if cdq〓 has k different p-parts then the p-length of solvable group G is bounded by a function g depended only on k.

首先研究了非线性不可约特征标对应的特征标次数的商至多含有4个素因子的有限群结构。其次，我们证明：若每m∈cdq〓是n次方自由的，则有限可解群G的的导长及p-长都被仅依赖于n的函数所界定；若cdq〓中共有k个两两不同的p-部分，则有限可解群G的p-长能被仅依赖于k的函数所界定。

Means the parent directory, so this command means to execute "toolchain.sh," which is in the current directory.

代表父目录，所以这个命令就是执行当前目录下的"toolchain.sh"。

Yes,In fact,I'm on our city ream.

是的。事实上我是我们市队的。