Multiplication
Multiplication is the arithmetic operation of repeated addition, combining equal groups to find a product.
Formula
a \times b = \text{product}
Definition
Multiplication is a fast way to add equal groups: instead of adding the same number over and over, you multiply to get the answer quickly, and the result is called the product. As a binary operation on numbers, for positive integers $a \times b$ is the sum of $b$ copies of $a$, with key properties commutative ($a \times b = b \times a$), associative ($(a \times b) \times c = a \times (b \times c)$), distributive over addition ($a \times (b + c) = a \times b + a \times c$), and identity element $1$. Multiplication is one of the two operations defining a ring $(R, +, *)$, requiring that $*$ is associative, distributes over $+$, and has an identity; commutativity is an additional property that $\mathbb{Z}$, $\mathbb{Q}$, $\mathbb{R}$, and $\mathbb{C}$ all satisfy, while matrix multiplication does not.
Example
$4 \times 3 = 12$ means four groups of three: $3 + 3 + 3 + 3 = 12$, faster than counting all $12$. $(-3) \times (-4) = 12$ (negative times negative is positive), and $6 \times (10 + 2) = 6 \times 10 + 6 \times 2 = 72$ shows the distributive property in action. Fast multiplication algorithms improve on this idea at scale: grade-school multiplication is $O(n^2)$, Karatsuba (1960) is $O(n^{1.585})$, and Schonhage-Strassen uses FFT for $O(n \log n \log \log n)$, which matters practically for cryptographic computations with $2048$-bit integers.
Key Insight
Multiplication is a shortcut for repeated addition, and knowing your multiplication tables lets you skip the slow counting. The distributive property links multiplication and addition and is the foundation of all algebraic manipulation, from simplifying expressions to the FOIL method and beyond. This single law, $a(b+c) = ab + ac$, connects the additive and multiplicative structures of a ring and is why polynomial manipulation, matrix algebra, and number theory all share the same form.