From Wikipedia, the free encyclopedia - View original article

This article is about the arithmetical operation. For other uses, see Division (disambiguation).

"Divided" redirects here. For other uses, see Divided (disambiguation).

In mathematics, especially in elementary arithmetic, **division** (÷) is an arithmetic operation. Specifically, if *b* times *c* equals *a*, written:

*a*=*b*×*c*

where *b* is not zero, then *a* divided by *b* equals *c*, written:

*a*÷*b*=*c*

For instance,

- 6 ÷ 3 = 2

since

- 3 x 2 = 6

In the expression a ÷ b = c, *a* is called the **dividend** or **numerator**, *b* the **divisor** or **denominator** and the result *c* is called the **quotient**.

Conceptually, division describes two distinct but related settings. *Partitioning* involves taking a set of size *a* and forming *b* groups that are equal in size. The size of each group formed, *c*, is the quotient of *a* and *b*. *Quotative* division involves taking a set of size *a* and forming groups of size *c*. The number of groups of this size that can be formed, *b*, is the quotient of *a* and *c*.^{[1]}

Teaching division usually leads to the concept of fractions being introduced to students. Unlike addition, subtraction, and multiplication, the set of all integers is not closed under division. Dividing two integers may result in a remainder. To complete the division of the remainder, the number system is extended to include fractions or rational numbers as they are more generally called.

Division is often shown in algebra and science by placing the *dividend* over the *divisor* with a horizontal line, also called a vinculum or fraction bar, between them. For example, *a* divided by *b* is written

This can be read out loud as "a divided by b", "a by b" or "a over b". A way to express division all on one line is to write the *dividend* (or numerator), then a slash, then the *divisor* (or denominator), like this:

This is the usual way to specify division in most computer programming languages since it can easily be typed as a simple sequence of ASCII characters.

A typographical variation halfway between these two forms uses a solidus (fraction slash) but elevates the dividend, and lowers the divisor:

^{a}⁄_{b}

Any of these forms can be used to display a fraction. A fraction is a division expression where both dividend and divisor are integers (although typically called the *numerator* and *denominator*), and there is no implication that the division must be evaluated further. A second way to show division is to use the obelus (or division sign), common in arithmetic, in this manner:

This form is infrequent except in elementary arithmetic. ISO 80000-2-9.6 states it should not be used. The obelus is also used alone to represent the division operation itself, as for instance as a label on a key of a calculator.

In some non-English-speaking cultures, "a divided by b" is written *a* : *b*. This notation was introduced in 1631 by William Oughtred in his *Clavis Mathematicae* and later popularized by Gottfried Wilhelm Leibniz.^{[2]} However, in English usage the colon is restricted to expressing the related concept of ratios (then "a is to b").

In elementary mathematics the notation or is used to denote *a* divided by *b*. This notation was first introduced by Michael Stifel in *Arithmetica integra*, published in 1544.^{[2]}

Main article: Division algorithm

Division is often introduced through the notion of "sharing out" a set of objects, for example a pile of sweets, 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", i.e., division by repeated subtraction.

More systematic and more efficient (but also more formalised and more rule-based, and more removed from an overall holistic picture of what division is achieving), a person who knows the multiplication tables can divide two integers using pencil and paper using the method of short division, if the divisor is simple. Long division is used for larger integer divisors. If the dividend has a fractional part (expressed as a decimal fraction), one can continue the algorithm past the ones place as far as desired. If the divisor has a fractional part, we can restate the problem by moving the decimal to the right in both numbers until the divisor has no fraction.

A person can calculate division with an abacus by repeatedly placing the dividend on the abacus, and then subtracting the divisor the offset of each digit in the result, counting the number of divisions possible at each offset.

A person can use logarithm tables to divide two numbers, by subtracting the two numbers' logarithms, then looking up the antilogarithm of the result.

A person can calculate division 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 computers compute division by methods that are faster than long division: see Division algorithm.

In modular arithmetic, some numbers have a multiplicative inverse with respect to the modulus. We can calculate division by multiplication in such a case. This approach is useful in computers that do not have a fast division instruction.

Main article: Euclidean division

The division algorithm is a mathematical theorem that precisely expresses the outcome of the usual process of division of integers. In particular, the theorem asserts that integers called the quotient *q* and remainder *r* always exist and that they are uniquely determined by the dividend *a* and divisor *d*, with *d* ≠ 0. Formally, the theorem is stated as follows: There exist unique integers *q* and *r* such that *a* = *qd* + *r* and 0 ≤ *r* < | *d* |, where | *d* | denotes the absolute value of *d*.

Division of integers is not closed. 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:

- Say that 26 cannot be divided by 11; division becomes a partial function.
- Give an approximate answer as a decimal fraction or a mixed number, so or This is the approach usually taken in numerical computation.
- Give the answer as a fraction representing a rational number, so the result of the division of 26 by 11 is But, usually, the resulting fraction should be simplified: the result of the division of 52 by 22 is also This simplification may be done by factoring out the greatest common divisor computed by mean of Euclidean algorithm.
- Give the answer as an integer
*quotient*and a*remainder*, so 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 Euclidean algorithm. - Give the integer quotient as the answer, so This is sometimes called
*integer division*.

Dividing integers in a computer program requires special care. Some programming languages, such as C, 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. We may define division of two rational numbers *p*/*q* and *r*/*s* by

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 not 0. It is defined such *a*/*b* = *c* if and only if *a* = *cb* and *b* ≠ 0.

Main article: Division by zero

Division of any number by zero (where the divisor is zero) is undefined. This is because zero multiplied by any finite number always results in a product of zero. Entry of such an expression into most calculators produces an error message.

Dividing two complex numbers results in another complex number when the divisor is not 0, defined thus:

All four quantities are real numbers. *r* and *s* may not both be 0.

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

Again all four quantities are real numbers. *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*^{−1}, where *B*^{−1} denotes the inverse of *B*, but it is far more common to write out *AB*^{−1} explicitly to avoid confusion.

Because matrix multiplication is not commutative, one can also define a left division or so-called *backslash-division* as *A* \ *B* = *A*^{−1}*B*. For this to be well defined, *B*^{−1} need not exist, however *A*^{−1} does need to exist. To avoid confusion, division as defined by *A* / *B* = *AB*^{−1} 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* and nor is (*AB*)\*C* the same as *A*\(*B*\*C*), but *A*/(*BC*) = (*A*/*C*)/*B* and (*AB*)\*C* = *B*\(*A*\*C*).

To avoid problems when *A*^{−1} and/or *B*^{−1} do not exist, division can also be defined as multiplication with the pseudoinverse, i.e., *A* / *B* = *AB*^{+} and *A* \ *B* = *A*^{+}*B*, where *A*^{+} and *B*^{+} denote the pseudoinverse of *A* and *B*.

In abstract algebras such as matrix algebras and quaternion algebras, fractions such as are typically defined as or where is presumed an invertible element (i.e., there exists a multiplicative inverse such that where is the multiplicative identity). In an integral domain where such elements may not exist, *division* can still be performed on equations of the form or by left or right cancellation, respectively. More generally "division" in the sense of "cancellation" can be done in any ring with the aforementioned cancellation properties. If such a ring is finite, then by an application of the pigeonhole principle, every nonzero element of the ring is invertible, so *division* by any nonzero element is possible in such a ring. 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:

There is no general method to integrate the quotient of two functions.

- 400AD Sunzi division algorithm
- Fraction (mathematics)
- Division by two
- Field
- Galley division
- Group
- Inverse element
- Order of operations
- Quasigroup (left division)
- Repeating decimal

**^**Fosnot and Dolk 2001.*Young Mathematicians at Work: Constructing Multiplication and Division*. Portsmouth, NH: Heinemann.- ^
^{a}^{b}Earliest Uses of Symbols of Operation, Jeff MIller

Wikimedia Commons has media related to .Division (mathematics) |

- Division, PlanetMath.org.
- Division on a Japanese abacus selected from Abacus: Mystery of the Bead
- Chinese Short Division Techniques on a Suan Pan
- Rules of divisibility

This article includes a list of references, but its sources remain unclear because it has insufficient inline citations. (February 2008) |