Preposition: of

• n: Then 3 does not divide n; each prime divisor of n divides m.

• integer: The mathematics behind RSA is classical Number Theory: Division with remainder, Euclidean algorithm for finding the greatest common divisor of two integers.

• polynomial: This function returns the greatest common divisor of these polynomials.

Converse of object

• find: It is used to find the greatest common divisor, or highest common factor, of two given numbers.

• have: We say that integers a and b have a common divisor c if c is a divisor if both a and b.

• compute: Note that this function may for many matrices not be the best choice for computing all elementary divisors.

• use: The software will then use a divisor of 1 to set the highest speed.

• calculate: To calculate the greatest common divisor of two integers and of two polynomials over a field.

• lower: As we keep lowering the divisor, more parties will get seats, more seats will be awarded.

Adjective modifier

• elementary: An upper bound d for the highest power of p appearing in an elementary divisor of A must be given.

• prime: Then 3 does not divide n; each prime divisor of n divides m.

• common: It is used to find the greatest common divisor, or highest common factor, of two given numbers.

• great: It is used to find the greatest common divisor, or highest common factor, of two given numbers.

• positive: Perfect Numbers:- This is the series of numbers which are equal to the sum of all of its positive divisors, excluding itself.

• big: Here det must be an integer which is a multiple of the biggest determinant divisor of A.

Modifies a noun

• length: Have GAP print a list of length 100 whose n th entry is the divisor length of n.

• problem: To construct solutions of the same nature for the nonlinear partial differential equations is a small divisor problem in general.

• definition: But Webster's divisor definition has the best brevity.