top

a⁻¹ = 1/a

a⁻ⁿ = (aⁿ)⁻¹ = 1/aⁿ

top

$a^\; =\; a^m\; cdot\; a^n$

$(a^m)^n\; =\; a^\; !,$

top

top

top

top

top

i⁴ⁿ⁺¹ = i

i⁴ⁿ⁺² = −1

i⁴ⁿ⁺³ = −i

i⁴ⁿ⁺⁴ = 1

top

$eapprox\; 2.71828.$

$e^x$

---

top

left( lim_{m
ightarrow pminfty} left(1+rac
ight) ^m
ight) ^x

---

top

lim_{m
ightarrow pminfty} left(left(1+rac
ight) ^m
ight) ^x

---

top

lim_{m
ightarrow pminfty} left(1+rac
ight) ^

---

top

lim_{mx
ightarrow pminfty} left(1+rac
ight) ^

---

top

lim_{n
ightarrow pminfty} left(1+rac
ight) ^n
.

The right hand side generalizes the meaning of e^x so that x does not have to be a non-zero integer but can be zero, a fraction, a real number, a complex number, or a square matrix.

(See Characterizations of the exponential function for equivalent alternate definitions.)

---

top

Real powers of positive real numbers
Raising a positive real number to a power that is not an integer can also be explained in other ways:

Defining fractional exponents in terms of ''n^th'' roots. This method is perhaps the way most widely taught in schools.

Defining the natural logarithm as the area under the curve 1/x.

The identities and properties shown above are true for non-integer exponents as well.

---

top

Fractional exponent

For a given exponent, the inverse of exponentiation is extracting a root.

If $a$ is a positive real number, and n is a positive integer, then the positive real solution to the equation

$x^n\; =\; a$

is called the n^th root of $a$

$x=a^$

For example: 8^1/3 = 2.

Exponentiation with a rational exponent $m/n$ can now be defined as

$a^\; =\; left(a^$

ight)^m
For example: 8^2/3 = 4.

Since any real number can be approximated by rational numbers, exponentiation to an arbitrary real exponent can be defined by continuity. For example, if

$k\; approx\; 1.732$

we can assume

$5^k\; approx\; 5^$

---

top

Logarithm method
For a given base, the inverse of exponentiation is taking a logarithm.

If a and b are positive real numbers, then the real solution x to the equation

b^x = a

is called the logarithm of a, base b.

x = log_b(a)

So, exponentiation is sometimes called the antilogarithm.

Define the natural logarithm, ln, of a positive real number, a, as the area under the curve 1/x between from x = 1 to x = a. (The area is negative if a < 1). In terms of integral calculus:

The exponential function e^x is the inverse function to the natural logarithm.

a = e^ln(a)

Exponentiation in any positive real base, b, can be expressed as:

b^x = e^{x ln(b)}

---

top

Summary
Integer powers of complex numbers was defined recursively above:

z⁰ = 1

zⁿ⁺¹ = z·zⁿ

z⁻ⁿ = 1/zⁿ (for z ≠ 0).

Complex powers of e was defined above.

ight)^n

Complex powers of a complex number:

a^z = e^bz

if

a = e^b

---

top

Trigonometry
From Euler's formula, the purely imaginary powers of e define the real trigonometric functions cosine and sine:

$e^=cos(x)\; +\; i\; sin(x)$

$e^=cos(x)\; -\; i\; sin(x)$

such that

$cos(x)\; =\; (e^\; +\; e^)\; /$

$sin(x)\; =\; (e^\; -\; e^)\; /$

---

top

Primitive and principal logarithms of unity
There exists a positive real number, π, such that any solution to the equation: e^z = 1
is of the form z = 2πi·n where n is some integer.
(These logarithms of unity constitute an additive group because unity constitutes a multiplicative group.)
The number 2πi = 2πi·1 is a primitive logarithm of unity, (a generator of the group), while the number 0 = 2πi·0 is the principal logarithm of unity.

e^2πi = e⁰ = 1.

---

top

Root of unity
e^2πi(1/n) is a primitive n-th root of unity, while e^2πi(0/n) is the principal n-th root of unity.

---

top

Multivalued logarithm
The equation, e^x=a, where a is a nonzero complex number, has an infinity of solutions. Let x be any of them, then any of them has the form x+2πi·n where n is some integer.

e^x+2πi·n = e^x·e^2πi·n = e^x·(e^2πi)ⁿ = e^x·1ⁿ = e^x·1 = e^x

So the logarithm is a Multivalued function.

---

top

Singlevalued logarithm
If a is a positive real number, then one of the solutions to the equation, e^x=a, is a real number. It is natural to select this solution as the principal value of the logarithm. In the general case the principal value of the logarithm is more arbitrarily defined as the value having imaginary part in the interval (−π,+π]. The principal value has the advantage of being singlevalued, but the price to be paid is that it ceases to be a continuous function.

---

top

Multivalued power
If e^b = a, then e^(b+2πi·n)x are the values of a^x.
For example, 4^1/2 = . (see square root).

---

top

Singlevalued power
If e^b = a, and b is the principal value, then e^bx is the principal value of a^x.
For example, the principal value of 4^1/2 is +2.

---

top

Polar form
The typical approach is to write the complex number in polar form: any complex number $a+ib$ can be written as:

$a+ib\; =\; r\; e^\; =\; r\; leftcosvarphi\; +\; i\; sinvarphi\; ight$

for a positive real magnitude $r$ and a real angle $varphi$, where for the right-most equation we have used Euler's formula for $e^$. Then, exponentiation can be written as:

$(a+ib)^x\; =\; left(\; r\; e^$

ight)^x = r^x e^.

For real $x$, $r^x$ is handled as above. For complex $x$, we use Euler's formula a second time as explained below.

As for real numbers, above, any non-integer exponent $x$ implies that the answer is not uniquely determined. In particular, we could change $varphi$ to $varphi\; +\; 2pi\; n$ (see Pi) for any integer $n$ without changing the formula for $a+ib$, since $e^=1$ by Euler's formula. Different values of $n$ may change the exponential, however, since $e^$
eq 1 in general. For a rational real x, the number of possible values is given by the lowest common denominator of x (see Root of unity), while for other real or complex x there are infinitely many possible values.

By convention, this multi-valuedness is resolved by defining $(a+ib)^x$ as the principal value, as for real exponentials above, unless otherwise noted. This means that the angle $varphi$ is conventionally chosen to lie in the interval $(-pi,pi]$.

In the above, we didn't explain how to handle one important case: how do we compute the exponential when $x=c+id$ is complex? In particular, we now have to take the complex exponential $r^x\; =\; r^c\; r^\; !$ of a positive real number $r$. $r^c\; !$ is purely real and is the same as above, so we only need to understand $r^\; !$.

Here, we can once again exploit Euler's formula, since it tells us how to take imaginary powers of one real number e: $e^\; =\; cos\; d\; +\; isin\; d$. Therefore, we just need to rewrite $r^$ in terms of a power of e:

$r^\; =\; left(r)^d\; ight^i\; =\; leftleft(\; e^\{ln\; r\}\; ight)^d\; ight^i\; =\; e^\; =\; cos(d\; ln\; r)\; +\; isin(d\; ln\; r).$

Here, as we did above for real exponents, we used the natural logarithm function ln to write $r\; =\; e^\; !$.

So, we can finally write:

$(a+ib)^\; =\; left(\; r\; e^$

ight)^ = left r^c e^{-varphi d} ight e^

where we have written the final expression in polar form as a real magnitude multiplied by a complex phase, and have used the fact that $icdot\; i\; =\; -1$.

---

top

Examples

$i^i\; =\; (e^)^i\; =\; e^\; approx\; 0.20788ldots$

This is the principal value of $i^i$. One could also write $i\; =\; e^$ for any integer n, resulting in an infinite set of possible definitions

$i^i\; =\; (e^)^i\; =\; e^$

However, according to standard conventions the expression $i^i$ denotes the principal value ($n=0$) unless otherwise specified.

In the same way, one can define exponentiation of negative real numbers, since any negative real number $-r$ can be written:

$-r\; =\; r\; e^\; !$

and thus the principal value of the exponent is $(-r)^x\; =\; r^x\; e^\; !$ (with the exponential $r^x$ of a positive number $r$ defined above).

---

top

Solving polynomial equations

It was once conjectured that the roots of any polynomial could be expressed in terms of exponentiation with fractional exponents. (See Quadratic equation).

That this is not true in general is the assertion of the Abel-Ruffini theorem.

For example, the solutions of the equation x⁵ = x+1 cannot be expressed in terms of fractional exponents.

For solving any equation of the n^th degree, see the Durand-Kerner method.

---

top

Efficiently computing exponents
It may seem that computing aⁿ requires n−1 multiplications, but this can be reduced using exponentiation by squaring or addition-chain exponentiation, both of which are types of dynamic programming.

---

top

Exponents on function names

When the name or symbol of a function is given an integer superscript, as if being raised to a power,
this commonly refers to repeated function composition rather than repeated multiplication.
Thus f³(x) may mean f(f(f(x)));
in particular, f ^-1(x) usually denotes fs inverse function.

A special syntax applies to the trigonometric functions: a positive exponent applied to the function's abbreviation means that the result is raised to that power, while an exponent of -1 indicates the inverse function.
That is, sin²x is just a shorthand way to write (sin x)² without using parentheses,
whereas sin^-1x refers to the inverse function of the sine, also called arcsin x.
There is no need for a shorthand for the reciprocals of trigonometric
functions since each has its own name and abbreviation, for example
(sin x)^-1 is normally just written as csc x.

---

top

Exponentiation in abstract algebra

Exponentiation can also be understood purely in terms of abstract algebra, if we limit the exponents to integers.

Specifically, suppose that X is a set with a power-associative binary operation, which we will write multiplicatively.
In this very general situation, we can define xⁿ for any element x of X and any nonzero natural number n, by simply multiplying x by itself n times; by definition, power associativity means that it doesn't matter in which order we perform the multiplications.

Now additionally suppose that the operation has an identity element 1.
Then we can define x⁰ to be equal to 1 for any x.
Now xⁿ is defined for any natural number n, including 0.

Finally, suppose that the operation has inverses, and that the multiplication is associative (so that the magma is a group).
Then we can define x⁻ⁿ to be the inverse of xⁿ when n is a natural number.
Now xⁿ is defined for any integer n.

Exponentiation in this purely algebraic sense satisfies the following laws (whenever both sides are defined):

$x^=x^mx^n$

$x^=x^m/x^n$

$x^=1/x^n$

$x^0=1$

$x^1=x$

$x^=1/x$

$(x^m)^n=x^$

Here, we use a division slash ("/") to indicate multiplying by an inverse, in order to reserve the symbol x⁻¹ for raising x to the power −1, rather than the inverse of x.
However, as one of the laws above states, x⁻¹ is always equal to the inverse of x, so the notation doesn't matter in the end.

If in addition the multiplication operation is commutative (so that the magma is an abelian group), then we have some additional laws:

(xy)ⁿ = xⁿyⁿ

(x/y)ⁿ = xⁿ/yⁿ

It is necessary to let 0⁰ be 1, just like every other case of x⁰.
For example, expanding (0 + x)ⁿ by the binomial theorem, it is necessary to take 0⁰ = 1.

If we take this whole theory of exponentiation in an algebraic context but write the binary operation additively, then "exponentiation is repeated multiplication" can be reinterpreted as "multiplication is repeated addition".
Thus, each of the laws of exponentiation above has an analogue among laws of multiplication.

When one has several operations around, any of which might be repeated using exponentiation, it is common to indicate which operation is being repeated by placing its symbol in the superscript.
Thus, x

n is x
···
x, while x
n is x
···
x, whatever the operations
and
might be.

Exponential notation is also used, especially in group theory, to indicate conjugation.
That is, g^h = h^-1gh, where g and h are elements of some group.
Although conjugation obeys some of the same laws as exponentiation, it is not an example of repeated multiplication in any sense.
A quandle is an algebraic structure in which these laws of conjugation play a central role.

---

top

Exponentiation over sets

The above algebraic treatment of exponentiation builds a finitary operation out of a binary operation.
In more general contexts, one may be able to define an infinitary operation directly on an indexed set.

For example, in the arithmetic of cardinal numbers, it makes sense to consider the product

$prod\_\; k\_$

for any indexed family of cardinal numbers, (k_i)_{i in N}.
By taking k_i = k for every i, this can be interpreted as a repeated product, and the result is k^N.
In fact, this result depends only on the cardinality of N, so we can define exponentiation of cardinal numbers so that kⁿ is k^N for any set N whose cardinality is n.

This can be done even for operations on sets or sets with extra structure.
For example, in linear algebra, it makes sense to index direct sums of vector spaces over arbitrary index sets.
That is, we can speak of

where each V_i is a vector space.
Then if V_i = V for each i, the resulting direct sum can be written in exponential notation as V^(+)N, or simply V^N with the understanding that the direct sum is the default.
We can again replace the set N with a cardinal number n to get Vⁿ, although without choosing a specific standard set with cardinality n, this is defined only up to isomorphism.
Taking V to be the field R of real numbers (thought of as a vector space over itself) and n to be some natural number, we get the vector space that is most commonly studied in linear algebra, the Euclidean space Rⁿ.

If the base of the exponentiation operation is a set, then by default we assume the operation to be the Cartesian product.
In that case, S^N becomes simply the set of all functions from N to S.
This fits in with the exponentiation of cardinal numbers once again, in the sense that |S^N| = |S|^|N|, where |X| is the cardinality of X.
When N=2=, we have |2^X| = 2^|X|, where 2^X, usually denoted by PX, is the power set of X.
(This is where the term "power set" comes from.)

Note that exponentiation of cardinal numbers doesn't match up with exponentiation of ordinal numbers, which is defined by a limit process.
In the ordinal numbers, a^b is the smallest ordinal number greater than a^c for c < b when b is a limit ordinal, and of course a^b+1

= a^ba.

In category theory, we learn to raise any object in a wide variety of categories to the power of a set, or even to raise an object to the power of an object, using the exponential.

---

top

Exponentiation in programming languages
The mathematical notation x^y is neat for handwriting but awkward on typewriters and computers. So the programming languages have other ways of expressing exponentiation:

x ↑ y: Algol, Commodore BASIC

x ^ y: BASIC, Matlab, J programming language, Microsoft Excel, and most computer algebra systems

x
y: Fortran, Perl, Python (programming language), Ruby (programming language), Ada (programming language), FoxPro, SAS programming language

x
y: APL programming language

Power(x, y): Excel, Pascal programming language

pow(x, y): C programming language, C++, PHP

Math.pow(x, y): Java programming language, JavaScript, Modula-3

Math.Pow(x, y): C#

(expt x y): Common Lisp

In C, C++, C

, Java and JavaScript, the symbol ^ represents bitwise XOR. In Pascal, it represents indirection.

---

top

Table of powers

Table of kⁿ, with k on the left and n at the top.

---

top

Generalization
The next generalized operation after multiplication and exponentiation is sometimes called tetration; repeating this process leads to the Ackermann function.

---

top

See also

List of exponential topics

Exponential growth

Exponential decay

Exponentiating by squaring

Logarithm

Modular exponentiation

Addition chain exponentiation using an addition chain

Tetration

Unicode subscripts and superscripts