common divisor


Also found in: Dictionary, Thesaurus, Financial, Wikipedia.
Related to common divisor: gcd

common divisor

[′käm·ən di′vīz·ər]
(mathematics)
For a set of integers, an integer c such that each of the integers in the set is divisible by c. Also known as common factor.
References in periodicals archive ?
f] = 1, for f the greatest common divisor of the elements [[alpha].
If every subtractive subsemimodule of a semimodule A over a semiring R is cyclic, then every nonempty subset of A has a greatest common divisor.
24) Balinski and Young, in Fair Representation, refer to these as divisor methods because they use a common divisor.
In grouped replicated designs, the number of groups (n) into which R is splitted is determined by the largest common divisor (n) of coordinates x and y (Fig.
1,2,9] Another feature of this configuration is the fact that if K and F have a common divisor larger than 1 (ged (K,F) = Z [greater than] 1), the spurs will show at [f.
This problem may be used as a simple application of greatest common divisor (GCD) of two positive integers.
The assumption that the greatest common divisor of {k [member of] N | [a.
A rational number d is said to be the greatest common divisor of a and b if d is a divisor of both a and b and if e is any other common divisor of a and b, then d [greater than or equal to] e.
Among the topics are multivariate ultrametric root counting, efficient polynomial system solving by numerical methods, a search for an optimal start system for numerical homotopy continuation, dense fewnomials, and the numerical greatest common divisor of univariate polynomials.
Let (a, b) = d denotes the Greatest Common Divisor of a and b, and a = d x [a.
Using computer, Stephens [10] found the example about r as follows: for p = 17 and q = 3313, r = 112643 = 2pq + 1 is the greatest common divisor of f and t.
To understand the statement of Dirichlet's theorem, recall that given two integers a and b, their greatest common divisor is the largest integer which is a divisor of both a and b; we denote it gcd(a,b).