TOPICS
Search

Search Results for ""


141 - 150 of 678 for Direct Search FactorizationSearch Results
A module M over a unit ring R is called flat iff the tensor product functor - tensor _RM (or, equivalently, the tensor product functor M tensor _R-) is an exact functor. For ...
A free Abelian group is a group G with a subset which generates the group G with the only relation being ab=ba. That is, it has no group torsion. All such groups are a direct ...
A Lie algebra over a field of characteristic zero is called semisimple if its Killing form is nondegenerate. The following properties can be proved equivalent for a ...
A sparse matrix is a matrix that allows special techniques to take advantage of the large number of "background" (commonly zero) elements. The number of zeros a matrix needs ...
A von Neumann regular ring is a ring R such that for all a in R, there exists a b in R satisfying a=aba (Jacobson 1989, p. 196). More formally, a ring R is regular in the ...
A divisor, also called a factor, of a number n is a number d which divides n (written d|n). For integers, only positive divisors are usually considered, though obviously the ...
The AC method is an algorithm for factoring quadratic polynomials of the form p(x)=Ax^2+Bx+C with integer coefficients. As its name suggests, the crux of the algorithm is to ...
Let n>1 be any integer and let lpf(n) (also denoted LD(n)) be the least integer greater than 1 that divides n, i.e., the number p_1 in the factorization ...
Finch (2001, 2003) defines a k-rough (or k-jagged) number to be positive integer all of whose prime factors are greater than or equal to k. Greene and Knuth define "unusual ...
For an integer n>=2, let gpf(x) denote the greatest prime factor of n, i.e., the number p_k in the factorization n=p_1^(a_1)...p_k^(a_k), with p_i<p_j for i<j. For n=2, 3, ...
1 ... 12|13|14|15|16|17|18 ... 68 Previous Next

...