common divisor


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

common divisor

n.
A quantity that is a factor of two or more quantities. Also called common factor.

common divisor

n
(Mathematics) another name for common factor

com′mon divi′sor


n.
a number that is a submultiple of all the numbers of a given set. Also called com′mon fac′tor.
[1840–50]

common divisor

A number that is a factor of two or more numbers. For example, 3 is a common divisor of both 9 and 15. Also called common factor.
ThesaurusAntonymsRelated WordsSynonymsLegend:
Noun1.common divisor - an integer that divides two (or more) other integers evenly
divisor, factor - one of two or more integers that can be exactly divided into another integer; "what are the 4 factors of 6?"
greatest common divisor, greatest common factor, highest common factor - the largest integer that divides without remainder into a set of integers
References in periodicals archive ?
The Chinese Dream has embodied the greatest common divisor of the Chinese people's common pursuit for a better life, and the community with a shared future for mankind has represented the greatest common divisor of all peoples in the world for peace, development and prosperity.
Chapters discuss the pigeonhole principle, the greatest common divisor, squares, digital sums, arithmetic and geometric progressions, complementary sequences, quadratic functions and equations, parametric solutions for real equations, the scalar project, equilateral triangles in the complex plane, recurrence relations, sequences given by implicit relations, and matrices associated to second order recurrences.
If a & b are both even, GCD (a, b) = 2 * GCD (a/2, b/2) because 2 is a common divisor.
let, GCD be the greatest common divisor of screen dimensions SW and SH.
The earliest instances of algorithms include Euclid's function of greatest common divisor in numerics, Archimedes' approximation of Pi, and Eratosthenes' calculation of prime numbers.
The Euclidean algorithm for finding the greatest common divisor is applicable.
This type of modular multiplication is closely related to the Euclidean algorithm that determines the greatest common divisor between two integers by a process of successive division by the remainder from the previous operation.
i](z) is the monic greatest common divisor of all minors of order i in D(z), i=1,2,.
So if g is the greatest common divisor of the [[alpha].
What is striking about the sequence {30, 42, 54, 66, 78, 90, 144} is that the Greatest Common Divisor (CGD) for its 7 members is 6, which is a 'perfect number' because it equals the sum of its proper divisors (1+2+3=6).
In Section 3, we discuss the concept of the greatest common divisors in the semimodules and show that for any Euclidean semimodule A in which every cyclic subsemimodule is subtractive, then every nonempty finite subset of A has a greatest common divisor.
Algorithm," she reads, "a set of rules for solving a problem in a finite number of steps, as for finding the greatest common divisor.