In mathematics, a divisor of an integer n , {\displaystyle n,} also called a factor of n , {\displaystyle n,} is an integer m {\displaystyle m} that may...

In mathematics, the greatest common divisor (GCD), also known as greatest common factor (GCF), of two or more integers, which are not all zero, is the...

In abstract algebra, an element a of a ring R is called a left zero divisor if there exists a nonzero x in R such that ax = 0, or equivalently if the...

number theory, a divisor function is an arithmetic function related to the divisors of an integer. When referred to as the divisor function, it counts...

divisors are a generalization of codimension-1 subvarieties of algebraic varieties. Two different generalizations are in common use, Cartier divisors...

A divisor is the second operand of a division. A divisor may also refer to Divisor (number theory), an integer that divides evenly another integer Divisor...

What is being divided is called the dividend, which is divided by the divisor, and the result is called the quotient. At an elementary level the division...

the sum of the prices of all thirty stocks divided by a divisor, the Dow Divisor. The divisor is adjusted in case of stock splits, spinoffs or similar...

Sierra del Divisor is a mountain range located in the border between Peru and Brazil, rising up from the Amazonian plain. It is the only mountainous area...

In algebraic geometry, a linear system of divisors is an algebraic generalization of the geometric notion of a family of curves; the dimension of the linear...

In algebra, the elementary divisors of a module over a principal ideal domain (PID) occur in one form of the structure theorem for finitely generated modules...

Euclid's algorithm, is an efficient method for computing the greatest common divisor (GCD) of two integers (numbers), the largest number that divides them both...

V {\displaystyle V} , and any divisor in it may be called a canonical divisor. An anticanonical divisor is any divisor − K {\displaystyle K} with K {\displaystyle...

theorem: Bézout's identity — Let a and b be integers with greatest common divisor d. Then there exist integers x and y such that ax + by = d. Moreover, the...

problems, one number, called the dividend, is divided by another, called the divisor, producing a result called the quotient. It enables computations involving...

Euclidean algorithm, and computes, in addition to the greatest common divisor (gcd) of integers a and b, also the coefficients of Bézout's identity,...

The lowest common divisor is a term often mistakenly used to refer to: Lowest common denominator, the lowest common multiple of the denominators of a...

set up divisor (13) for second division loop (MEMORY LAYOUT: zero copy dividend divisor remainder quotient zero zero) >-[>+>>] Reduce divisor; Normal...

mathematics, a natural number a is a unitary divisor (or Hall divisor) of a number b if a is a divisor of b and if a and b a {\displaystyle {\frac {b}{a}}}...

divisors of the numbers 1 to 1000. A divisor of an integer n is an integer m, for which n/m is again an integer (which is necessarily also a divisor of...

The highest averages, divisor, or divide-and-round methods are a family of apportionment algorithms that aim to fairly divide a legislature between several...

evenly. Every natural number has both 1 and itself as a divisor. If it has any other divisor, it cannot be prime. This leads to an equivalent definition...

the polynomial divisor with the bits above it. The bits not above the divisor are simply copied directly below for that step. The divisor is then shifted...

harmonic divisor number or Ore number is a positive integer whose divisors have a harmonic mean that is an integer. The first few harmonic divisor numbers...

combinatorial commutative algebra, a zero-divisor graph is an undirected graph representing the zero divisors of a commutative ring. It has elements of...

In algebraic geometry, a divisorial scheme is a scheme admitting an ample family of line bundles, as opposed to an ample line bundle. In particular, a...

divisor along which one allows mild logarithmic singularities. They were studied by Iitaka (1976). A boundary Q-divisor on a variety is a Q-divisor D...

In mathematics, the theta divisor Θ is the divisor in the sense of algebraic geometry defined on an abelian variety A over the complex numbers (and principally...

particularly ring theory, maximal common divisors are an abstraction of the number theory concept of greatest common divisor (GCD). This definition is slightly...

integers. Equivalently, it is a positive integer that has at least one divisor other than 1 and itself. Every positive integer is composite, prime, or...