Ads
related to: multiplicative inverse worksheet
Search results
Results From The WOW.Com Content Network
For every x except 0, y represents its multiplicative inverse. The graph forms a rectangular hyperbola. 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 ...
A modular multiplicative inverse of a modulo m can be found by using the extended Euclidean algorithm. The Euclidean algorithm determines the greatest common divisor (gcd) of two integers, say a and m. If a has a multiplicative inverse modulo m, this gcd must be 1. The last of several equations produced by the algorithm may be solved for this gcd.
The inverse or multiplicative inverse (for avoiding confusion with additive inverses) of a unit x is denoted , or, when the multiplication is commutative, . The additive identity 0 is never a unit, except when the ring is the zero ring, which has 0 as its unique element.
In fact, the rules for additive and multiplicative inverses are both examples of applying a strictly monotonically decreasing function. A few examples of this rule are: Raising both sides of an inequality to a power n > 0 (equiv., − n < 0), when a and b are positive real numbers:
The conditions for existence of left-inverse or right-inverse are more complicated, since a notion of rank does not exist over rings. The set of n × n invertible matrices together with the operation of matrix multiplication and entries from ring R form a group, the general linear group of degree n, denoted GL n (R).
Integer multiplication respects the congruence classes, that is, a ≡ a' and b ≡ b' (mod n) implies ab ≡ a'b' (mod n). This implies that the multiplication is associative, commutative, and that the class of 1 is the unique multiplicative identity. Finally, given a, the multiplicative inverse of a modulo n is an integer x satisfying ax ≡ ...