Division (mathematics)

Division is often introduced through the notion of "sharing out" a set of objects, for example a pile of lollies, into a number of equal portions. Distributing the objects several at a time in each round of sharing to each portion leads to the idea of 'chunking' – a form of division where one repeatedly subtracts multiples of the divisor from the dividend itself.

By allowing one to subtract more multiples than what the partial remainder allows at a given stage, more flexible methods, such as the bidirectional variant of chunking, can be developed as well.

More systematically and more efficiently, two integers can be divided with pencil and paper with the method of short division, if the divisor is small, or long division, if the divisor is larger. If the dividend has a fractional part (expressed as a decimal fraction), one can continue the procedure past the ones place as far as desired. If the divisor has a fractional part, one can restate the problem by moving the decimal to the right in both numbers until the divisor has no fraction, which can make the problem easier to solve (e.g., 10/2.5 = 100/25 = 4).

Division can be calculated with an abacus.[13]

Logarithm tables can be used to divide two numbers, by subtracting the two numbers' logarithms, then looking up the antilogarithm of the result.

Division can be calculated with a slide rule by aligning the divisor on the C scale with the dividend on the D scale. The quotient can be found on the D scale where it is aligned with the left index on the C scale. The user is responsible, however, for mentally keeping track of the decimal point.

Modern calculators and computers compute division either by methods similar to long division, or by faster methods; see Division algorithm.

In modular arithmetic (modulo a prime number) and for real numbers, nonzero numbers have a multiplicative inverse. In these cases, a division by x may be computed as the product by the multiplicative inverse of x. This approach is often associated with the faster methods in computer arithmetic.

Euclidean division is the mathematical formulation of the outcome of the usual process of division of integers. It asserts that, given two integers, a, the dividend, and b, the divisor, such that b ≠ 0, there are unique integers q, the quotient, and r, the remainder, such that a = bq + r and 0 ≤ r < |b|, where |b| denotes the absolute value of b.

Integers are not closed under division. Apart from division by zero being undefined, the quotient is not an integer unless the dividend is an integer multiple of the divisor. For example, 26 cannot be divided by 11 to give an integer. Such a case uses one of five approaches:

1. Say that 26 cannot be divided by 11; division becomes a partial function.
2. Give an approximate answer as a floating-point number. This is the approach usually taken in numerical computation.
3. Give the answer as a fraction representing a rational number, so the result of the division of 26 by 11 is ${\displaystyle {\tfrac {26}{11}}}$ (or as a mixed number, so ${\displaystyle {\tfrac {26}{11}}=2{\tfrac {4}{11}}.}$) Usually the resulting fraction should be simplified: the result of the division of 52 by 22 is also ${\displaystyle {\tfrac {26}{11}}}$. This simplification may be done by factoring out the greatest common divisor.
4. Give the answer as an integer quotient and a remainder, so ${\displaystyle {\tfrac {26}{11}}=2{\mbox{ remainder }}4.}$ To make the distinction with the previous case, this division, with two integers as result, is sometimes called Euclidean division, because it is the basis of the Euclidean algorithm.
5. Give the integer quotient as the answer, so ${\displaystyle {\tfrac {26}{11}}=2.}$ This is the floor function applied to case 2 or 3. It is sometimes called integer division, and denoted by "//".

Dividing integers in a computer program requires special care. Some programming languages treat integer division as in case 5 above, so the answer is an integer. Other languages, such as MATLAB and every computer algebra system return a rational number as the answer, as in case 3 above. These languages also provide functions to get the results of the other cases, either directly or from the result of case 3.

Names and symbols used for integer division include div, /, \, and %. Definitions vary regarding integer division when the dividend or the divisor is negative: rounding may be toward zero (so called T-division) or toward −∞ (F-division); rarer styles can occur – see modulo operation for the details.

Divisibility rules can sometimes be used to quickly determine whether one integer divides exactly into another.

The result of dividing two rational numbers is another rational number when the divisor is not 0. The division of two rational numbers p/q and r/s can be computed as

${\displaystyle {p/q \over r/s}={p \over q}\times {s \over r}={ps \over qr}.}$

All four quantities are integers, and only p may be 0. This definition ensures that division is the inverse operation of multiplication.

Division of two real numbers results in another real number (when the divisor is nonzero). It is defined such that a/b = c if and only if a = cb and b ≠ 0.

Dividing two complex numbers (when the divisor is nonzero) results in another complex number, which is found using the conjugate of the denominator:

${\displaystyle {p+iq \over r+is}={(p+iq)(r-is) \over (r+is)(r-is)}={pr+qs+i(qr-ps) \over r^{2}+s^{2}}={pr+qs \over r^{2}+s^{2}}+i{qr-ps \over r^{2}+s^{2}}.}$

This process of multiplying and dividing by ${\displaystyle r-is}$ is called 'realisation' or (by analogy) rationalisation. All four quantities p, q, r, s are real numbers, and r and s may not both be 0.

Division for complex numbers expressed in polar form is simpler than the definition above:

${\displaystyle {pe^{iq} \over re^{is}}={pe^{iq}e^{-is} \over re^{is}e^{-is}}={p \over r}e^{i(q-s)}.}$

Again all four quantities p, q, r, s are real numbers, and r may not be 0.

One can define the division operation for polynomials in one variable over a field. Then, as in the case of integers, one has a remainder. See Euclidean division of polynomials, and, for hand-written computation, polynomial long division or synthetic division.

One can define a division operation for matrices. The usual way to do this is to define A / B = AB⁻¹, where B⁻¹ denotes the inverse of B, but it is far more common to write out AB⁻¹ explicitly to avoid confusion. An elementwise division can also be defined in terms of the Hadamard product.

Because matrix multiplication is not commutative, one can also define a left division or so-called backslash-division as A \ B = A⁻¹B. For this to be well defined, B⁻¹ need not exist, however A⁻¹ does need to exist. To avoid confusion, division as defined by A / B = AB⁻¹ is sometimes called right division or slash-division in this context.

Note that with left and right division defined this way, A / (BC) is in general not the same as (A / B) / C, nor is (AB) \ C the same as A \ (B \ C). However, it holds that A / (BC) = (A / C) / B and (AB) \ C = B \ (A \ C).

To avoid problems when A⁻¹ and/or B⁻¹ do not exist, division can also be defined as multiplication by the pseudoinverse. That is, A / B = AB⁺ and A \ B = A⁺B, where A⁺ and B⁺ denote the pseudoinverses of A and B.

In abstract algebra, given a magma with binary operation ∗ (which could nominally be termed multiplication), left division of b by a (written a \ b) is typically defined as the solution x to the equation a ∗ x = b, if this exists and is unique. Similarly, right division of b by a (written b / a) is the solution y to the equation y ∗ a = b. Division in this sense does not require ∗ to have any particular properties (such as commutativity, associativity, or an identity element).

"Division" in the sense of "cancellation" can be done in any magma by an element with the cancellation property. Examples include matrix algebras and quaternion algebras. A quasigroup is a structure in which division is always possible, even without an identity element and hence inverses. In an integral domain, where not every element need have an inverse, division by a cancellative element a can still be performed on elements of the form ab or ca by left or right cancellation, respectively. If a ring is finite and every nonzero element is cancellative, then by an application of the pigeonhole principle, every nonzero element of the ring is invertible, and division by any nonzero element is possible. To learn about when algebras (in the technical sense) have a division operation, refer to the page on division algebras. In particular Bott periodicity can be used to show that any real normed division algebra must be isomorphic to either the real numbers R, the complex numbers C, the quaternions H, or the octonions O.

The derivative of the quotient of two functions is given by the quotient rule:

${\displaystyle {\left({\frac {f}{g}}\right)}'={\frac {f'g-fg'}{g^{2}}}.}$