Exponentiation

$b n$
bn
notation
	base b and exponent n

Graphs of $y = b x$ for various bases $b$ : base $10$ , base $e$ , base $2$ , base $.mw-parser-output .sfrac{white-space:nowrap}.mw-parser-output .sfrac.tion,.mw-parser-output .sfrac .tion{display:inline-block;vertical-align:-0.5em;font-size:85%;text-align:center}.mw-parser-output .sfrac .num{display:block;line-height:1em;margin:0.0em 0.1em;border-bottom:1px solid}.mw-parser-output .sfrac .den{display:block;line-height:1em;margin:0.1em 0.1em}.mw-parser-output .sr-only{border:0;clip:rect(0,0,0,0);clip-path:polygon(0px 0px,0px 0px,0px 0px);height:1px;margin:-1px;overflow:hidden;padding:0;position:absolute;width:1px}⁠1/2⁠$ . Each curve passes through the point $(0, 1)$ because any nonzero number raised to the power of $0$ is $1$ . At $x = 1$ , the value of $y$ equals the base because any number raised to the power of $1$ is the number itself.

In mathematics, exponentiation is an operation involving two numbers: the base and the exponent or power. Exponentiation is written as $b n$ , where $b$ is the base and $n$ is the power; this is pronounced as " $b$ (raised) to the (power of) $n$ ".^[1] When $n$ is a positive integer, exponentiation corresponds to repeated multiplication of the base: that is, $b n$ is the product of multiplying $n$ bases:^[1] $b^{n}=\underbrace {b\times b\times \dots \times b\times b} _{n{\text{ times}}}.$

The exponent is usually shown as a superscript to the right of the base. In that case, $b n$ is called "b raised to the nth power", "b (raised) to the power of n", "the nth power of b", "b to the nth power",^[2] or most briefly as "b to the n(th)".

Starting from the basic fact stated above that, for any positive integer $n$ , $b^{n}$ is $n$ occurrences of $b$ all multiplied by each other, several other properties of exponentiation directly follow. In particular:^{[nb 1]}

${\begin{aligned}b^{n+m}&=\underbrace {b\times \dots \times b} _{n+m{\text{ times}}}\\[1ex]&=\underbrace {b\times \dots \times b} _{n{\text{ times}}}\times \underbrace {b\times \dots \times b} _{m{\text{ times}}}\\[1ex]&=b^{n}\times b^{m}\end{aligned}}$

In other words, when multiplying a base raised to one exponent by the same base raised to another exponent, the exponents add. From this basic rule that exponents add, we can derive that $b^{0}$ must be equal to 1 for any $b\neq 0$ , as follows. For any $n$ , $b^{0}\times b^{n}=b^{0+n}=b^{n}$ . Dividing both sides by $b^{n}$ gives $b^{0}=b^{n}/b^{n}=1$ .

The fact that $b^{1}=b$ can similarly be derived from the same rule. For example, $(b^{1})^{3}=b^{1}\times b^{1}\times b^{1}=b^{1+1+1}=b^{3}$ . Taking the cube root of both sides gives $b^{1}=b$ .

The rule that multiplying makes exponents add can also be used to derive the properties of negative integer exponents. Consider the question of what $b^{-1}$ should mean. In order to respect the "exponents add" rule, it must be the case that $b^{-1}\times b^{1}=b^{-1+1}=b^{0}=1$ . Dividing both sides by $b^{1}$ gives $b^{-1}=1/b^{1}$ , which can be more simply written as $b^{-1}=1/b$ , using the result from above that $b^{1}=b$ . By a similar argument, $b^{-n}=1/b^{n}$ .

The properties of fractional exponents also follow from the same rule. For example, suppose we consider ${\sqrt {b}}$ and ask if there is some suitable exponent, which we may call $r$ , such that $b^{r}={\sqrt {b}}$ . From the definition of the square root, we have that ${\sqrt {b}}\times {\sqrt {b}}=b$ . Therefore, the exponent $r$ must be such that $b^{r}\times b^{r}=b$ . Using the fact that multiplying makes exponents add gives $b^{r+r}=b$ . The $b$ on the right-hand side can also be written as $b^{1}$ , giving $b^{r+r}=b^{1}$ . Equating the exponents on both sides, we have $r+r=1$ . Therefore, $r={\tfrac {1}{2}}$ , so ${\sqrt {b}}=b^{1/2}$ .

The definition of exponentiation can be extended to allow any real or complex exponent. Exponentiation by integer exponents can also be defined for a wide variety of algebraic structures, including matrices.

Exponentiation is used extensively in many fields, including economics, biology, chemistry, physics, and computer science, with applications such as compound interest, population growth, chemical reaction kinetics, wave behavior, and public-key cryptography.

Etymology

The term exponent originates from the Latin exponentem, the present participle of exponere, meaning "to put forth".^[3] The term power (Latin: potentia, potestas, dignitas) is a mistranslation^[4]^[5] of the ancient Greek δύναμις (dúnamis, here: "amplification"^[4]) used by the Greek mathematician Euclid for the square of a line,^[6] following Hippocrates of Chios.^[7]

History

Antiquity

The Sand Reckoner

In The Sand Reckoner, Archimedes proved the law of exponents, $10 a \cdot 10 b = 10 a + b$ , necessary to manipulate powers of $10$ .^[8] He then used powers of $10$ to estimate the number of grains of sand that can be contained in the universe.

Islamic Golden Age

Māl and kaʿbah ("square" and "cube")

In the 9th century, the Persian mathematician Al-Khwarizmi used the terms مَال (māl, "possessions", "property") for a square—the Muslims, "like most mathematicians of those and earlier times, thought of a squared number as a depiction of an area, especially of land, hence property"^[9]—and كَعْبَة (Kaʿbah, "cube") for a cube, which later Islamic mathematicians represented in mathematical notation as the letters mīm (m) and kāf (k), respectively, by the 15th century, as seen in the work of Abu'l-Hasan ibn Ali al-Qalasadi.^[10]

15th–18th century

Introducing exponents

Nicolas Chuquet used a form of exponential notation in the 15th century, for example $122$ to represent $12 x 2$ .^[11] This was later used by Henricus Grammateus and Michael Stifel in the 16th century. In the late 16th century, Jost Bürgi would use Roman numerals for exponents in a way similar to that of Chuquet, for example iii4 for $4 x 3$ .^[12]

"Exponent"; "square" and "cube"

The word exponent was coined in 1544 by Michael Stifel.^[13]^[14] In the 16th century, Robert Recorde used the terms square, cube, zenzizenzic (fourth power), sursolid (fifth), zenzicube (sixth), second sursolid (seventh), and zenzizenzizenzic (eighth).^[9] Biquadrate has been used to refer to the fourth power as well.

Modern exponential notation

In 1636, James Hume used in essence modern notation, when in L'algèbre de Vietè he wrote $A iii$ for $A 3$ .^[15] Early in the 17th century, the first form of our modern exponential notation was introduced by René Descartes in his text titled La Géométrie; there, the notation is introduced in Book I.^[16]

I designate ... $aa$ , or $a 2$ in multiplying $a$ by itself; and $a 3$ in multiplying it once more again by $a$ , and thus to infinity.
— René Descartes, La Géométrie

Some mathematicians (such as Descartes) used exponents only for powers greater than two, preferring to represent squares as repeated multiplication. Thus they would write polynomials, for example, as $ax + bxx + cx 3 + d$ .

"Indices"

Samuel Jeake introduced the term indices in 1696.^[6] The term involution was used synonymously with the term indices, but had declined in usage^[17] and should not be confused with its more common meaning.

Variable exponents, non-integer exponents

In 1748, Leonhard Euler introduced variable exponents, and, implicitly, non-integer exponents by writing:

Consider exponentials or powers in which the exponent itself is a variable. It is clear that quantities of this kind are not algebraic functions, since in those the exponents must be constant.^[18]

Terminology

The expression $b 2 = b \cdot b$ is called "the square of $b$ " or " $b$ squared", because the area of a square with side-length $b$ is $b 2$ . (It is true that it could also be called " $b$ to the second power", but "the square of $b$ " and " $b$ squared" are so ingrained by tradition and convenience that " $b$ to the second power" tends to sound unusual or clumsy.)

Similarly, the expression $b 3 = b \cdot b \cdot b$ is called "the cube of $b$ " or " $b$ cubed", because the volume of a cube with side-length $b$ is $b 3$ .

When an exponent is a positive integer, that exponent indicates how many copies of the base are multiplied together. For example, $35 = 3 \cdot 3 \cdot 3 \cdot 3 \cdot 3 = 243$ . The base $3$ appears $5$ times in the multiplication, because the exponent is $5$ . Here, $243$ is the 5th power of 3, or 3 raised to the 5th power.

The word "raised" is usually omitted, and sometimes "power" as well, so $35$ can be simply read "3 to the 5th", or "3 to the 5". Therefore, the exponentiation $b n$ can be expressed as "b to the power of n", "b to the nth power", "b to the nth", or most briefly as "b to the n".

Integer exponents

The exponentiation operation with integer exponents may be defined directly from elementary arithmetic operations.

Positive exponents

The definition of the exponentiation as an iterated multiplication can be formalized by using induction,^[19] and this definition can be used as soon one has an associative multiplication:

The base case is

b^{1}=b

and the recurrence is

b^{n+1}=b^{n}\cdot b.

The associativity of multiplication implies that for any positive integers $m$ and $n$ ,

b^{m+n}=b^{m}\cdot b^{n},

and

(b^{m})^{n}=b^{mn}.

Zero exponent

As mentioned earlier, a (nonzero) number raised to the $0$ power is $1$ :^[20]^[1]

b^{0}=1.

This value is also obtained by the empty product convention, which may be used in every algebraic structure with a multiplication that has an identity. This way the formula

b^{m+n}=b^{m}\cdot b^{n}

also holds for $n=0$ .

The case of $00$ is controversial. In contexts where only integer powers are considered, the value $1$ is generally assigned to $00$ but, otherwise, the choice of whether to assign it a value and what value to assign may depend on context. For more details, see Zero to the power of zero.

Negative exponents

Exponentiation with negative exponents is defined by the following identity, which holds for any integer $n$ and nonzero $b$ :

b^{-n}={\frac {1}{b^{n}}}

.^[1]

Raising 0 to a negative exponent is undefined but, in some circumstances, it may be interpreted as infinity ( $\infty$ ).^[21]

This definition of exponentiation with negative exponents is the only one that allows extending the identity $b^{m+n}=b^{m}\cdot b^{n}$ to negative exponents (consider the case $m=-n$ ).

The same definition applies to invertible elements in a multiplicative monoid, that is, an algebraic structure, with an associative multiplication and a multiplicative identity denoted $1$ (for example, the square matrices of a given dimension). In particular, in such a structure, the inverse of an invertible element $x$ is standardly denoted $x^{-1}.$

Identities and properties

The following identities, often called exponent rules, hold for all integer exponents, provided that the base is non-zero:^[1]

{\begin{aligned}b^{m+n}&=b^{m}\cdot b^{n}\\\left(b^{m}\right)^{n}&=b^{m\cdot n}\\(b\cdot c)^{n}&=b^{n}\cdot c^{n}\end{aligned}}

Unlike addition and multiplication, exponentiation is not commutative. For example, $23 = 8 \neq 3 2 = 9$ . Also unlike addition and multiplication, exponentiation is not associative. For example, $(2 3) 2 = 8 2 = 64$ , whereas $2 (3 2) = 2 9 = 512$ . Without parentheses, the conventional order of operations for serial exponentiation in superscript notation is top-down (or right-associative), not bottom-up^[22]^[23]^[24] (or left-associative). That is,

b^{p^{q}}=b^{\left(p^{q}\right)},

which, in general, is different from

\left(b^{p}\right)^{q}=b^{pq}.

Powers of a sum

The powers of a sum can normally be computed from the powers of the summands by the binomial formula

(a+b)^{n}=\sum _{i=0}^{n}{\binom {n}{i}}a^{i}b^{n-i}=\sum _{i=0}^{n}{\frac {n!}{i!(n-i)!}}a^{i}b^{n-i}.

However, this formula is true only if the summands commute (i.e. that $ab = ba$ ), which is implied if they belong to a structure that is commutative. Otherwise, if $a$ and $b$ are, say, square matrices of the same size, this formula cannot be used. It follows that in computer algebra, many algorithms involving integer exponents must be changed when the exponentiation bases do not commute. Some general purpose computer algebra systems use a different notation (sometimes $^^$ instead of $^$ ) for exponentiation with non-commuting bases, which is then called non-commutative exponentiation.

Combinatorial interpretation

For nonnegative integers $n$ and $m$ , the value of $n m$ is the number of functions from a set of $m$ elements to a set of $n$ elements (see cardinal exponentiation). Such functions can be represented as $m$ -tuples from an $n$ -element set (or as $m$ -letter words from an $n$ -letter alphabet). Some examples for particular values of $m$ and $n$ are given in the following table:

$n m$	The $n m$ possible $m$ -tuples of elements from the set ${1, ..., n}$
0⁵ = 0	none
1⁴ = 1	(1, 1, 1, 1)
2³ = 8	(1, 1, 1), (1, 1, 2), (1, 2, 1), (1, 2, 2), (2, 1, 1), (2, 1, 2), (2, 2, 1), (2, 2, 2)
3² = 9	(1, 1), (1, 2), (1, 3), (2, 1), (2, 2), (2, 3), (3, 1), (3, 2), (3, 3)
4¹ = 4	(1), (2), (3), (4)
5⁰ = 1	()

Particular bases

Powers of ten

In the base ten (decimal) number system, integer powers of $10$ are written as the digit $1$ followed or preceded by a number of zeroes determined by the sign and magnitude of the exponent. For example, $103 = 1000$ and $10 -4 = 0.0001$ .

Exponentiation with base $10$ is used in scientific notation to denote large or small numbers. For instance, 299792458 m/s (the speed of light in vacuum, in metres per second) can be written as 2.99792458×10⁸ m/s and then approximated as 2.998×10⁸ m/s.

SI prefixes based on powers of $10$ are also used to describe small or large quantities. For example, the prefix kilo means $103 = 1000$ , so a kilometre is 1000 m.

Powers of two

The first negative powers of $2$ are commonly used, and have special names, e.g.: half and quarter.

Powers of $2$ appear in set theory, since a set with $n$ members has a power set, the set of all of its subsets, which has $2 n$ members.

Integer powers of $2$ are important in computer science. The positive integer powers $2 n$ give the number of possible values for an $n$ -bit integer binary number; for example, a byte may take $28 = 256$ different values. The binary number system expresses any number as a sum of powers of $2$ , and denotes it as a sequence of $0$ and $1$ , separated by a binary point, where $1$ indicates a power of $2$ that appears in the sum; the exponent is determined by the place of this $1$ : the nonnegative exponents are the rank of the $1$ on the left of the point (starting from $0$ ), and the negative exponents are determined by the rank on the right of the point.

Powers of one

Every power of one equals: $1 n = 1$ . This is true even if $n$ is negative.

The first power of a number is the number itself: $n 1 = n$ .

Powers of zero

If the exponent $n$ is positive ( $n > 0$ ), the $n$ th power of zero is zero: $0 n = 0$ .

If the exponent $n$ is negative ( $n < 0$ ), the $n$ th power of zero $0 n$ is undefined, because it must equal $1/0^{-n}$ with $- n > 0$ , and this would be $1/0$ according to above.

The expression $00$ is either defined as $1$ , or it is left undefined.

Powers of negative one

If $n$ is an even integer, then $(-1) n = 1$ . This is because a negative number multiplied by another negative number cancels the sign, and thus gives a positive number.

If $n$ is an odd integer, then $(-1) n = -1$ . This is because there will be a remaining $-1$ after removing $-1$ pairs.

Because of this, powers of $-1$ are useful for expressing alternating sequences. For a similar discussion of powers of the complex number $i$ , see § nth roots of a complex number.

Large exponents

The limit of a sequence of powers of a number greater than one diverges; in other words, the sequence grows without bound:

b n \to \infty

as

n \to \infty

when

b > 1

This can be read as "b to the power of n tends to +∞ as n tends to infinity when b is greater than one".

Powers of a number with absolute value less than one tend to zero:

b n \to 0

as

n \to \infty

when

| b | < 1

Any power of one is always one:

b n = 1

for all

n

if

b = 1

Powers of $-1$ alternate between $1$ and $-1$ as $n$ alternates between even and odd, and thus do not tend to any limit as $n$ grows.

If $b < -1$ , $b n$ alternates between larger and larger positive and negative numbers as $n$ alternates between even and odd, and thus does not tend to any limit as $n$ grows.

If the exponentiated number varies while tending to $1$ as the exponent tends to infinity, then the limit is not necessarily one of those above. A particularly important case is

(1 + 1/ n) n \to e

as

n \to \infty

See § Exponential function below.

Other limits, in particular those of expressions that take on an indeterminate form, are described in § Limits of powers below.

Power functions

Real functions of the form $f(x)=cx^{n}$ , where $c\neq 0$ , are sometimes called power functions.^[25] When $n$ is an integer and $n\geq 1$ , two primary families exist: for $n$ even, and for $n$ odd. In general for $c>0$ , when $n$ is even $f(x)=cx^{n}$ will tend towards positive infinity with increasing $x$ , and also towards positive infinity with decreasing $x$ . All graphs from the family of even power functions have the general shape of $y=cx^{2}$ , flattening more in the middle as $n$ increases.^[26] Functions with this kind of symmetry ( $f(-x)=f(x)$ ) are called even functions.

When $n$ is odd, $f(x)$ 's asymptotic behavior reverses from positive $x$ to negative $x$ . For $c>0$ , $f(x)=cx^{n}$ will also tend towards positive infinity with increasing $x$ , but towards negative infinity with decreasing $x$ . All graphs from the family of odd power functions have the general shape of $y=cx^{3}$ , flattening more in the middle as $n$ increases and losing all flatness there in the straight line for $n=1$ . Functions with this kind of symmetry ( $f(-x)=-f(x)$ ) are called odd functions.

For $c<0$ , the opposite asymptotic behavior is true in each case.^[26]

Table of powers of decimal digits

n	n²	n³	n⁴	n⁵	n⁶	n⁷	n⁸	n⁹	n¹⁰
1	1	1	1	1	1	1	1	1	1
2	4	8	16	32	64	128	256	512	1024
3	9	27	81	243	729	2187	6561	19683	59049
4	16	64	256	1024	4096	16384	65536	262144	1048576
5	25	125	625	3125	15625	78125	390625	1953125	9765625
6	36	216	1296	7776	46656	279936	1679616	10077696	60466176
7	49	343	2401	16807	117649	823543	5764801	40353607	282475249
8	64	512	4096	32768	262144	2097152	16777216	134217728	1073741824
9	81	729	6561	59049	531441	4782969	43046721	387420489	3486784401
10	100	1000	10000	100000	1000000	10000000	100000000	1000000000	10000000000

Rational exponents

If $x$ is a nonnegative real number, and $n$ is a positive integer, $x^{1/n}$ or ${\sqrt[{n}]{x}}$ denotes the unique positive real $n$ th root of $x$ , that is, the unique positive real number $y$ such that $y^{n}=x.$

If $x$ is a positive real number, and ${\frac {p}{q}}$ is a rational number, with $p$ and $q > 0$ integers, then ${\textstyle x^{p/q}}$ is defined as

x^{\frac {p}{q}}=\left(x^{p}\right)^{\frac {1}{q}}=(x^{\frac {1}{q}})^{p}.

The equality on the right may be derived by setting $y=x^{\frac {1}{q}},$ and writing $(x^{\frac {1}{q}})^{p}=y^{p}=\left((y^{p})^{q}\right)^{\frac {1}{q}}=\left((y^{q})^{p}\right)^{\frac {1}{q}}=(x^{p})^{\frac {1}{q}}.$

If $r$ is a positive rational number, $0 r = 0$ , by definition.

All these definitions are required for extending the identity $(x^{r})^{s}=x^{rs}$ to rational exponents.

On the other hand, there are problems with the extension of these definitions to bases that are not positive real numbers. For example, a negative real number has a real $n$ th root, which is negative, if $n$ is odd, and no real root if $n$ is even. In the latter case, whichever complex $n$ th root one chooses for $x^{\frac {1}{n}},$ the identity $(x^{a})^{b}=x^{ab}$ cannot be satisfied. For example,

\left((-1)^{2}\right)^{\frac {1}{2}}=1^{\frac {1}{2}}=1\neq (-1)^{2\cdot {\frac {1}{2}}}=(-1)^{1}=-1.

See § Real exponents and § Non-integer powers of complex numbers for details on the way these problems may be handled.

Real exponents

For positive real numbers, exponentiation to real powers can be defined in two equivalent ways, either by extending the rational powers to reals by continuity (§ Limits of rational exponents, below), or in terms of the logarithm of the base and the exponential function (§ Powers via logarithms, below). The result is always a positive real number, and the identities and properties shown above for integer exponents remain true with these definitions for real exponents. The second definition is more commonly used, since it generalizes straightforwardly to complex exponents.

On the other hand, exponentiation to a real power of a negative real number is much more difficult to define consistently, as it may be non-real and have several values. One may choose one of these values, called the principal value, but there is no choice of the principal value for which the identity

\left(b^{r}\right)^{s}=b^{rs}

is true; see § Failure of power and logarithm identities. Therefore, exponentiation with a basis that is not a positive real number is generally viewed as a multivalued function.

Limits of rational exponents

Since any irrational number can be expressed as the limit of a sequence of rational numbers, exponentiation of a positive real number $b$ with an arbitrary real exponent $x$ can be defined by continuity with the rule^[27]

b^{x}=\lim _{r(\in \mathbb {Q} )\to x}b^{r}\quad (b\in \mathbb {R} ^{+},\,x\in \mathbb {R} ),

where the limit is taken over rational values of $r$ only. This limit exists for every positive $b$ and every real $x$ .

For example, if $x = π$ , the non-terminating decimal representation $π = 3.14159...$ and the monotonicity of the rational powers can be used to obtain intervals bounded by rational powers that are as small as desired, and must contain $b^{\pi }:$

\left[b^{3},b^{4}\right],\left[b^{3.1},b^{3.2}\right],\left[b^{3.14},b^{3.15}\right],\left[b^{3.141},b^{3.142}\right],\left[b^{3.1415},b^{3.1416}\right],\left[b^{3.14159},b^{3.14160}\right],\ldots

So, the upper bounds and the lower bounds of the intervals form two sequences that have the same limit, denoted $b^{\pi }.$

This defines $b^{x}$ for every positive $b$ and real $x$ as a continuous function of $b$ and $x$ . See also Well-defined expression.^[28]

Exponential function

The exponential function is often defined as $x\mapsto e^{x},$ where $e\approx 2.718$ is Euler's number. To avoid circular reasoning, this definition cannot be used here. So, a definition of the exponential function, denoted $\exp(x),$ and of Euler's number are given, which rely only on exponentiation with positive integer exponents. Then a proof is sketched that, if one uses the definition of exponentiation given in preceding sections, one has

\exp(x)=e^{x}.

There are many equivalent ways to define the exponential function, one of them being

\exp(x)=\lim _{n\rightarrow \infty }\left(1+{\frac {x}{n}}\right)^{n}.

One has $\exp(0)=1,$ and the exponential identity $\exp(x+y)=\exp(x)\exp(y)$ holds as well, since

\exp(x)\exp(y)=\lim _{n\rightarrow \infty }\left(1+{\frac {x}{n}}\right)^{n}\left(1+{\frac {y}{n}}\right)^{n}=\lim _{n\rightarrow \infty }\left(1+{\frac {x+y}{n}}+{\frac {xy}{n^{2}}}\right)^{n},

and the second-order term ${\frac {xy}{n^{2}}}$ does not affect the limit, yielding $\exp(x)\exp(y)=\exp(x+y)$ .

Euler's number can be defined as $e=\exp(1)$ . It follows from the preceding equations that $\exp(x)=e^{x}$ when $x$ is an integer (this results from the repeated-multiplication definition of the exponentiation). If $x$ is real, $\exp(x)=e^{x}$ results from the definitions given in preceding sections, by using the exponential identity if $x$ is rational, and the continuity of the exponential function otherwise.

The limit that defines the exponential function converges for every complex value of $x$ , and therefore it can be used to extend the definition of $\exp(z)$ , and thus $e^{z},$ from the real numbers to any complex argument $z$ . This extended exponential function still satisfies the exponential identity, and is commonly used for defining exponentiation for complex base and exponent.

Powers via logarithms

The definition of $e x$ as the exponential function allows defining $b x$ for every positive real numbers $b$ , in terms of exponential and logarithm function. Specifically, the fact that the natural logarithm $ln(x)$ is the inverse of the exponential function $e x$ means that one has

b=\exp(\ln b)=e^{\ln b}

for every $b > 0$ . For preserving the identity $(e^{x})^{y}=e^{xy},$ one must have

b^{x}=\left(e^{\ln b}\right)^{x}=e^{x\ln b}

So, $e^{x\ln b}$ can be used as an alternative definition of $b x$ for any positive real $b$ . This agrees with the definition given above using rational exponents and continuity, with the advantage to extend straightforwardly to any complex exponent.

Complex exponents with a positive real base

If $b$ is a positive real number, exponentiation with base $b$ and complex exponent $z$ is defined by means of the exponential function with complex argument (see the end of § Exponential function, above) as

b^{z}=e^{(z\ln b)},

where $\ln b$ denotes the natural logarithm of $b$ .

This satisfies the identity

b^{z+t}=b^{z}b^{t},

In general, ${\textstyle \left(b^{z}\right)^{t}}$ is not defined, since $b z$ is not a real number. If a meaning is given to the exponentiation of a complex number (see § Non-integer powers of complex numbers, below), one has, in general,

\left(b^{z}\right)^{t}\neq b^{zt},

unless $z$ is real or $t$ is an integer.

Euler's formula,

e^{iy}=\cos y+i\sin y,

allows expressing the polar form of $b^{z}$ in terms of the real and imaginary parts of $z$ , namely

b^{x+iy}=b^{x}(\cos(y\ln b)+i\sin(y\ln b)),

where the absolute value of the trigonometric factor is one. This results from

b^{x+iy}=b^{x}b^{iy}=b^{x}e^{iy\ln b}=b^{x}(\cos(y\ln b)+i\sin(y\ln b)).

Non-integer powers of complex numbers

In the preceding sections, exponentiation with non-integer exponents has been defined for positive real bases only. For other bases, difficulties appear already with the apparently simple case of $n$ th roots, that is, of exponents $1/n,$ where $n$ is a positive integer. Although the general theory of exponentiation with non-integer exponents applies to $n$ th roots, this case deserves to be considered first, since it does not need to use complex logarithms, and is therefore easier to understand.

$n$ th roots of a complex number

Every nonzero complex number $z$ may be written in polar form as

z=\rho e^{i\theta }=\rho (\cos \theta +i\sin \theta ),

where $\rho$ is the absolute value of $z$ , and $\theta$ is its argument. The argument is defined up to an integer multiple of $2 π$ ; this means that, if $\theta$ is the argument of a complex number, then $\theta +2k\pi$ is also an argument of the same complex number for every integer $k$ .

The polar form of the product of two complex numbers is obtained by multiplying the absolute values and adding the arguments. It follows that the polar form of an $n$ th root of a complex number can be obtained by taking the $n$ th root of the absolute value and dividing its argument by $n$ :

\left(\rho e^{i\theta }\right)^{\frac {1}{n}}={\sqrt[{n}]{\rho }}\,e^{\frac {i\theta }{n}}.

If $2\pi$ is added to $\theta$ , the complex number is not changed, but this adds $2i\pi /n$ to the argument of the $n$ th root, and provides a new $n$ th root. This can be done $n$ times, and provides the $n$ $n$ th roots of the complex number.

It is usual to choose one of the $n$ $n$ th root as the principal root. The common choice is to choose the $n$ th root for which $-\pi <\theta \leq \pi ,$ that is, the $n$ th root that has the largest real part, and, if there are two, the one with positive imaginary part. This makes the principal $n$ th root a continuous function in the whole complex plane, except for negative real values of the radicand. This function equals the usual $n$ th root for positive real radicands. For negative real radicands, and odd exponents, the principal $n$ th root is not real, although the usual $n$ th root is real. Analytic continuation shows that the principal $n$ th root is the unique complex differentiable function that extends the usual $n$ th root to the complex plane without the nonpositive real numbers.

If the complex number is moved around zero by increasing its argument, after an increment of $2\pi ,$ the complex number comes back to its initial position, and its $n$ th roots are permuted circularly (they are multiplied by $e^{2i\pi /n}$ ). This shows that it is not possible to define a $n$ th root function that is continuous in the whole complex plane.

Roots of unity

The $n$ th roots of unity are the $n$ complex numbers such that $w n = 1$ , where $n$ is a positive integer. They arise in various areas of mathematics, such as in discrete Fourier transform or algebraic solutions of algebraic equations (Lagrange resolvent).

The $n$ $n$ th roots of unity are the $n$ first powers of $\omega =e^{\frac {2\pi i}{n}}$ , that is $1=\omega ^{0}=\omega ^{n},\omega =\omega ^{1},\omega ^{2},\omega ^{n-1}.$ The $n$ th roots of unity that have this generating property are called primitive $n$ th roots of unity; they have the form $\omega ^{k}=e^{\frac {2k\pi i}{n}},$ with $k$ coprime with $n$ . The unique primitive square root of unity is $-1;$ the primitive fourth roots of unity are $i$ and $-i.$

The $n$ th roots of unity allow expressing all $n$ th roots of a complex number $z$ as the $n$ products of a given $n$ th roots of $z$ with a $n$ th root of unity.

Geometrically, the $n$ th roots of unity lie on the unit circle of the complex plane at the vertices of a regular $n$ -gon with one vertex on the real number 1.

As the number $e^{\frac {2k\pi i}{n}}$ is the primitive $n$ th root of unity with the smallest positive argument, it is called the principal primitive $n$ th root of unity, sometimes shortened as principal $n$ th root of unity, although this terminology can be confused with the principal value of $1^{1/n}$ , which is 1.^[29]^[30]^[31]

Complex exponentiation

Defining exponentiation with complex bases leads to difficulties that are similar to those described in the preceding section, except that there are, in general, infinitely many possible values for $z^{w}$ . So, either a principal value is defined, which is not continuous for the values of $z$ that are real and nonpositive, or $z^{w}$ is defined as a multivalued function.

In all cases, the complex logarithm is used to define complex exponentiation as

z^{w}=e^{w\log z},

where $\log z$ is the variant of the complex logarithm that is used, which is, a function or a multivalued function such that

e^{\log z}=z

for every $z$ in its domain of definition.

Principal value

The principal value of the complex logarithm is the unique continuous function, commonly denoted $\log ,$ such that, for every nonzero complex number $z$ ,

e^{\log z}=z,

and the argument of $z$ satisfies

-\pi <\operatorname {Arg} z\leq \pi .

The principal value of the complex logarithm is not defined for $z=0,$ it is discontinuous at negative real values of $z$ , and it is holomorphic (that is, complex differentiable) elsewhere. If $z$ is real and positive, the principal value of the complex logarithm is the natural logarithm: $\log z=\ln z.$

The principal value of $z^{w}$ is defined as $z^{w}=e^{w\log z},$ where $\log z$ is the principal value of the logarithm.

The function $(z,w)\to z^{w}$ is holomorphic except in the neighbourhood of the points where $z$ is real and nonpositive.

If $z$ is real and positive, the principal value of $z^{w}$ equals its usual value defined above. If $w=1/n,$ where $n$ is an integer, this principal value is the same as the one defined above.

Multivalued function

In some contexts, there is a problem with the discontinuity of the principal values of $\log z$ and $z^{w}$ at the negative real values of $z$ . In this case, it is useful to consider these functions as multivalued functions.

If $\log z$ denotes one of the values of the multivalued logarithm (typically its principal value), the other values are $2ik\pi +\log z,$ where $k$ is any integer. Similarly, if $z^{w}$ is one value of the exponentiation, then the other values are given by

e^{w(2ik\pi +\log z)}=z^{w}e^{2ik\pi w},

where $k$ is any integer.

Different values of $k$ give different values of $z^{w}$ unless $w$ is a rational number, that is, there is an integer $d$ such that $dw$ is an integer. This results from the periodicity of the exponential function, more specifically, that $e^{a}=e^{b}$ if and only if $a-b$ is an integer multiple of $2\pi i.$

If $w={\frac {m}{n}}$ is a rational number with $m$ and $n$ coprime integers with $n>0,$ then $z^{w}$ has exactly $n$ values. In the case $m=1,$ these values are the same as those described in § $n$ th roots of a complex number. If $w$ is an integer, there is only one value that agrees with that of § Integer exponents.

The multivalued exponentiation is holomorphic for $z\neq 0,$ in the sense that its graph consists of several sheets that define each a holomorphic function in the neighborhood of every point. If $z$ varies continuously along a circle around $0$ , then, after a turn, the value of $z^{w}$ has changed of sheet.

Computation

The canonical form $x+iy$ of $z^{w}$ can be computed from the canonical form of $z$ and $w$ . Although this can be described by a single formula, it is clearer to split the computation in several steps.

Polar form of $z$ . If $z=a+ib$ is the canonical form of $z$ ( $a$ and $b$ being real), then its polar form is $z=\rho e^{i\theta }=\rho (\cos \theta +i\sin \theta ),$ where $\rho ={\sqrt {a^{2}+b^{2}}}$ and $\theta =\operatorname {atan2} (a,b)$ (see atan2 for the definition of this function).
Logarithm of $z$ . The principal value of this logarithm is $\log z=\ln \rho +i\theta ,$ where $\ln$ denotes the natural logarithm. The other values of the logarithm are obtained by adding $2ik\pi$ for any integer $k$ .
Canonical form of $w\log z.$ If $w=c+di$ with $c$ and $d$ real, the values of $w\log z$ are $w\log z=(c\ln \rho -d\theta -2dk\pi )+i(d\ln \rho +c\theta +2ck\pi ),$ the principal value corresponding to $k=0.$
Final result. Using the identities $e^{x+y}=e^{x}e^{y}$ and $e^{y\ln x}=x^{y},$ one gets $z^{w}=\rho ^{c}e^{-d(\theta +2k\pi )}\left(\cos(d\ln \rho +c\theta +2ck\pi )+i\sin(d\ln \rho +c\theta +2ck\pi )\right),$ with $k=0$ for the principal value.

Examples

$i^{i}$
The polar form of $i$ is $i=e^{i\pi /2},$ and the values of $\log i$ are thus $\log i=i\left({\frac {\pi }{2}}+2k\pi \right).$ It follows that $i^{i}=e^{i\log i}=e^{-{\frac {\pi }{2}}}e^{-2k\pi }.$ So, all values of $i^{i}$ are real, the principal one being $e^{-{\frac {\pi }{2}}}\approx 0.2079.$
$(-2)^{3+4i}$
Similarly, the polar form of $-2$ is $-2=2e^{i\pi }.$ So, the above described method gives the values ${\begin{aligned}(-2)^{3+4i}&=2^{3}e^{-4(\pi +2k\pi )}(\cos(4\ln 2+3(\pi +2k\pi ))+i\sin(4\ln 2+3(\pi +2k\pi )))\\&=-2^{3}e^{-4(\pi +2k\pi )}(\cos(4\ln 2)+i\sin(4\ln 2)).\end{aligned}}$ In this case, all the values have the same argument $4\ln 2,$ and different absolute values.

In both examples, all values of $z^{w}$ have the same argument. More generally, this is true if and only if the real part of $w$ is an integer.

Failure of power and logarithm identities

Some identities for powers and logarithms for positive real numbers will fail for complex numbers, no matter how complex powers and complex logarithms are defined as single-valued functions. For example:

The identity $log(b x) = x \cdot log b$ holds whenever $b$ is a positive real number and $x$ is a real number. But for the principal branch of the complex logarithm one has
$\log((-i)^{2})=\log(-1)=i\pi \neq 2\log(-i)=2\log(e^{-i\pi /2})=2\,{\frac {-i\pi }{2}}=-i\pi$
Regardless of which branch of the logarithm is used, a similar failure of the identity will exist. The best that can be said (if only using this result) is that: $\log w^{z}\equiv z\log w{\pmod {2\pi i}}$
This identity does not hold even when considering log as a multivalued function. The possible values of $log(w z)$ contain those of $z \cdot log w$ as a proper subset. Using $Log(w)$ for the principal value of $log(w)$ and $m$ , $n$ as any integers the possible values of both sides are:
${\begin{aligned}\left\{\log w^{z}\right\}&=\left\{z\cdot \operatorname {Log} w+z\cdot 2\pi in+2\pi im\mid m,n\in \mathbb {Z} \right\}\\\left\{z\log w\right\}&=\left\{z\operatorname {Log} w+z\cdot 2\pi in\mid n\in \mathbb {Z} \right\}\end{aligned}}$
The identities $(bc) x = b x c x$ and $(b / c) x = b x / c x$ are valid when $b$ and $c$ are positive real numbers and $x$ is a real number. But, for the principal values, one has $(-1\cdot -1)^{\frac {1}{2}}=1\neq (-1)^{\frac {1}{2}}(-1)^{\frac {1}{2}}=-1$ and $\left({\frac {1}{-1}}\right)^{\frac {1}{2}}=(-1)^{\frac {1}{2}}=i\neq {\frac {1^{\frac {1}{2}}}{(-1)^{\frac {1}{2}}}}={\frac {1}{i}}=-i$ On the other hand, when $x$ is an integer, the identities are valid for all nonzero complex numbers. If exponentiation is considered as a multivalued function then the possible values of $(-1 \cdot -1) 1/2$ are ${1, -1}$ . The identity holds, but saying ${1} = {(-1 \cdot -1) 1/2}$ is incorrect.
The identity (e^x)^y = e^xy holds for real numbers x and y, but assuming its truth for complex numbers leads to the following paradox, discovered in 1827 by Clausen:^[32] For any integer n, we have:
1. $e^{1+2\pi in}=e^{1}e^{2\pi in}=e\cdot 1=e$
2. $\left(e^{1+2\pi in}\right)^{1+2\pi in}=e\qquad$ (taking the $(1+2\pi in)$ -th power of both sides)
3. $e^{1+4\pi in-4\pi ^{2}n^{2}}=e\qquad$ (using $\left(e^{x}\right)^{y}=e^{xy}$ and expanding the exponent)
4. $e^{1}e^{4\pi in}e^{-4\pi ^{2}n^{2}}=e\qquad$ (using $e^{x+y}=e^{x}e^{y}$ )
5. $e^{-4\pi ^{2}n^{2}}=1\qquad$ (dividing by $e$ )
but this is false when the integer n is nonzero. The error is the following: by definition, $e^{y}$ $e^{y}$ is a notation for $\exp(y),$ $\exp(y),$ a true function, and $x^{y}$ $x^{y}$ is a notation for $\exp(y\log x),$ $\exp(y\log x),$ which is a multi-valued function. Thus the notation is ambiguous when x = e. Here, before expanding the exponent, the second line should be $\exp \left((1+2\pi in)\log \exp(1+2\pi in)\right)=\exp(1+2\pi in).$ $\exp \left((1+2\pi in)\log \exp(1+2\pi in)\right)=\exp(1+2\pi in).$ Therefore, when expanding the exponent, one has implicitly supposed that $\log \exp z=z$ $\log \exp z=z$ for complex values of z, which is wrong, as the complex logarithm is multivalued. In other words, the wrong identity (e^x)^y = e^xy must be replaced by the identity $\left(e^{x}\right)^{y}=e^{y\log e^{x}},$ $\left(e^{x}\right)^{y}=e^{y\log e^{x}},$ which is a true identity between multivalued functions.

Irrationality and transcendence

If $b$ is a positive real algebraic number, and $x$ is a rational number, then $b x$ is an algebraic number. This results from the theory of algebraic extensions. This remains true if $b$ is any algebraic number, in which case, all values of $b x$ (as a multivalued function) are algebraic. If $x$ is irrational (that is, not rational), and both $b$ and $x$ are algebraic, Gelfond–Schneider theorem asserts that all values of $b x$ are transcendental (that is, not algebraic), except if $b$ equals $0$ or $1$ .

In other words, if $x$ is irrational and $b\not \in \{0,1\},$ then at least one of $b$ , $x$ and $b x$ is transcendental.

Integer powers in algebra

The definition of exponentiation with positive integer exponents as repeated multiplication may apply to any associative operation denoted as a multiplication.^{[nb 2]} The definition of $x 0$ requires further the existence of a multiplicative identity.^[33]

An algebraic structure consisting of a set together with an associative operation denoted multiplicatively, and a multiplicative identity denoted by $1$ is a monoid. In such a monoid, exponentiation of an element $x$ is defined inductively by

$x^{0}=1,$
$x^{n+1}=xx^{n}$ for every nonnegative integer $n$ .

If $n$ is a negative integer, $x^{n}$ is defined only if $x$ has a multiplicative inverse.^[34] In this case, the inverse of $x$ is denoted $x -1$ , and $x n$ is defined as $\left(x^{-1}\right)^{-n}.$

Exponentiation with integer exponents obeys the following laws, for $x$ and $y$ in the algebraic structure, and $m$ and $n$ integers:

{\begin{aligned}x^{0}&=1\\x^{m+n}&=x^{m}x^{n}\\(x^{m})^{n}&=x^{mn}\\(xy)^{n}&=x^{n}y^{n}\quad {\text{if }}xy=yx,{\text{and, in particular, if the multiplication is commutative.}}\end{aligned}}

These definitions are widely used in many areas of mathematics, notably for groups, rings, fields, square matrices (which form a ring). They apply also to functions from a set to itself, which form a monoid under function composition. This includes, as specific instances, geometric transformations, and endomorphisms of any mathematical structure.

When there are several operations that may be repeated, it is common to indicate the repeated operation by placing its symbol in the superscript, before the exponent. For example, if $f$ is a real function whose valued can be multiplied, $f^{n}$ denotes the exponentiation with respect of multiplication, and $f^{\circ n}$ may denote exponentiation with respect of function composition. That is,

(f^{n})(x)=(f(x))^{n}=f(x)\,f(x)\cdots f(x),

and

(f^{\circ n})(x)=f(f(\cdots f(f(x))\cdots )).

Commonly, $(f^{n})(x)$ is denoted $f(x)^{n},$ while $(f^{\circ n})(x)$ is denoted $f^{n}(x).$

In a group

A multiplicative group is a set with as associative operation denoted as multiplication, that has an identity element, and such that every element has an inverse.

So, if $G$ is a group, $x^{n}$ is defined for every $x\in G$ and every integer $n$ .

The set of all powers of an element of a group form a subgroup. A group (or subgroup) that consists of all powers of a specific element $x$ is the cyclic group generated by $x$ . If all the powers of $x$ are distinct, the group is isomorphic to the additive group $\mathbb {Z}$ of the integers. Otherwise, the cyclic group is finite (it has a finite number of elements), and its number of elements is the order of $x$ . If the order of $x$ is $n$ , then $x^{n}=x^{0}=1,$ and the cyclic group generated by $x$ consists of the $n$ first powers of $x$ (starting indifferently from the exponent $0$ or $1$ ).

Order of elements play a fundamental role in group theory. For example, the order of an element in a finite group is always a divisor of the number of elements of the group (the order of the group). The possible orders of group elements are important in the study of the structure of a group (see Sylow theorems), and in the classification of finite simple groups.

Superscript notation is also used for conjugation; that is, $g h = h -1 gh$ , where $g$ and $h$ are elements of a group. This notation cannot be confused with exponentiation, since the superscript is not an integer. The motivation of this notation is that conjugation obeys some of the laws of exponentiation, namely $(g^{h})^{k}=g^{hk}$ and $(gh)^{k}=g^{k}h^{k}.$

In a ring

In a ring, it may occur that some nonzero elements satisfy $x^{n}=0$ for some integer $n$ . Such an element is said to be nilpotent. In a commutative ring, the nilpotent elements form an ideal, called the nilradical of the ring.

If the nilradical is reduced to the zero ideal (that is, if $x\neq 0$ implies $x^{n}\neq 0$ for every positive integer $n$ ), the commutative ring is said to be reduced. Reduced rings are important in algebraic geometry, since the coordinate ring of an affine algebraic set is always a reduced ring.

More generally, given an ideal $I$ in a commutative ring $R$ , the set of the elements of $R$ that have a power in $I$ is an ideal, called the radical of $I$ . The nilradical is the radical of the zero ideal. A radical ideal is an ideal that equals its own radical. In a polynomial ring $k[x_{1},\ldots ,x_{n}]$ over a field $k$ , an ideal is radical if and only if it is the set of all polynomials that are zero on an affine algebraic set (this is a consequence of Hilbert's Nullstellensatz).

Matrices and linear operators

If $A$ is a square matrix, then the product of $A$ with itself $n$ times is called the matrix power. Also $A^{0}$ is defined to be the identity matrix,^[35] and if $A$ is invertible, then $A^{-n}=\left(A^{-1}\right)^{n}$ .

Matrix powers appear often in the context of discrete dynamical systems, where the matrix $A$ expresses a transition from a state vector $x$ of some system to the next state $Ax$ of the system.^[36] This is the standard interpretation of a Markov chain, for example. Then $A^{2}x$ is the state of the system after two time steps, and so forth: $A^{n}x$ is the state of the system after $n$ time steps. The matrix power $A^{n}$ is the transition matrix between the state now and the state at a time $n$ steps in the future. So computing matrix powers is equivalent to solving the evolution of the dynamical system. In many cases, matrix powers can be expediently computed by using eigenvalues and eigenvectors.

Apart from matrices, more general linear operators can also be exponentiated. An example is the derivative operator of calculus, $d/dx$ , which is a linear operator acting on functions $f(x)$ to give a new function $(d/dx)f(x)=f'(x)$ . The $n$ th power of the differentiation operator is the $n$ th derivative:

\left({\frac {d}{dx}}\right)^{n}f(x)={\frac {d^{n}}{dx^{n}}}f(x)=f^{(n)}(x).

These examples are for discrete exponents of linear operators, but in many circumstances it is also desirable to define powers of such operators with continuous exponents. This is the starting point of the mathematical theory of semigroups.^[37] Just as computing matrix powers with discrete exponents solves discrete dynamical systems, so does computing matrix powers with continuous exponents solve systems with continuous dynamics. Examples include approaches to solving the heat equation, Schrödinger equation, wave equation, and other partial differential equations including a time evolution. The special case of exponentiating the derivative operator to a non-integer power is called the fractional derivative which, together with the fractional integral, is one of the basic operations of the fractional calculus.

Finite fields

A field is an algebraic structure in which multiplication, addition, subtraction, and division are defined and satisfy the properties that multiplication is associative and every nonzero element has a multiplicative inverse. This implies that exponentiation with integer exponents is well-defined, except for nonpositive powers of $0$ . Common examples are the field of complex numbers, the real numbers and the rational numbers, considered earlier in this article, which are all infinite.

A finite field is a field with a finite number of elements. This number of elements is either a prime number or a prime power; that is, it has the form $q=p^{k},$ where $p$ is a prime number, and $k$ is a positive integer. For every such $q$ , there are fields with $q$ elements. The fields with $q$ elements are all isomorphic, which allows, in general, working as if there were only one field with $q$ elements, denoted $\mathbb {F} _{q}.$

One has

x^{q}=x

for every $x\in \mathbb {F} _{q}.$

A primitive element in $\mathbb {F} _{q}$ is an element $g$ such that the set of the $q - 1$ first powers of $g$ (that is, $\{g^{1}=g,g^{2},\ldots ,g^{p-1}=g^{0}=1\}$ ) equals the set of the nonzero elements of $\mathbb {F} _{q}.$ There are $\varphi (p-1)$ primitive elements in $\mathbb {F} _{q},$ where $\varphi$ is Euler's totient function.

In $\mathbb {F} _{q},$ the freshman's dream identity

(x+y)^{p}=x^{p}+y^{p}

is true for the exponent $p$ . As $x^{p}=x$ in $\mathbb {F} _{q},$ It follows that the map

{\begin{aligned}F\colon {}&\mathbb {F} _{q}\to \mathbb {F} _{q}\\&x\mapsto x^{p}\end{aligned}}

is linear over $\mathbb {F} _{q},$ and is a field automorphism, called the Frobenius automorphism. If $q=p^{k},$ the field $\mathbb {F} _{q}$ has $k$ automorphisms, which are the $k$ first powers (under composition) of $F$ . In other words, the Galois group of $\mathbb {F} _{q}$ is cyclic of order $k$ , generated by the Frobenius automorphism.

The Diffie–Hellman key exchange is an application of exponentiation in finite fields that is widely used for secure communications. It uses the fact that exponentiation is computationally inexpensive, whereas the inverse operation, the discrete logarithm, is computationally expensive. More precisely, if $g$ is a primitive element in $\mathbb {F} _{q},$ then $g^{e}$ can be efficiently computed with exponentiation by squaring for any $e$ , even if $q$ is large, while there is no known computationally practical algorithm that allows retrieving $e$ from $g^{e}$ if $q$ is sufficiently large.

Powers of sets

The Cartesian product of two sets $S$ and $T$ is the set of the ordered pairs $(x,y)$ such that $x\in S$ and $y\in T.$ This operation is not properly commutative nor associative, but has these properties up to canonical isomorphisms, that allow identifying, for example, $(x,(y,z)),$ $((x,y),z),$ and $(x,y,z).$

This allows defining the $n$ th power $S^{n}$ of a set $S$ as the set of all $n$ -tuples $(x_{1},\ldots ,x_{n})$ of elements of $S$ .

When $S$ is endowed with some structure, it is frequent that $S^{n}$ is naturally endowed with a similar structure. In this case, the term "direct product" is generally used instead of "Cartesian product", and exponentiation denotes product structure. For example $\mathbb {R} ^{n}$ (where $\mathbb {R}$ denotes the real numbers) denotes the Cartesian product of $n$ copies of $\mathbb {R} ,$ as well as their direct product as vector space, topological spaces, rings, etc.

Sets as exponents

A $n$ -tuple $(x_{1},\ldots ,x_{n})$ of elements of $S$ can be considered as a function from $\{1,\ldots ,n\}.$ This generalizes to the following notation.

Given two sets $S$ and $T$ , the set of all functions from $T$ to $S$ is denoted $S^{T}$ . This exponential notation is justified by the following canonical isomorphisms (for the first one, see Currying):

(S^{T})^{U}\cong S^{T\times U},

S^{T\sqcup U}\cong S^{T}\times S^{U},

where $\times$ denotes the Cartesian product, and $\sqcup$ the disjoint union.

One can use sets as exponents for other operations on sets, typically for direct sums of abelian groups, vector spaces, or modules. For distinguishing direct sums from direct products, the exponent of a direct sum is placed between parentheses. For example, $\mathbb {R} ^{\mathbb {N} }$ denotes the vector space of the infinite sequences of real numbers, and $\mathbb {R} ^{(\mathbb {N} )}$ the vector space of those sequences that have a finite number of nonzero elements. The latter has a basis consisting of the sequences with exactly one nonzero element that equals $1$ , while the Hamel bases of the former cannot be explicitly described (because their existence involves Zorn's lemma).

In this context, $2$ can represents the set $\{0,1\}.$ So, $2^{S}$ denotes the power set of $S$ , that is the set of the functions from $S$ to $\{0,1\},$ which can be identified with the set of the subsets of $S$ , by mapping each function to the inverse image of $1$ .

This fits in with the exponentiation of cardinal numbers, in the sense that $| S T | = | S | | T |$ , where $| X |$ is the cardinality of $X$ .

In category theory

In the category of sets, the morphisms between sets $X$ and $Y$ are the functions from $X$ to $Y$ . It results that the set of the functions from $X$ to $Y$ that is denoted $Y^{X}$ in the preceding section can also be denoted $\hom(X,Y).$ The isomorphism $(S^{T})^{U}\cong S^{T\times U}$ can be rewritten

\hom(U,S^{T})\cong \hom(T\times U,S).

This means the functor "exponentiation to the power $T$ " is a right adjoint to the functor "direct product with $T$ ".

This generalizes to the definition of exponentiation in a category in which finite direct products exist: in such a category, the functor $X\to X^{T}$ is, if it exists, a right adjoint to the functor $Y\to T\times Y.$ A category is called a Cartesian closed category, if direct products exist, and the functor $Y\to X\times Y$ has a right adjoint for every $T$ .

Repeated exponentiation

Just as exponentiation of natural numbers is motivated by repeated multiplication, it is possible to define an operation based on repeated exponentiation; this operation is sometimes called hyper-4 or tetration. Iterating tetration leads to another operation, and so on, a concept named hyperoperation. This sequence of operations is expressed by the Ackermann function and Knuth's up-arrow notation. Just as exponentiation grows faster than multiplication, which is faster-growing than addition, tetration is faster-growing than exponentiation. Evaluated at $(3, 3)$ , the functions addition, multiplication, exponentiation, and tetration yield 6, 9, 27, and 7625597484987 ( $=3 27 = 3 33 = 33$ ) respectively.

Limits of powers

Zero to the power of zero gives a number of examples of limits that are of the indeterminate form 0⁰. The limits in these examples exist, but have different values, showing that the two-variable function $x y$ has no limit at the point $(0, 0)$ . One may consider at what points this function does have a limit.

More precisely, consider the function $f(x,y)=x^{y}$ defined on $D=\{(x,y)\in \mathbf {R} ^{2}:x>0\}$ . Then $D$ can be viewed as a subset of $R 2$ (that is, the set of all pairs $(x, y)$ with $x$ , $y$ belonging to the extended real number line $R = [-\infty, +\infty]$ , endowed with the product topology), which will contain the points at which the function $f$ has a limit.

In fact, $f$ has a limit at all accumulation points of $D$ , except for $(0, 0)$ , $(+\infty, 0)$ , $(1, +\infty)$ and $(1, -\infty)$ .^[38] Accordingly, this allows one to define the powers $x y$ by continuity whenever $0 \leq x \leq +\infty$ , $-\infty \leq y \leq +\infty$ , except for $00$ , $(+\infty) 0$ , $1 +\infty$ and $1 -\infty$ , which remain indeterminate forms.

Under this definition by continuity, we obtain:

$x +\infty = +\infty$ and $x -\infty = 0$ , when $1 < x \leq +\infty$ .
$x +\infty = 0$ and $x -\infty = +\infty$ , when $0 \leq x < 1$ .
$0 y = 0$ and $(+\infty) y = +\infty$ , when $0 < y \leq +\infty$ .
$0 y = +\infty$ and $(+\infty) y = 0$ , when $-\infty \leq y < 0$ .

These powers are obtained by taking limits of $x y$ for positive values of $x$ . This method does not permit a definition of $x y$ when $x < 0$ , since pairs $(x, y)$ with $x < 0$ are not accumulation points of $D$ .

On the other hand, when $n$ is an integer, the power $x n$ is already meaningful for all values of $x$ , including negative ones. This may make the definition $0 n = +\infty$ obtained above for negative $n$ problematic when $n$ is odd, since in this case $x n \to +\infty$ as $x$ tends to $0$ through positive values, but not negative ones.

Efficient computation with integer exponents

Computing $b n$ using iterated multiplication requires $n - 1$ multiplication operations, but it can be computed more efficiently than that, as illustrated by the following example. To compute $2100$ , apply Horner's rule to the exponent 100 written in binary:

100=2^{2}+2^{5}+2^{6}=2^{2}(1+2^{3}(1+2))

.

Then compute the following terms in order, reading Horner's rule from right to left.

2² = 4
2 (2²) = 2³ = 8
(2³)² = 2⁶ = 64
(2⁶)² = 2¹² = 4096
(2¹²)² = 2²⁴ = 16777216
2 (2²⁴) = 2²⁵ = 33554432
(2²⁵)² = 2⁵⁰ = 1125899906842624
(2⁵⁰)² = 2¹⁰⁰ = 1267650600228229401496703205376

This series of steps only requires 8 multiplications instead of 99.

In general, the number of multiplication operations required to compute $b n$ can be reduced to $\sharp n+\lfloor \log _{2}n\rfloor -1,$ by using exponentiation by squaring, where $\sharp n$ denotes the number of $1$ s in the binary representation of $n$ . For some exponents (100 is not among them), the number of multiplications can be further reduced by computing and using the minimal addition-chain exponentiation. Finding the minimal sequence of multiplications (the minimal-length addition chain for the exponent) for $b n$ is a difficult problem, for which no efficient algorithms are currently known (see Subset sum problem), but many reasonably efficient heuristic algorithms are available.^[39] However, in practical computations, exponentiation by squaring is efficient enough, and much more easy to implement.

Iterated functions

Function composition is a binary operation that is defined on functions such that the codomain of the function written on the right is included in the domain of the function written on the left. It is denoted $g\circ f,$ and defined as

(g\circ f)(x)=g(f(x))

for every $x$ in the domain of $f$ .

If the domain of a function $f$ equals its codomain, one may compose the function with itself an arbitrary number of time, and this defines the $n$ th power of the function under composition, commonly called the $n$ th iterate of the function. Thus $f^{n}$ denotes generally the $n$ th iterate of $f$ ; for example, $f^{3}(x)$ means $f(f(f(x))).$ ^[40]

When a multiplication is defined on the codomain of the function, this defines a multiplication on functions, the pointwise multiplication, which induces another exponentiation. When using functional notation, the two kinds of exponentiation are generally distinguished by placing the exponent of the functional iteration before the parentheses enclosing the arguments of the function, and placing the exponent of pointwise multiplication after the parentheses. Thus $f^{2}(x)=f(f(x)),$ and $f(x)^{2}=f(x)\cdot f(x).$ When functional notation is not used, disambiguation is often done by placing the composition symbol before the exponent; for example $f^{\circ 3}=f\circ f\circ f,$ and $f^{3}=f\cdot f\cdot f.$ For historical reasons, the exponent of a repeated multiplication is placed before the argument for some specific functions, typically the trigonometric functions. So, $\sin ^{2}x$ and $\sin ^{2}(x)$ both mean $\sin(x)\cdot \sin(x)$ and not $\sin(\sin(x)),$ which, in any case, is rarely considered. Historically, several variants of these notations were used by different authors.^[41]^[42]^[43]

In this context, the exponent $-1$ denotes always the inverse function, if it exists. So $\sin ^{-1}x=\sin ^{-1}(x)=\arcsin x.$ For the multiplicative inverse fractions are generally used as in $1/\sin(x)={\frac {1}{\sin x}}.$

In programming languages

Programming languages generally express exponentiation either as an infix operator or as a function application, as they do not support superscripts. The most common operator symbol for exponentiation is the caret (^). The original version of ASCII included an uparrow symbol (↑), intended for exponentiation, but this was replaced by the caret in 1967, so the caret became usual in programming languages.^[44] The notations include:

x ^ y: AWK, BASIC, J, MATLAB, Wolfram Language (Mathematica), R, Microsoft Excel, Analytica, TeX (and its derivatives), TI-BASIC, bc (for integer exponents), Haskell (for nonnegative integer exponents), Lua, and most computer algebra systems.
x ** y. The Fortran character set did not include lowercase characters or punctuation symbols other than +-*/()&=.,' and so used ** for exponentiation^[45]^[46] (the initial version used a xx b instead.^[47]). Many other languages followed suit: Ada, Z shell, KornShell, Bash, COBOL, CoffeeScript, Fortran, FoxPro, Gnuplot, Groovy, JavaScript, OCaml, F#, Perl, PHP, PL/I, Python, Rexx, Ruby, SAS, Seed7, Tcl, ABAP, Mercury, Haskell (for floating-point exponents), Turing, and VHDL.
x ↑ y: Algol Reference language, Commodore BASIC, TRS-80 Level II/III BASIC.^[48]^[49]
x ^^ y: Haskell (for fractional base, integer exponents), D.
x⋆y: APL.

In most programming languages with an infix exponentiation operator, it is right-associative, that is, a^b^c is interpreted as a^(b^c).^[50] This is because (a^b)^c is equal to a^(b*c) and thus not as useful. In some languages, it is left-associative, notably in Algol, MATLAB, and the Microsoft Excel formula language.

Other programming languages use functional notation:

(expt x y): Common Lisp.
pown x y: F# (for integer base, integer exponent).

Still others only provide exponentiation as part of standard libraries:

pow(x, y): C, C++ (in math library).
Math.Pow(x, y): C#.
math:pow(X, Y): Erlang.
Math.pow(x, y): Java.
[Math]::Pow(x, y): PowerShell.

In some statically typed languages that prioritize type safety such as Rust, exponentiation is performed via a multitude of methods:

x.pow(y) for x and y as integers
x.powf(y) for x and y as floating point numbers
x.powi(y) for x as a float and y as an integer

Notes

^ There are three common notations for multiplication: $x\times y$ is most commonly used for explicit numbers and at a very elementary level; $xy$ is most common when variables are used; $x\cdot y$ is used for emphasizing that one talks of multiplication or when omitting the multiplication sign would be confusing.
^ More generally, power associativity is sufficient for the definition.

References

^ Jump up to: ^a ^b ^c ^d ^e Nykamp, Duane. "Basic rules for exponentiation". Math Insight. Retrieved 2020-08-27.
^ Weisstein, Eric W. "Power". MathWorld. Retrieved 2020-08-27.
^ "Exponent | Etymology of exponent by etymonline".
^ Jump up to: ^a ^b Rotman, Joseph J. (2015). Advanced Modern Algebra, Part 1. Graduate Studies in Mathematics. Vol. 165 (3rd ed.). Providence, RI: American Mathematical Society. p. 130, fn. 4. ISBN 978-1-4704-1554-9.
^ Szabó, Árpád (1978). The Beginnings of Greek Mathematics. Synthese Historical Library. Vol. 17. Translated by A.M. Ungar. Dordrecht: D. Reidel. p. 37. ISBN 90-277-0819-3.
^ Jump up to: ^a ^b O'Connor, John J.; Robertson, Edmund F. "Etymology of some common mathematical terms". MacTutor History of Mathematics Archive. University of St Andrews.
^ Ball, W. W. Rouse (1915). A Short Account of the History of Mathematics (6th ed.). London: Macmillan. p. 38.
^ Archimedes. (2009). THE SAND-RECKONER. In T. Heath (Ed.), The Works of Archimedes: Edited in Modern Notation with Introductory Chapters (Cambridge Library Collection - Mathematics, pp. 229-232). Cambridge: Cambridge University Press. doi:10.1017/CBO9780511695124.017.
^ Jump up to: ^a ^b Quinion, Michael. "Zenzizenzizenzic". World Wide Words. Retrieved 2020-04-16.
^ O'Connor, John J.; Robertson, Edmund F. "Abu'l Hasan ibn Ali al Qalasadi". MacTutor History of Mathematics Archive. University of St Andrews.
^ Cajori, Florian (1928). A History of Mathematical Notations. Vol. 1. The Open Court Company. p. 102.
^ Cajori, Florian (1928). A History of Mathematical Notations. Vol. 1. London: Open Court Publishing Company. p. 344.
^ "Earliest Known Uses of Some of the Words of Mathematics (E)". 2017-06-23.
^ Stifel, Michael (1544). Arithmetica integra. Nuremberg: Johannes Petreius. p. 235v.
^ Cajori, Florian (1928). A History of Mathematical Notations. Vol. 1. The Open Court Company. p. 204.
^ Descartes, René (1637). "La Géométrie". Discourse de la méthode [...]. Leiden: Jan Maire. p. 299. Et aa, ou $a 2$ , pour multiplier $a$ par soy mesme; Et $a 3$ , pour le multiplier encore une fois par $a$ , & ainsi a l'infini (And $aa$ , or $a 2$ , in order to multiply $a$ by itself; and $a 3$ , in order to multiply it once more by $a$ , and thus to infinity).
^ The most recent usage in this sense cited by the OED is from 1806 ("involution". Oxford English Dictionary (Online ed.). Oxford University Press. (Subscription or participating institution membership required.)).
^ Euler, Leonhard (1748). Introductio in analysin infinitorum (in Latin). Vol. I. Lausanne: Marc-Michel Bousquet. pp. 69, 98–99. Primum ergo considerandæ sunt quantitates exponentiales, seu Potestates, quarum Exponens ipse est quantitas variabilis. Perspicuum enim est hujusmodi quantitates ad Functiones algebraicas referri non posse, cum in his Exponentes non nisi constantes locum habeant.
^ Hodge, Jonathan K.; Schlicker, Steven; Sundstorm, Ted (2014). Abstract Algebra: an inquiry based approach. CRC Press. p. 94. ISBN 978-1-4665-6706-1.
^ Achatz, Thomas (2005). Technical Shop Mathematics (3rd ed.). Industrial Press. p. 101. ISBN 978-0-8311-3086-2.
^ Knobloch, Eberhard (1994). "The infinite in Leibniz's mathematics – The historiographical method of comprehension in context". In Kostas Gavroglu; Jean Christianidis; Efthymios Nicolaidis (eds.). Trends in the Historiography of Science. Boston Studies in the Philosophy of Science. Springer Netherlands. p. 276. doi:10.1007/978-94-017-3596-4_20. ISBN 9789401735964. A positive power of zero is infinitely small, a negative power of zero is infinite.
^ Bronstein, Ilja Nikolaevič; Semendjajew, Konstantin Adolfovič (1987) [1945]. "2.4.1.1. Definition arithmetischer Ausdrücke" [Definition of arithmetic expressions]. Written at Leipzig, Germany. In Grosche, Günter; Ziegler, Viktor; Ziegler, Dorothea (eds.). Taschenbuch der Mathematik [Pocketbook of mathematics] (in German). Vol. 1. Translated by Ziegler, Viktor. Weiß, Jürgen (23 ed.). Thun, Switzerland / Frankfurt am Main, Germany: Verlag Harri Deutsch (and B. G. Teubner Verlagsgesellschaft, Leipzig). pp. 115–120, 802. ISBN 3-87144-492-8.
^ Olver, Frank W. J.; Lozier, Daniel W.; Boisvert, Ronald F.; Clark, Charles W., eds. (2010). NIST Handbook of Mathematical Functions. National Institute of Standards and Technology (NIST), U.S. Department of Commerce, Cambridge University Press. ISBN 978-0-521-19225-5. MR 2723248.[1]
^ Zeidler, Eberhard [in German]; Schwarz, Hans Rudolf; Hackbusch, Wolfgang; Luderer, Bernd [in German]; Blath, Jochen; Schied, Alexander; Dempe, Stephan; Wanka, Gert; Hromkovič, Juraj; Gottwald, Siegfried (2013) [2012]. Zeidler, Eberhard [in German] (ed.). Springer-Handbuch der Mathematik I (in German). Vol. I (1 ed.). Berlin / Heidelberg, Germany: Springer Spektrum, Springer Fachmedien Wiesbaden. p. 590. ISBN 978-3-658-00284-8. (xii+635 pages)
^ Hass, Joel R.; Heil, Christopher E.; Weir, Maurice D.; Thomas, George B. (2018). Thomas' Calculus (14 ed.). Pearson. pp. 7–8. ISBN 9780134439020.
^ Jump up to: ^a ^b Anton, Howard; Bivens, Irl; Davis, Stephen (2012). Calculus: Early Transcendentals (9th ed.). John Wiley & Sons. p. 28. ISBN 9780470647691.
^ Denlinger, Charles G. (2011). Elements of Real Analysis. Jones and Bartlett. pp. 278–283. ISBN 978-0-7637-7947-4.
^ Tao, Terence (2016). "Limits of sequences". Analysis I. Texts and Readings in Mathematics. Vol. 37. pp. 126–154. doi:10.1007/978-981-10-1789-6_6. ISBN 978-981-10-1789-6.
^ Cormen, Thomas H.; Leiserson, Charles E.; Rivest, Ronald L.; Stein, Clifford (2001). Introduction to Algorithms (second ed.). MIT Press. ISBN 978-0-262-03293-3. Online resource Archived 2007-09-30 at the Wayback Machine.
^ Cull, Paul; Flahive, Mary; Robson, Robby (2005). Difference Equations: From Rabbits to Chaos (Undergraduate Texts in Mathematics ed.). Springer. ISBN 978-0-387-23234-8. Defined on p. 351.
^ Weisstein, Eric W. "Principal root of unity". MathWorld.
^ Steiner, J.; Clausen, T.; Abel, Niels Henrik (1827). "Aufgaben und Lehrsätze, erstere aufzulösen, letztere zu beweisen" [Problems and propositions, the former to solve, the later to prove]. Journal für die reine und angewandte Mathematik. 2: 286–287.
^ Bourbaki, Nicolas (1970). Algèbre. Springer. I.2.
^ Bloom, David M. (1979). Linear Algebra and Geometry. Cambridge University Press. p. 45. ISBN 978-0-521-29324-2.
^ Chapter 1, Elementary Linear Algebra, 8E, Howard Anton.
^ Strang, Gilbert (1988). Linear algebra and its applications (3rd ed.). Brooks-Cole. Chapter 5.
^ E. Hille, R. S. Phillips: Functional Analysis and Semi-Groups. American Mathematical Society, 1975.
^ Nicolas Bourbaki, Topologie générale, V.4.2.
^ Gordon, D. M. (1998). "A Survey of Fast Exponentiation Methods" (PDF). Journal of Algorithms. 27: 129–146. CiteSeerX 10.1.1.17.7076. doi:10.1006/jagm.1997.0913. Archived from the original (PDF) on 2018-07-23. Retrieved 2024-01-11.
^ Peano, Giuseppe (1903). Formulaire mathématique (in French). Vol. IV. p. 229.
^ Herschel, John Frederick William (1813) [1812-11-12]. "On a Remarkable Application of Cotes's Theorem". Philosophical Transactions of the Royal Society of London. 103 (Part 1). London: Royal Society of London, printed by W. Bulmer and Co., Cleveland-Row, St. James's, sold by G. and W. Nicol, Pall-Mall: 8–26 [10]. doi:10.1098/rstl.1813.0005. JSTOR 107384. S2CID 118124706.
^ Herschel, John Frederick William (1820). "Part III. Section I. Examples of the Direct Method of Differences". A Collection of Examples of the Applications of the Calculus of Finite Differences. Cambridge, UK: Printed by J. Smith, sold by J. Deighton & sons. pp. 1–13 [5–6]. Archived from the original on 2020-08-04. Retrieved 2020-08-04. [2] (NB. Inhere, Herschel refers to his 1813 work and mentions Hans Heinrich Bürmann's older work.)
^ Cajori, Florian (1952) [March 1929]. A History of Mathematical Notations. Vol. 2 (3rd ed.). Chicago, USA: Open court publishing company. pp. 108, 176–179, 336, 346. ISBN 978-1-60206-714-1. Retrieved 2016-01-18.
^ Richard Gillam (2003). Unicode Demystified: A Practical Programmer's Guide to the Encoding Standard. p. 33. ISBN 0201700522.
^ Backus, John Warner; Beeber, R. J.; Best, Sheldon F.; Goldberg, Richard; Herrick, Harlan L.; Hughes, R. A.; Mitchell, L. B.; Nelson, Robert A.; Nutt, Roy; Sayre, David; Sheridan, Peter B.; Stern, Harold; Ziller, Irving (1956-10-15). Sayre, David (ed.). The FORTRAN Automatic Coding System for the IBM 704 EDPM: Programmer's Reference Manual (PDF). New York, USA: Applied Science Division and Programming Research Department, International Business Machines Corporation. p. 15. Archived (PDF) from the original on 2022-07-04. Retrieved 2022-07-04. (2+51+1 pages)
^ Brice Carnahan; James O. Wilkes (1968). Introduction to Digital Computing and FORTRAN IV with MTS Applications. pp. 2–2, 2–6.
^ Backus, John Warner; Herrick, Harlan L.; Nelson, Robert A.; Ziller, Irving (1954-11-10). Backus, John Warner (ed.). Specifications for: The IBM Mathematical FORmula TRANSlating System, FORTRAN (PDF) (Preliminary report). New York, USA: Programming Research Group, Applied Science Division, International Business Machines Corporation. pp. 4, 6. Archived (PDF) from the original on 2022-03-29. Retrieved 2022-07-04. (29 pages)
^ Daneliuk, Timothy "Tim" A. (1982-08-09). "BASCOM - A BASIC compiler for TRS-80 I and II". InfoWorld. Software Reviews. Vol. 4, no. 31. Popular Computing, Inc. pp. 41–42. Archived from the original on 2020-02-07. Retrieved 2020-02-06.
^ "80 Contents". 80 Micro (45). 1001001, Inc.: 5. October 1983. ISSN 0744-7868. Retrieved 2020-02-06.
^ Robert W. Sebesta (2010). Concepts of Programming Languages. pp. 130, 324. ISBN 0136073476.

[3] There are three common notations for multiplication: $x\times y$ is most commonly used for explicit numbers and at a very elementary level; $xy$ is most common when variables are used; $x\cdot y$ is used for emphasizing that one talks of multiplication or when omitting the multiplication sign would be confusing.

[34] More generally, power associativity is sufficient for the definition.

[:1-1] Jump up to: ^a ^b ^c ^d ^e Nykamp, Duane. "Basic rules for exponentiation". Math Insight. Retrieved 2020-08-27.

[2] Weisstein, Eric W. "Power". MathWorld. Retrieved 2020-08-27.

[4] "Exponent | Etymology of exponent by etymonline".

[Rotman-5] Jump up to: ^a ^b Rotman, Joseph J. (2015). Advanced Modern Algebra, Part 1. Graduate Studies in Mathematics. Vol. 165 (3rd ed.). Providence, RI: American Mathematical Society. p. 130, fn. 4. ISBN 978-1-4704-1554-9.

[6] Szabó, Árpád (1978). The Beginnings of Greek Mathematics. Synthese Historical Library. Vol. 17. Translated by A.M. Ungar. Dordrecht: D. Reidel. p. 37. ISBN 90-277-0819-3.

[MacTutor-7] Jump up to: ^a ^b O'Connor, John J.; Robertson, Edmund F. "Etymology of some common mathematical terms". MacTutor History of Mathematics Archive. University of St Andrews.

[8] Ball, W. W. Rouse (1915). A Short Account of the History of Mathematics (6th ed.). London: Macmillan. p. 38.

[9] Archimedes. (2009). THE SAND-RECKONER. In T. Heath (Ed.), The Works of Archimedes: Edited in Modern Notation with Introductory Chapters (Cambridge Library Collection - Mathematics, pp. 229-232). Cambridge: Cambridge University Press. doi:10.1017/CBO9780511695124.017.

[worldwidewords-10] Jump up to: ^a ^b Quinion, Michael. "Zenzizenzizenzic". World Wide Words. Retrieved 2020-04-16.

[11] O'Connor, John J.; Robertson, Edmund F. "Abu'l Hasan ibn Ali al Qalasadi". MacTutor History of Mathematics Archive. University of St Andrews.

[12] Cajori, Florian (1928). A History of Mathematical Notations. Vol. 1. The Open Court Company. p. 102.

[cajori-13] Cajori, Florian (1928). A History of Mathematical Notations. Vol. 1. London: Open Court Publishing Company. p. 344.

[14] "Earliest Known Uses of Some of the Words of Mathematics (E)". 2017-06-23.

[15] Stifel, Michael (1544). Arithmetica integra. Nuremberg: Johannes Petreius. p. 235v.

[16] Cajori, Florian (1928). A History of Mathematical Notations. Vol. 1. The Open Court Company. p. 204.

[17] Descartes, René (1637). "La Géométrie". Discourse de la méthode [...]. Leiden: Jan Maire. p. 299. Et aa, ou $a 2$ , pour multiplier $a$ par soy mesme; Et $a 3$ , pour le multiplier encore une fois par $a$ , & ainsi a l'infini (And $aa$ , or $a 2$ , in order to multiply $a$ by itself; and $a 3$ , in order to multiply it once more by $a$ , and thus to infinity).

[18] The most recent usage in this sense cited by the OED is from 1806 ("involution". Oxford English Dictionary (Online ed.). Oxford University Press. (Subscription or participating institution membership required.)).

[Euler_1748-19] Euler, Leonhard (1748). Introductio in analysin infinitorum (in Latin). Vol. I. Lausanne: Marc-Michel Bousquet. pp. 69, 98–99. Primum ergo considerandæ sunt quantitates exponentiales, seu Potestates, quarum Exponens ipse est quantitas variabilis. Perspicuum enim est hujusmodi quantitates ad Functiones algebraicas referri non posse, cum in his Exponentes non nisi constantes locum habeant.

[20] Hodge, Jonathan K.; Schlicker, Steven; Sundstorm, Ted (2014). Abstract Algebra: an inquiry based approach. CRC Press. p. 94. ISBN 978-1-4665-6706-1.

[21] Achatz, Thomas (2005). Technical Shop Mathematics (3rd ed.). Industrial Press. p. 101. ISBN 978-0-8311-3086-2.

[22] Knobloch, Eberhard (1994). "The infinite in Leibniz's mathematics – The historiographical method of comprehension in context". In Kostas Gavroglu; Jean Christianidis; Efthymios Nicolaidis (eds.). Trends in the Historiography of Science. Boston Studies in the Philosophy of Science. Springer Netherlands. p. 276. doi:10.1007/978-94-017-3596-4_20. ISBN 9789401735964. A positive power of zero is infinitely small, a negative power of zero is infinite.

[Bronstein_1987-23] Bronstein, Ilja Nikolaevič; Semendjajew, Konstantin Adolfovič (1987) [1945]. "2.4.1.1. Definition arithmetischer Ausdrücke" [Definition of arithmetic expressions]. Written at Leipzig, Germany. In Grosche, Günter; Ziegler, Viktor; Ziegler, Dorothea (eds.). Taschenbuch der Mathematik [Pocketbook of mathematics] (in German). Vol. 1. Translated by Ziegler, Viktor. Weiß, Jürgen (23 ed.). Thun, Switzerland / Frankfurt am Main, Germany: Verlag Harri Deutsch (and B. G. Teubner Verlagsgesellschaft, Leipzig). pp. 115–120, 802. ISBN 3-87144-492-8.

[NIST_2010-24] Olver, Frank W. J.; Lozier, Daniel W.; Boisvert, Ronald F.; Clark, Charles W., eds. (2010). NIST Handbook of Mathematical Functions. National Institute of Standards and Technology (NIST), U.S. Department of Commerce, Cambridge University Press. ISBN 978-0-521-19225-5. MR 2723248.[1]

[Zeidler_2013-25] Zeidler, Eberhard [in German]; Schwarz, Hans Rudolf; Hackbusch, Wolfgang; Luderer, Bernd [in German]; Blath, Jochen; Schied, Alexander; Dempe, Stephan; Wanka, Gert; Hromkovič, Juraj; Gottwald, Siegfried (2013) [2012]. Zeidler, Eberhard [in German] (ed.). Springer-Handbuch der Mathematik I (in German). Vol. I (1 ed.). Berlin / Heidelberg, Germany: Springer Spektrum, Springer Fachmedien Wiesbaden. p. 590. ISBN 978-3-658-00284-8. (xii+635 pages)

[26] Hass, Joel R.; Heil, Christopher E.; Weir, Maurice D.; Thomas, George B. (2018). Thomas' Calculus (14 ed.). Pearson. pp. 7–8. ISBN 9780134439020.

[Calculus:_Early_Transcendentals-27] Jump up to: ^a ^b Anton, Howard; Bivens, Irl; Davis, Stephen (2012). Calculus: Early Transcendentals (9th ed.). John Wiley & Sons. p. 28. ISBN 9780470647691.

[Denlinger-28] Denlinger, Charles G. (2011). Elements of Real Analysis. Jones and Bartlett. pp. 278–283. ISBN 978-0-7637-7947-4.

[29] Tao, Terence (2016). "Limits of sequences". Analysis I. Texts and Readings in Mathematics. Vol. 37. pp. 126–154. doi:10.1007/978-981-10-1789-6_6. ISBN 978-981-10-1789-6.

[30] Cormen, Thomas H.; Leiserson, Charles E.; Rivest, Ronald L.; Stein, Clifford (2001). Introduction to Algorithms (second ed.). MIT Press. ISBN 978-0-262-03293-3. Online resource Archived 2007-09-30 at the Wayback Machine.

[31] Cull, Paul; Flahive, Mary; Robson, Robby (2005). Difference Equations: From Rabbits to Chaos (Undergraduate Texts in Mathematics ed.). Springer. ISBN 978-0-387-23234-8. Defined on p. 351.

[32] Weisstein, Eric W. "Principal root of unity". MathWorld.

[Clausen1827-33] Steiner, J.; Clausen, T.; Abel, Niels Henrik (1827). "Aufgaben und Lehrsätze, erstere aufzulösen, letztere zu beweisen" [Problems and propositions, the former to solve, the later to prove]. Journal für die reine und angewandte Mathematik. 2: 286–287.

[35] Bourbaki, Nicolas (1970). Algèbre. Springer. I.2.

[36] Bloom, David M. (1979). Linear Algebra and Geometry. Cambridge University Press. p. 45. ISBN 978-0-521-29324-2.

[37] Chapter 1, Elementary Linear Algebra, 8E, Howard Anton.

[38] Strang, Gilbert (1988). Linear algebra and its applications (3rd ed.). Brooks-Cole. Chapter 5.

[39] E. Hille, R. S. Phillips: Functional Analysis and Semi-Groups. American Mathematical Society, 1975.

[40] Nicolas Bourbaki, Topologie générale, V.4.2.

[41] Gordon, D. M. (1998). "A Survey of Fast Exponentiation Methods" (PDF). Journal of Algorithms. 27: 129–146. CiteSeerX 10.1.1.17.7076. doi:10.1006/jagm.1997.0913. Archived from the original (PDF) on 2018-07-23. Retrieved 2024-01-11.

[Peano_1903-42] Peano, Giuseppe (1903). Formulaire mathématique (in French). Vol. IV. p. 229.

[Herschel_1813-43] Herschel, John Frederick William (1813) [1812-11-12]. "On a Remarkable Application of Cotes's Theorem". Philosophical Transactions of the Royal Society of London. 103 (Part 1). London: Royal Society of London, printed by W. Bulmer and Co., Cleveland-Row, St. James's, sold by G. and W. Nicol, Pall-Mall: 8–26 [10]. doi:10.1098/rstl.1813.0005. JSTOR 107384. S2CID 118124706.

[Herschel_1820-44] Herschel, John Frederick William (1820). "Part III. Section I. Examples of the Direct Method of Differences". A Collection of Examples of the Applications of the Calculus of Finite Differences. Cambridge, UK: Printed by J. Smith, sold by J. Deighton & sons. pp. 1–13 [5–6]. Archived from the original on 2020-08-04. Retrieved 2020-08-04. [2] (NB. Inhere, Herschel refers to his 1813 work and mentions Hans Heinrich Bürmann's older work.)

[Cajori_1929-45] Cajori, Florian (1952) [March 1929]. A History of Mathematical Notations. Vol. 2 (3rd ed.). Chicago, USA: Open court publishing company. pp. 108, 176–179, 336, 346. ISBN 978-1-60206-714-1. Retrieved 2016-01-18.

[46] Richard Gillam (2003). Unicode Demystified: A Practical Programmer's Guide to the Encoding Standard. p. 33. ISBN 0201700522.

[Sayre_1956-47] Backus, John Warner; Beeber, R. J.; Best, Sheldon F.; Goldberg, Richard; Herrick, Harlan L.; Hughes, R. A.; Mitchell, L. B.; Nelson, Robert A.; Nutt, Roy; Sayre, David; Sheridan, Peter B.; Stern, Harold; Ziller, Irving (1956-10-15). Sayre, David (ed.). The FORTRAN Automatic Coding System for the IBM 704 EDPM: Programmer's Reference Manual (PDF). New York, USA: Applied Science Division and Programming Research Department, International Business Machines Corporation. p. 15. Archived (PDF) from the original on 2022-07-04. Retrieved 2022-07-04. (2+51+1 pages)

[48] Brice Carnahan; James O. Wilkes (1968). Introduction to Digital Computing and FORTRAN IV with MTS Applications. pp. 2–2, 2–6.

[Backus_1954-49] Backus, John Warner; Herrick, Harlan L.; Nelson, Robert A.; Ziller, Irving (1954-11-10). Backus, John Warner (ed.). Specifications for: The IBM Mathematical FORmula TRANSlating System, FORTRAN (PDF) (Preliminary report). New York, USA: Programming Research Group, Applied Science Division, International Business Machines Corporation. pp. 4, 6. Archived (PDF) from the original on 2022-03-29. Retrieved 2022-07-04. (29 pages)

[InfoWorld_1982-50] Daneliuk, Timothy "Tim" A. (1982-08-09). "BASCOM - A BASIC compiler for TRS-80 I and II". InfoWorld. Software Reviews. Vol. 4, no. 31. Popular Computing, Inc. pp. 41–42. Archived from the original on 2020-02-07. Retrieved 2020-02-06.

[80Micro_1983-51] "80 Contents". 80 Micro (45). 1001001, Inc.: 5. October 1983. ISSN 0744-7868. Retrieved 2020-02-06.

[52] Robert W. Sebesta (2010). Concepts of Programming Languages. pp. 130, 324. ISBN 0136073476.

[1]

[2]

[nb 1]

[3]

[4]

[5]

[6]

[7]

[8]

[9]

[10]

[11]

[12]

[13]

[14]

[15]

[16]

[17]

[18]

[19]

[20]

[21]

[22]

[23]

[24]

[25]

[26]

[27]

[28]

[29]

[30]

[31]

[32]

[nb 2]

[33]

[34]

[35]

[36]

[37]

[38]

[39]

[40]

[41]

[42]

[43]

[44]

[45]

[46]

[47]

[48]

[49]

[50]

v t e	Arithmetic expressions	Polynomial expressions	Algebraic expressions	Closed-form expressions	Analytic expressions	Mathematical expressions
Constant	Yes	Yes	Yes	Yes	Yes	Yes
Elementary arithmetic operation	Yes	Addition, subtraction, and multiplication only	Yes	Yes	Yes	Yes
Finite sum	Yes	Yes	Yes	Yes	Yes	Yes
Finite product	Yes	Yes	Yes	Yes	Yes	Yes
Finite continued fraction	Yes	No	Yes	Yes	Yes	Yes
Variable	No	Yes	Yes	Yes	Yes	Yes
Integer exponent	No	Yes	Yes	Yes	Yes	Yes
Integer nth root	No	No	Yes	Yes	Yes	Yes
Rational exponent	No	No	Yes	Yes	Yes	Yes
Integer factorial	No	No	Yes	Yes	Yes	Yes
Irrational exponent	No	No	No	Yes	Yes	Yes
Exponential function	No	No	No	Yes	Yes	Yes
Logarithm	No	No	No	Yes	Yes	Yes
Trigonometric function	No	No	No	Yes	Yes	Yes
Inverse trigonometric function	No	No	No	Yes	Yes	Yes
Hyperbolic function	No	No	No	Yes	Yes	Yes
Inverse hyperbolic function	No	No	No	Yes	Yes	Yes
Root of a polynomial that is not an algebraic solution	No	No	No	No	Yes	Yes
Gamma function and factorial of a non-integer	No	No	No	No	Yes	Yes
Bessel function	No	No	No	No	Yes	Yes
Special function	No	No	No	No	Yes	Yes
Infinite sum (series) (including power series)	No	No	No	No	Convergent only	Yes
Infinite product	No	No	No	No	Convergent only	Yes
Infinite continued fraction	No	No	No	No	Convergent only	Yes
Limit	No	No	No	No	No	Yes
Derivative	No	No	No	No	No	Yes
Integral	No	No	No	No	No	Yes

v t e Hyperoperations
Primary	Successor (0) Addition (1) Multiplication (2) Exponentiation (3) Tetration (4) Pentation (5) Hexation (6)
Inverse for left argument	Predecessor (0) Subtraction (1) Division (2) Root extraction (3) Super-root (4)
Inverse for right argument	Predecessor (0) Subtraction (1) Division (2) Logarithm (3) Super-logarithm (4)
Related articles	Ackermann function Conway chained arrow notation Grzegorczyk hierarchy Knuth's up-arrow notation Steinhaus–Moser notation

v t e Orders of magnitude of time
by powers of ten
Negative powers	<1 attosecond attosecond femtosecond picosecond nanosecond microsecond millisecond
Positive powers	second kilosecond megasecond gigasecond terasecond and longer