Divisor

Premodernism was the divisor of the waters between these two movements.

The Euclidean algorithm serves not only to determine the greatest common divisor between two whole numbers, but also to solve Diophantine equations.

The Euclidean algorithm serves not only to determine the greatest common divisor between two integers, but also to solve Diophantine equations.

The greatest common divisor of six and ten is two.

In "42 ÷ 3" the divisor is the 3.

10 is a divisor of 100, but not of 101.

The positive divisors of 6 are 1, 2, 3 and 6.