prime factor

(redirected from Prime divisor)
Also found in: Thesaurus, Encyclopedia.
Related to Prime divisor: Prime number theory
ThesaurusAntonymsRelated WordsSynonymsLegend: factor - the prime factors of a quantity are all of the prime quantities that will exactly divide the given quantity
divisor, factor - one of two or more integers that can be exactly divided into another integer; "what are the 4 factors of 6?"
Mentioned in ?
References in periodicals archive ?
2) for any [phi]-exceptional prime divisor D on X, we have
At this point Carrie abandoned Euclid's proof and instead described a different proof of the irrationality of [square root of 2] she had encountered in a previous number theory course which, when extended to [square root of n], examined the prime factorisation of n and, in particular, a prime divisor a of n so that the maximum power k for which [a.
p] is a loose Mersenne prime, which is any integral prime divisor of a Mersenne composite.
Proof Correctness Methods Applied to an Algorithm for Finding an Integer's Smallest Prime Divisor.
Algorithm 4: [phi] = Prime Divisor Distance-2 Coloring(H [member of] [{0, 1}.
Such a strategy predicts that: (1) the lowest prime divisor of a non-prime will determine the ease with which that number is recognized as a non-prime; and (2) as a corollary, primes will be harder to identify than non-primes.
In this case, the exceptional locus Exc(f) of f is a prime divisor on X and (Y, [[DELTA].
Both in Derek's and Magnus's optimal strategy a subgroup H of order n/p will be chosen, where p is the smallest odd prime divisor of n (if there is no such p then the statement follows from Theorem 2.
3]If H is a subgroup of G with |G : H| = p, where p is the smallest prime divisor of |G|, then H [?
The exceptional divisor of this blow-up determines a prime divisor E C X' such that [mult.
If a prime divisor v of an integer a in N is not decomposed in [B.
Let P be a Sylow p-subgroup of a group G, where p is the smallest prime divisor of [absolute value of G].