Division

Arithmetic

Division is the arithmetic operation of splitting a quantity into equal groups or finding how many times one number goes into another.

Formula

\text{dividend} / \text{divisor} = \text{quotient} \ (+ \text{remainder})
Visualization

Definition

Division means sharing a number equally into groups, or finding out how many times one number fits into another, written with the division sign (/ or the division symbol). Division of $a$ by $b$ ($b \neq 0$) gives a quotient $q$ (and remainder $r$ for integers) such that $a = b \times q + r$ with $0 \le r < b$; for real numbers, $a / b = a \times (1/b)$, and division by zero is undefined. In a field $F$, division is defined as multiplication by the multiplicative inverse, $a / b = a \cdot b^{-1}$ for $b \neq 0$: fields are precisely the rings where every non-zero element has a multiplicative inverse, which is why $\mathbb{Z}$ is a ring but not a field (since $1/2$ is not an integer), while $\mathbb{Q}$, $\mathbb{R}$, and $\mathbb{C}$ are fields.

Example

$12 / 4 = 3$ means $12$ shared equally among $4$ groups gives $3$ in each, or that $4$ fits into $12$ exactly $3$ times; division is the opposite of multiplication, so if $3 \times 4 = 12$, then $12 / 4 = 3$ and $12 / 3 = 4$. $23 / 5 = 4$ remainder $3$ as integer division ($23 = 5 \times 4 + 3$), or $23 / 5 = 4.6$ as real division; note division is neither commutative nor associative. In $\mathbb{Z}_7$ (integers mod $7$): since $5 \cdot 3 = 15 \equiv 1 \pmod 7$, the inverse of $5$ is $3$, so $3 / 5 = 3 \cdot 3 = 9 \equiv 2 \pmod 7$.

Key Insight

Long division is a direct application of the division algorithm: at each step you find how many times the divisor fits into the current partial dividend, record the quotient digit, and find the new remainder. The Euclidean algorithm for GCD is based entirely on this repeated process of finding remainders, and because every Euclidean domain supports it, they share the key property that every ideal is principal.