greatest common divisor
greatest common factor

That is the greatest common divisor of 54 and 24.

And then that is the way you're able to find the greatest common divisor.

For example, the set of all even numbers has 2 as the greatest common divisor.

It is able to find the greatest common divisor of two numbers.

This is equivalent to their greatest common divisor being 1.

Euclid came up with the idea of greatest common divisors.

In other words, the greatest common divisor of all the smaller side lengths should be 1.

Suppose it is desired to find the greatest common divisor of 48 and 180.

There are several ways to find the greatest common divisor of two polynomials.

Dividing by their greatest common divisor is an obvious way to improve the running time.

The greatest common divisor of two numbers is a computable function.

In order to find the greatest common divisor, the Euclidean algorithm may be used.

There are some that use greatest common divisors.

Note that with this definition, two elements a and b may very well have several greatest common divisors, or none at all.

It can be fully reduced to lowest terms if both are divided by their greatest common divisor.

Greatest lower bounds in turn are given by the greatest common divisor.

The latter indicates that the greatest common divisor of all integers in the set is 1.

The greatest common divisor is useful for reducing fractions to be in lowest terms.

For a given cycle C, every element has the same greatest common divisor .

Compute the greatest common divisor of the set of numbers k.

It is thus a greatest common divisor.

Pages 859-861 of section 31.2: Greatest common divisor.

The proof is based on Euclid's algorithm for finding the greatest common divisor of natural numbers.

The greatest common divisor and least common multiple functions act associatively.

If "a" 0 or "b" 0 they have a greatest common divisor.

The subscripts are then reduced by the greatest common factor.

Correspondingly, all intervals and chords can be expanded into a harmony by calculating the greatest common factor of the set, f, and its smallest common divisor, s, resulting in the harmony as H(s/f).

It's that, if two different public keys share one prime number, this algorithm instantly, I mean, easily finds the common prime because that will be the greatest common factor that these two public keys share.

So Euclid figured out, like in 300 B.C., that there was a cool way of finding the greatest common divisor, the GCD, also the greatest common factor, the GCF, same thing basically, of any two numbers.

Many school age children are taught the term greatest common factor (GCF) instead of the greatest common divisor(GCD); therefore, for those familiar with the concept of GCF, substitute GCF when GCD is used below.