prime factor

(redirected from Prime divisor)
Also found in: Dictionary, Encyclopedia.
Related to Prime divisor: Prime number theory
Graphic Thesaurus  🔍
Display ON
Animation ON
Legend
Synonym
Antonym
Related
  • noun

Words related to prime factor

the prime factors of a quantity are all of the prime quantities that will exactly divide the given quantity

Related Words

References in periodicals archive ?
R] (X) is the R-vector space with canonical basis given by the prime divisors of X.
p] is a loose Quasi-Mersenne prime, which is any integral prime divisor of a Quasi-Mersenne composite.
The problem is to write a program which finds the smallest prime divisor of an integer N > 1.
We refer to this method as the prime divisor coloring.
The subjects task was to decide if the target was divisible by the prime divisor with no remainder.
Then W is called a log canonical center of (X, [DELTA]) if there are a projective birational morphism f: Y [right arrow] X from a normal variety Y and a prime divisor E on Y such that a(E, X, [DELTA]) = -1 and that f (E) = W.
Then h(G) = p, where p is the smallest prime divisor of the order of the group.
Let p be the largest prime divisor of |H| and let P be a Sylow p-subgroup of H.
Throughout this paper, we assume that r is a common prime divisor of f and t.
Reciprocally, if ab|T(k), let p|b a prime divisor of b.
Let P(n) denotes the greatest prime divisor of n, if P(n) > [square root of n], then we have S(n) = P(n).
First we define four sets A, B, C, D as follows: A = {n, n [member of] N, n has only one prime divisor p such that p | n and [p.
Xu Zhefeng [4] proved the following conclusion: Let P(n) denotes the largest prime divisor of n, then for any real number x > 1, we have the asymptotic formula:
From the definition of g(n) we can easily deduce that for any prime [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] where P(n) denotes the largest prime divisor of n.
where P(n) is the greatest prime divisor of n, [zeta](s) is the Riemann zeta-function.