Examples of using Divisor in English and their translations into Russian
{-}
-
Official
-
Colloquial
Therefore, K, the divisor of ω is zero.
Divisor vertical- 80mm x 50mm x 5mm.
Dividend and divisor of ratio for 2009a.
It is thus a greatest common divisor.
Divide the divisor into the new balance.
Euclid's algorithm for finding the greatest common divisor of two numbers.
If m is a divisor of n then so is-m.
Ruffini's rule is a special case of synthetic division when the divisor is a linear factor.
The divisor of a meromorphic 1-form is defined similarly.
Compute the greatest common divisor of the set of numbers ke.
The divisor here equals 16S 2 where S is the area of the triangle.
Primitive" means that the greatest common divisor of the three side lengths equals 1.
Any divisor of this form is called a principal divisor. .
The result is multiplied by the divisor and subtract this product from the dividend.
The divisor is unitless, so tonnage would be expressed in'ft³ of tun.
Instead, it displays the dividend, divisor, and quotient(when it is found) in a tableau.
A divisor D is an element of the free abelian group on the points of the surface.
In an Artinian ring,each element is either invertible or a zero divisor.
This must be a divisor of x n- 1{\displaystyle x^{n}-1.
All primitive solutions can be obtained by dividing a, b, andc by their greatest common divisor.
The number is called a divisor of the number, and the number is a multiple of the number.
As in all division problems, one number, called the dividend,is divided by another, called the divisor, producing a result called the quotient.
The divisor of this division operation is the input data element[math]u_{nn}/math.
The various studies of the behaviour of the divisor function are sometimes called divisor problems.
Divisor function, an arithmetic function giving the number of divisors of an integer.
For example, for temperatures the value Divisor(Multiplier) of 10 is used to enable a one decimal place value to be transferred.
A divisor of a global meromorphic 1-form is called the canonical divisor usually denoted K.
S( x){\displaystyle S(x)} is the greatest common divisor of P( x){\displaystyle P(x)} and P′( x){\displaystyle P'x.
The divisor function counts the number of ways that the integer n can be written as a product of two integers.
To reduce a fraction you need to find the greatest common divisor of its numerator and denominator: GCD(m, n), and then divide the numerator and denominator by this number.
