KNOWPIA
WELCOME TO KNOWPIA

In mathematics, a **multiplicative inverse** or **reciprocal** for a number *x*, denoted by 1/*x* or *x*^{−1}, is a number which when multiplied by *x* yields the multiplicative identity, 1. The multiplicative inverse of a fraction *a*/*b* is *b*/*a*. For the multiplicative inverse of a real number, divide 1 by the number. For example, the reciprocal of 5 is one fifth (1/5 or 0.2), and the reciprocal of 0.25 is 1 divided by 0.25, or 4. The **reciprocal function**, the function *f*(*x*) that maps *x* to 1/*x*, is one of the simplest examples of a function which is its own inverse (an involution).

Multiplying by a number is the same as dividing by its reciprocal and vice versa. For example, multiplication by 4/5 (or 0.8) will give the same result as division by 5/4 (or 1.25). Therefore, multiplication by a number followed by multiplication by its reciprocal yields the original number (since the product of the number and its reciprocal is 1).

The term *reciprocal* was in common use at least as far back as the third edition of *Encyclopædia Britannica* (1797) to describe two numbers whose product is 1; geometrical quantities in inverse proportion are described as *reciprocall* in a 1570 translation of Euclid's *Elements*.^{[1]}

In the phrase *multiplicative inverse*, the qualifier *multiplicative* is often omitted and then tacitly understood (in contrast to the additive inverse). Multiplicative inverses can be defined over many mathematical domains as well as numbers. In these cases it can happen that *ab* ≠ *ba*; then "inverse" typically implies that an element is both a left and right inverse.

The notation *f* ^{−1} is sometimes also used for the inverse function of the function *f*, which is for most functions not equal to the multiplicative inverse. For example, the multiplicative inverse 1/(sin *x*) = (sin *x*)^{−1} is the cosecant of x, and not the inverse sine of *x* denoted by sin^{−1} *x* or arcsin *x*. The terminology difference *reciprocal* versus *inverse* is not sufficient to make this distinction, since many authors prefer the opposite naming convention, probably for historical reasons (for example in French, the inverse function is preferably called the bijection réciproque).

In the real numbers, zero does not have a reciprocal (division by zero is undefined) because no real number multiplied by 0 produces 1 (the product of any number with zero is zero). With the exception of zero, reciprocals of every real number are real, reciprocals of every rational number are rational, and reciprocals of every complex number are complex. The property that every element other than zero has a multiplicative inverse is part of the definition of a field, of which these are all examples. On the other hand, no integer other than 1 and −1 has an integer reciprocal, and so the integers are not a field.

In modular arithmetic, the modular multiplicative inverse of *a* is also defined: it is the number *x* such that *ax* ≡ 1 (mod *n*). This multiplicative inverse exists if and only if *a* and *n* are coprime. For example, the inverse of 3 modulo 11 is 4 because 4 ⋅ 3 ≡ 1 (mod 11). The extended Euclidean algorithm may be used to compute it.

The sedenions are an algebra in which every nonzero element has a multiplicative inverse, but which nonetheless has divisors of zero, that is, nonzero elements *x*, *y* such that *xy* = 0.

A square matrix has an inverse if and only if its determinant has an inverse in the coefficient ring. The linear map that has the matrix *A*^{−1} with respect to some base is then the inverse function of the map having *A* as matrix in the same base. Thus, the two distinct notions of the inverse of a function are strongly related in this case, but they still do not coincide, since the multiplicative inverse of *Ax* would be (*Ax*)^{−1}, not *A*^{−1}x.

These two notions of an inverse function do sometimes coincide, for example for the function where is the principal branch of the complex logarithm and :

- .

The trigonometric functions are related by the reciprocal identity: the cotangent is the reciprocal of the tangent; the secant is the reciprocal of the cosine; the cosecant is the reciprocal of the sine.

A ring in which every nonzero element has a multiplicative inverse is a division ring; likewise an algebra in which this holds is a division algebra.

As mentioned above, the reciprocal of every nonzero complex number *z* = *a* + *bi* is complex. It can be found by multiplying both top and bottom of 1/*z* by its complex conjugate and using the property that , the absolute value of *z* squared, which is the real number *a*^{2} + *b*^{2}:

The intuition is that

gives us the complex conjugate with a magnitude reduced to a value of , so dividing again by ensures that the magnitude is now equal to the reciprocal of the original magnitude as well, hence:

In particular, if ||*z*||=1 (*z* has unit magnitude), then . Consequently, the imaginary units, ±*i*, have additive inverse equal to multiplicative inverse, and are the only complex numbers with this property. For example, additive and multiplicative inverses of *i* are −(*i*) = −*i* and 1/*i* = −*i*, respectively.

For a complex number in polar form *z* = *r*(cos φ + *i* sin φ), the reciprocal simply takes the reciprocal of the magnitude and the negative of the angle:

In real calculus, the derivative of 1/*x* = *x*^{−1} is given by the power rule with the power −1:

The power rule for integrals (Cavalieri's quadrature formula) cannot be used to compute the integral of 1/*x*, because doing so would result in division by 0:

The reciprocal may be computed by hand with the use of long division.

Computing the reciprocal is important in many division algorithms, since the quotient *a*/*b* can be computed by first computing 1/*b* and then multiplying it by *a*. Noting that has a zero at *x* = 1/*b*, Newton's method can find that zero, starting with a guess and iterating using the rule:

This continues until the desired precision is reached. For example, suppose we wish to compute 1/17 ≈ 0.0588 with 3 digits of precision. Taking *x*_{0} = 0.1, the following sequence is produced:

*x*_{1}= 0.1(2 − 17 × 0.1) = 0.03*x*_{2}= 0.03(2 − 17 × 0.03) = 0.0447*x*_{3}= 0.0447(2 − 17 × 0.0447) ≈ 0.0554*x*_{4}= 0.0554(2 − 17 × 0.0554) ≈ 0.0586*x*_{5}= 0.0586(2 − 17 × 0.0586) ≈ 0.0588

A typical initial guess can be found by rounding *b* to a nearby power of 2, then using bit shifts to compute its reciprocal.

In constructive mathematics, for a real number *x* to have a reciprocal, it is not sufficient that *x* ≠ 0. There must instead be given a *rational* number *r* such that 0 < *r* < |*x*|. In terms of the approximation algorithm described above, this is needed to prove that the change in *y* will eventually become arbitrarily small.

This iteration can also be generalized to a wider sort of inverses; for example, matrix inverses.

Every real or complex number excluding zero has a reciprocal, and reciprocals of certain irrational numbers can have important special properties. Examples include the reciprocal of *e* (≈ 0.367879) and the golden ratio's reciprocal (≈ 0.618034). The first reciprocal is special because no other positive number can produce a lower number when put to the power of itself; is the global minimum of . The second number is the only positive number that is equal to its reciprocal plus one: . Its additive inverse is the only negative number that is equal to its reciprocal minus one: .

The function gives an infinite number of irrational numbers that differ with their reciprocal by an integer. For example, is the irrational . Its reciprocal is , exactly less. Such irrational numbers share an evident property: they have the same fractional part as their reciprocal, since these numbers differ by an integer.

The reciprocal function plays an important role in continued fractions, which have a number of remarkable properties relating to the representation of (both rational and) irrational numbers.

If the multiplication is associative, an element *x* with a multiplicative inverse cannot be a zero divisor (*x* is a zero divisor if some nonzero *y*, *xy* = 0). To see this, it is sufficient to multiply the equation *xy* = 0 by the inverse of *x* (on the left), and then simplify using associativity. In the absence of associativity, the sedenions provide a counterexample.

The converse does not hold: an element which is not a zero divisor is not guaranteed to have a multiplicative inverse.
Within **Z**, all integers except −1, 0, 1 provide examples; they are not zero divisors nor do they have inverses in **Z**.
If the ring or algebra is finite, however, then all elements *a* which are not zero divisors do have a (left and right) inverse. For, first observe that the map *f*(*x*) = *ax* must be injective: *f*(*x*) = *f*(*y*) implies *x* = *y*:

Distinct elements map to distinct elements, so the image consists of the same finite number of elements, and the map is necessarily surjective. Specifically, ƒ (namely multiplication by *a*) must map some element *x* to 1, *ax* = 1, so that *x* is an inverse for *a*.

The expansion of the reciprocal 1/*q* in any base can also act ^{[3]} as a source of pseudo-random numbers, if *q* is a "suitable" safe prime, a prime of the form 2*p* + 1 where *p* is also a prime. A sequence of pseudo-random numbers of length *q* − 1 will be produced by the expansion.

**^**"In equall Parallelipipedons the bases are reciprokall to their altitudes".*OED*"Reciprocal" §3a. Sir Henry Billingsley translation of Elements XI, 34.**^**Anthony, Dr. "Proof that INT(1/x)dx = lnx".*Ask Dr. Math*. Drexel University. Retrieved 22 March 2013.**^**Mitchell, Douglas W., "A nonlinear random number generator with known, long cycle length",*Cryptologia*17, January 1993, 55–62.

- Maximally Periodic Reciprocals, Matthews R.A.J.
*Bulletin of the Institute of Mathematics and its Applications*vol 28 pp 147–148 1992