Exponentiation

Get Exponentiation essential facts below. View Videos or join the Exponentiation discussion. Add Exponentiation to your PopFlock.com topic list for future reference or share this resource on social media.
## History of the notation

## Terminology

## Integer exponents

### Positive exponents

### Zero exponent

### Negative exponents

### Identities and properties

### Powers of a sum

### Combinatorial interpretation

### Particular bases

#### Powers of ten

#### Powers of two

#### Powers of one

#### Powers of zero

#### Powers of negative one

### Large exponents

### Power functions

### List of whole-number powers

## Rational exponents

## Real exponents

### Limits of rational exponents

### The exponential function

### Powers via logarithms

### Real exponents with negative bases

### Irrational exponents

## Complex exponents with a positive real base

### Series definition

### Limit definition

### Periodicity

### Examples

## Powers of complex numbers

### Complex exponents with complex bases

### Complex roots of unity

### Roots of arbitrary complex numbers

### Computing complex powers

### Failure of power and logarithm identities

## Generalizations

### Monoids

### Matrices and linear operators

### Finite fields

### In abstract algebra

### Over sets

### In category theory

### Of cardinal and ordinal numbers

## Repeated exponentiation

## Limits of powers

## Efficient computation with integer exponents

## Exponential notation for function names

## In programming languages

## See also

## Notes

## References

## External links

This article uses material from the Wikipedia page available here. It is released under the Creative Commons Attribution-Share-Alike License 3.0.

Exponentiation

**Exponentiation** is a mathematical operation, written as *b*^{n}, involving two numbers, the *base* b and the *exponent* or *power* n, and pronounced as "b raised to the power of n".^{[1]}^{[2]} 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:^{[2]}

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 n-th power", "b raised to the power of n",^{[1]} "the n-th power of b", "b to the n-th power",^{[3]} or most briefly as "b to the n-th".

One has *b*^{1} = *b*, and, for any positive integers m and n, one has *b*^{n} ? *b*^{m} = *b*^{n+m}. To extend this property to non-positive integer exponents, *b*^{0} is defined to be 1, and *b*^{-n} (with n a positive integer and b not zero) is defined as . In particular, *b*^{-1} is equal to , the *reciprocal* of b.

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.

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]}Archimedes discovered and proved the law of exponents, 10^{a} ? 10^{b} = 10^{a+b}, necessary to manipulate powers of 10.^{[8]}^{[better source needed]} In the 9th century, the Persian mathematician Muhammad ibn M?s? al-Khw?rizm? 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 Ab? al-Hasan ibn Al? al-Qalas?d?.^{[10]}

In the late 16th century, Jost Bürgi used Roman numerals for exponents.^{[11]}

Nicolas Chuquet used a form of exponential notation in the 15th century, which was later used by Henricus Grammateus and Michael Stifel in the 16th century. The word *exponent* was coined in 1544 by Michael Stifel.^{[12]}^{[13]}Samuel Jeake introduced the term *indices* in 1696.^{[6]} 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.

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.^{[14]}

Some mathematicians (such as Isaac Newton) 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*.

Another historical synonym, **involution**, is now rare^{[15]} and should not be confused with its more common meaning.

In 1748, Leonhard Euler wrote:

"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."

^{[16]}

With this introduction of transcendental functions, Euler laid the foundation for the modern introduction of natural logarithm--as the inverse function for the natural exponential function, *f*(*x*) = *e*^{x}.

The expression *b*^{2} = *b* ? *b* is called "the square of *b*" or "*b* squared", because the area of a square with side-length *b* is *b*^{2}.

Similarly, the expression *b*^{3} = *b* ? *b* ? *b* is called "the cube of *b*" or "*b* cubed", because the volume of a cube with side-length *b* is *b*^{3}.

When it is a positive integer, the exponent indicates how many copies of the base are multiplied together. For example, 3^{5} = 3 ? 3 ? 3 ? 3 ? 3 = 243. The base 3 appears 5 times in the repeated 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 3^{5} 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 *n*th power", "*b* to the *n*th", or most briefly as "*b* to the *n*".

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

Powers with positive integer exponents may be defined by the base case^{[17]}

and the recurrence relation

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

Any nonzero number raised to the 0 power is 1:^{[18]}^{[2]}

One interpretation of such a power is as an empty product.

The case of 0^{0} is more complicated, and the choice of whether to assign it a value and what value to assign may depend on context.

The following identity holds for any integer n and nonzero b:

^{[2]}

Raising 0 to a negative exponent is undefined, but in some circumstances, it may be interpreted as infinity (?).

The identity above may be derived through a definition aimed at extending the range of exponents to negative integers.

For non-zero b and positive n, the recurrence relation above can be rewritten as

By defining this relation as valid for all integer n and nonzero b, it follows that

and more generally for any nonzero b and any nonnegative integer n,

This is then readily shown to be true for every integer n.

The following identities hold for all integer exponents, provided that the base is non-zero:^{[2]}

Unlike addition and multiplication:

- Exponentiation is not commutative. For example, 2
^{3}= 8 ? 3^{2}= 9. - Exponentiation is not associative. For example, (2
^{3})^{4}= 8^{4}= 4096, whereas 2^{(34)}= 2^{81}= . Without parentheses, the conventional order of operations for serial exponentiation in superscript notation is top-down (or*right*-associative), not bottom-up^{[19]}^{[20]}^{[21]}^{[22]}(or*left*-associative). That is,which, in general, is different from

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

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**.

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*}none

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, = and = .

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

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

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 2^{8} = 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.

The powers of one are all one: 1^{n} = 1.

If the exponent n is positive (*n* > 0), the nth power of zero is zero: 0^{n} = 0.

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

The expression 0^{0} is either defined as 1, or it is left undefined (*see Zero to the power of zero*).

If *n* is an even integer, then (-1)^{n} = 1.

If *n* is an odd integer, then (-1)^{n} = -1.

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

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

*b*^{n}-> ? as*n*-> ? 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}-> 0 as*n*-> ? when || < 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}->*e*as*n*-> ?

See *§ The exponential function* below.

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

Real functions of the form , where , are sometimes called power functions.^{[]} When is an integer and , two primary families exist: for even, and for odd. In general for , when is even will tend towards positive infinity with increasing , and also towards positive infinity with decreasing . All graphs from the family of even power functions have the general shape of , flattening more in the middle as increases.^{[23]} Functions with this kind of symmetry are called even functions.

When is odd, 's asymptotic behavior reverses from positive to negative . For , will also tend towards positive infinity with increasing , but towards negative infinity with decreasing . All graphs from the family of odd power functions have the general shape of , flattening more in the middle as increases and losing all flatness there in the straight line for . Functions with this kind of symmetry are called odd functions.

For , the opposite asymptotic behavior is true in each case.^{[23]}

n |
n^{2} |
n^{3} |
n^{4} |
n^{5} |
n^{6} |
n^{7} |
n^{8} |
n^{9} |
n^{10} |
---|---|---|---|---|---|---|---|---|---|

2 |
4 | 8 | 16 | 32 | 64 | 128 | 256 | 512 | 1024 |

3 |
9 | 27 | 81 | 243 | 729 | ||||

4 |
16 | 64 | 256 | 1024 | |||||

5 |
25 | 125 | 625 | 3125 | |||||

6 |
36 | 216 | 1296 | ||||||

7 |
49 | 343 | 2401 | ||||||

8 |
64 | 512 | 4096 | ||||||

9 |
81 | 729 | 6561 | ||||||

10 |
100 | 1000 |

This section reads like a textbook and may require cleanup. Please help to make it neutral in tone and meet Wikipedia's quality standards. (February 2020) |

An ** nth root** of a number

If *b* is a positive real number and *n* is a positive integer, then there is exactly one positive real solution to *x ^{n}* =

The fact that solves follows from noting that

If *b* is equal to 0, the equation *x ^{n}* =

If *n* is even and *b* is positive, then *x ^{n}* =

If *n* is even and *b* is negative, the equation has no solution in real numbers.

If *n* is odd, then *x ^{n}* =

Taking a positive real number *b* to a rational exponent *u*/*v*, where *u* is an integer and *v* is a positive integer, and considering principal roots only, yields

Taking a negative real number *b* to a rational power *u*/*v*, where *u*/*v* is in lowest terms, yields a positive real result if *u* is even, and hence *v* is odd, because then *b*^{u} is positive; and yields a negative real result, if *u* and *v* are both odd, because then *b*^{u} is negative. The case of even *v* (and, hence, odd *u*) cannot be treated this way within the reals, since there is no real number *x* such that *x*^{2k} = -1, the value of *b*^{u/v} in this case must use the imaginary unit *i*, as described more fully in the section § Powers of complex numbers.

Thus we have (-27)^{1/3} = -3 and (-27)^{2/3} = 9. The number 4 has two 3/2 powers, namely 8 and -8; however, by convention the notation 4^{3/2} employs the **principal root**, and results in 8. For employing the *v*-th root the *u*/*v*-th power is also called the *v*/*u*-th root, and for even *v* the term *principal root* denotes also the positive result.

This sign ambiguity needs to be taken care of when applying the power identities. For instance:

is clearly wrong. The problem starts already in the first equality by introducing a *standard* notation for an inherently ambiguous situation -asking for an even root- and simply relying wrongly on only one, the *conventional* or *principal* interpretation. The same problem occurs also with an inappropriately introduced surd-notation, inherently enforcing a positive result:

instead of

In general the same sort of problems occur for complex numbers as described in the section § Failure of power and logarithm identities.

Exponentiation to real powers of positive real numbers can be defined either by extending the rational powers to reals by continuity, or more usually as given in § Powers via logarithms below. The result is always a positive real number, and the identities and properties shown above for integer exponents are true for positive real bases with non-integer exponents as well.

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 (see § Real exponents with negative bases). One may choose one of these values, called the principal value, but there is no choice of the principal value for which an identity such as

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.

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^{[24]}

where the limit as *r* gets close to *x* is taken only over rational values of *r*. This limit only exists for positive *b*. The (*?*, *?*)-definition of limit is used; this involves showing that for any desired accuracy of the result *b*^{x} one can choose a sufficiently small interval around x so all the rational powers in the interval are within the desired accuracy.

For example, if *x* = *?*, the nonterminating decimal representation *?* = 3.14159... can be used (based on strict monotonicity of the rational power) to obtain the intervals bounded by rational powers

- , , , , , ,

The bounded intervals converge to a unique real number, denoted by . This technique can be used to obtain the power of a positive real number *b* for any irrational exponent. The function *f*_{b}(*x*) = *b*^{x} is thus defined for any real number *x*.

The important mathematical constant e, sometimes called Euler's number, is approximately equal to 2.718 and is the base of the natural logarithm. Although exponentiation of *e* could, in principle, be treated the same as exponentiation of any other real number, such exponentials turn out to have particularly elegant and useful properties. Among other things, these properties allow exponentials of *e* to be generalized in a natural way to other types of exponents, such as complex numbers or even matrices, while coinciding with the familiar meaning of exponentiation with rational exponents.

As a consequence, the notation *e*^{x} usually denotes a generalized exponentiation definition called the **exponential function**, exp(*x*), which can be defined in many equivalent ways, for example, by

Among other properties, exp satisfies the exponential identity

The exponential function is defined for all integer, fractional, real, and complex values of *x*. In fact, the matrix exponential is well-defined for square matrices (in which case this exponential identity only holds when *x* and *y* commute) and is useful for solving systems of linear differential equations.

Since exp(1) is equal to *e*, and exp(*x*) satisfies this exponential identity, it immediately follows that exp(*x*) coincides with the repeated-multiplication definition of *e*^{x} for integer *x*, and it also follows that rational powers denote (positive) roots as usual, so exp(*x*) coincides with the *e*^{x} definitions in the previous section for all real *x* by continuity.

When *e*^{x} is defined as the exponential function, *b*^{x} can be defined, for other positive real numbers b, in terms of *e*^{x}. Specifically, the natural logarithm ln(*x*) is the inverse of the exponential function *e*^{x}. It is defined for *b* > 0, and satisfies

If *b*^{x} is to preserve the logarithm and exponent rules, then one must have

for each real number x.

This can be used as an alternative definition of the real-number power *b*^{x} and agrees with the definition given above using rational exponents and continuity. The definition of exponentiation using logarithms is more common in the context of complex numbers, as discussed below.

Powers of a positive real number are always positive real numbers. The solution of x^{2} = 4, however, can be either 2 or -2. The principal value of 4^{1/2} is 2, but -2 is also a valid square root. If the definition of exponentiation of real numbers is extended to allow negative results then the result is no longer well-behaved.

Neither the logarithm method nor the rational exponent method can be used to define *b*^{r} as a real number for a negative real number *b* and an arbitrary real number *r*. Indeed, *e*^{r} is positive for every real number *r*, so ln(*b*) is not defined as a real number for *b* .

The rational exponent method cannot be used for negative values of *b* because it relies on continuity. The function *f*(*r*) = *b*^{r} has a unique continuous extension^{[24]} from the rational numbers to the real numbers for each *b* > 0. But when *b* < 0, the function *f* is not even continuous on the set of rational numbers *r* for which it is defined.

For example, consider *b* = -1. The *n*th root of -1 is -1 for every odd natural number *n*. So if *n* is an odd positive integer, (-1)^{(m/n)} = -1 if *m* is odd, and (-1)^{(m/n)} = 1 if *m* is even. Thus the set of rational numbers *q* for which (-1)^{q} = 1 is dense in the rational numbers, as is the set of *q* for which (-1)^{q} = -1. This means that the function (-1)^{q} is not continuous at any rational number *q* where it is defined.

On the other hand, arbitrary complex powers of negative numbers *b* can be defined by choosing a *complex* logarithm of *b*.

If *b* is a positive real algebraic number, and *x* is a rational number, it has been shown above that *b*^{x} is an algebraic number. This remains true even if one accepts any algebraic number for *b*, with the only difference that *b*^{x} may take several values (a finite number, see below), which are all algebraic. The Gelfond-Schneider theorem provides some information on the nature of *b*^{x} when *x* is irrational (that is, *not rational*). It states:

If

bis an algebraic number different from 0 and 1, andxan irrational algebraic number, then all values ofb^{x}(there are infinitely many) are transcendental (that is, not algebraic).

If b is a positive real number, and z is any complex number, the power *b*^{z} is defined by

where *x* = ln(*b*) is the unique real solution to the equation *e*^{x} = *b*, and the complex power of *e* is defined by the exponential function, which is the unique function of a complex variable that is equal to its derivative and takes the value 1 for *x* = 0.

As, in general, *b*^{z} is not a real number, an expression such as (*b*^{z})^{w} is not defined by the previous definition. It must be interpreted via the rules for powers of complex numbers, and, unless z is real or w is integer, does not generally equal *b*^{zw}, as one might expect.

There are various definitions of the exponential function but they extend compatibly to complex numbers and satisfy the exponential property. For any complex numbers *z* and *w*, the exponential function satisfies . In particular, for any complex number

The second term has a value given by Euler's formula

This formula links problems in trigonometry and algebra.

Therefore, for any complex number

Because of the Pythagorean trigonometric identity, the absolute value of is 1. Therefore, the real factor is the absolute value of and the imaginary part of the exponent identifies the argument (angle) of the complex number .

The exponential function being equal to its derivative and satisfying its Taylor series must be

This infinite series, which is often taken as the definition of the exponential function *e*^{z} for arbitrary complex exponents, is absolutely convergent for all complex numbers z.

When *z* is purely imaginary, that is, *z* = *iy* for a real number *y*, the series above becomes

which (because it converges absolutely) may be reordered to

The real and the imaginary parts of this expression are Taylor expansions of cosine and sine respectively, centered at zero, implying Euler's formula:

Another characterization of the exponential function is as the limit of , as *n* approaches infinity. By thinking of the *n*th power in this definition as repeated multiplication in polar form, it can be used to visually illustrate Euler's formula. Any complex number can be represented in polar form as , where *r* is the absolute value and *?* is its argument. The product of two complex numbers and is .

Consider the right triangle in the complex plane which has , , and as vertices. For large values of *n*, the triangle is almost a circular sector with a radius of 1 and a small central angle equal to radians. 1 + may then be approximated by the number with polar form . So, in the limit as *n* approaches infinity, approaches , the point on the unit circle whose angle from the positive real axis is *x* radians. The Cartesian coordinates of this point are , so ; this is again Euler's formula, allowing the same connections to the trigonometric functions as elaborated with the series definition.

The solutions to the equation are the integer multiples of :

Thus, if is a complex number such that , then every that also satisfies can be obtained from , i.e., by adding an arbitrary integer multiple of to :

That is, the complex exponential function for any integer k is a periodic function with period .

Integer powers of nonzero complex numbers are defined by repeated multiplication or division as above. If *i* is the imaginary unit and *n* is an integer, then *i*^{n} equals 1, *i*, -1, or -*i*, according to whether the integer *n* is congruent to 0, 1, 2, or 3 modulo 4. Because of this, the powers of *i* are useful for expressing sequences of period 4.

Complex powers of positive reals are defined via *e*^{x} as in section Complex exponents with positive real bases above. These are continuous functions.

Trying to extend these functions to the general case of noninteger powers of complex numbers that are not positive reals leads to difficulties. Either we define discontinuous functions or multivalued functions. Neither of these options is entirely satisfactory.

The rational power of a complex number must be the solution to an algebraic equation. Therefore, it always has a finite number of possible values. For example, *w* = *z*^{1/2} must be a solution to the equation *w*^{2} = *z*. But if *w* is a solution, then so is -*w*, because (-1)^{2} = 1. A unique but somewhat arbitrary solution called the principal value can be chosen using a general rule which also applies for nonrational powers.

Complex powers and logarithms are more naturally handled as single valued functions on a Riemann surface. Single valued versions are defined by choosing a sheet. The value has a discontinuity along a branch cut. Choosing one out of many solutions as the principal value leaves us with functions that are not continuous, and the usual rules for manipulating powers can lead us astray.

Any nonrational power of a complex number has an infinite number of possible values because of the multi-valued nature of the complex logarithm. The principal value is a single value chosen from these by a rule which, amongst its other properties, ensures powers of complex numbers with a positive real part and zero imaginary part give the same value as does the rule defined above for the corresponding real base.

Exponentiating a real number to a complex power is formally a different operation from that for the corresponding complex number. However, in the common case of a positive real number the principal value is the same.

The powers of negative real numbers are not always defined and are discontinuous even where defined. In fact, they are only defined when the exponent is a rational number with the denominator being an odd integer. When dealing with complex numbers the complex number operation is normally used instead.

For complex numbers *w* and *z* with *w* ? 0, the notation *w*^{z} is ambiguous in the same sense that log *w* is.

To obtain a value of *w*^{z}, first choose a logarithm of *w*; call it log *w*. Such a choice may be the principal value Log *w* (the default, if no other specification is given), or perhaps a value given by some other branch of log *w* fixed in advance. Then, using the complex exponential function one defines

because this agrees with the earlier definition in the case where *w* is a positive real number and the (real) principal value of log *w* is used.

If *z* is an integer, then the value of *w*^{z} is independent of the choice of log *w*, and it agrees with the earlier definition of exponentiation with an integer exponent.

If *z* is a rational number *m*/*n* in lowest terms with *z* > 0, then the countably infinitely many choices of log *w* yield only *n* different values for *w*^{z}; these values are the *n* complex solutions *s* to the equation *s*^{n} = *w*^{m}.

If *z* is an irrational number, then the countably infinitely many choices of log *w* lead to infinitely many distinct values for *w*^{z}.

The computation of complex powers is facilitated by converting the base *w* to polar form, as described in detail below.

A similar construction is employed in quaternions.

A complex number *w* such that *w*^{n} = 1 for a positive integer *n* is an ** nth root of unity**. Geometrically, the

If *w*^{n} = 1 but *w*^{k} ? 1 for all natural numbers *k* such that 0 < *k* < *n*, then *w* is called a **primitive nth root of unity**. The negative unit -1 is the only primitive square root of unity. The imaginary unit

The number *e*^{} is the primitive *n*th root of unity with the smallest positive argument. (It is sometimes called the **principal nth root of unity**, although this terminology is not universal and should not be confused with the principal value of , which is 1.

The other *n*th roots of unity are given by

for 2 k n.

Although there are infinitely many possible values for a general complex logarithm, there are only a finite number of values for the power *w ^{q}* in the important special case where

It is usual in mathematics to define *w*^{1/n} as the principal value of the root, which is, conventionally, the *n*th root whose argument has the smallest absolute value. When *w* is a positive real number, this is coherent with the usual convention of defining *w*^{1/n} as the unique positive real *n*th root. On the other hand, when *w* is a negative real number, and n is an odd integer, the unique real *n*th root is not one of the two *n*th roots whose argument has the smallest absolute value. In this case, the meaning of *w*^{1/n} may depend on the context, and some care may be needed for avoiding errors.

The set of *n*th roots of a complex number *w* is obtained by multiplying the principal value *w*^{1/n} by each of the *n*th roots of unity. For example, the fourth roots of 16 are 2, -2, 2*i*, and -2*i*, because the principal value of the fourth root of 16 is 2 and the fourth roots of unity are 1, -1, *i*, and -*i*.

It is often easier to compute complex powers by writing the number to be exponentiated in polar form. Every complex number *z* can be written in the polar form

where *r* is a nonnegative real number and *?* is the (real) argument of *z*. The polar form has a simple geometric interpretation: if a complex number *u* + *iv* is thought of as representing a point (*u*, *v*) in the complex plane using Cartesian coordinates, then (*r*, *?*) is the same point in polar coordinates. That is, *r* is the "radius" *r*^{2} = *u*^{2} + *v*^{2} and *?* is the "angle" *?* = atan2(*v*, *u*). The polar angle *?* is ambiguous since any integer multiple of 2? could be added to *?* without changing the location of the point. Each choice of *?* gives in general a different possible value of the power. A branch cut can be used to choose a specific value. The principal value (the most common branch cut), corresponds to *?* chosen in the interval (-?, ?]. For complex numbers with a positive real part and zero imaginary part using the principal value gives the same result as using the corresponding real number.

In order to compute the complex power *w*^{z}, write *w* in polar form:

Then

and thus

If *z* is decomposed as *c* + *di*, then the formula for *w*^{z} can be written more explicitly as

This final formula allows complex powers to be computed easily from decompositions of the base into polar form and the exponent into Cartesian form. It is shown here both in polar form and in Cartesian form (via Euler's identity).

The following examples use the principal value, the branch cut which causes *?* to be in the interval (-?, ?]. To compute *i*^{i}, write *i* in polar and Cartesian forms:

Then the formula above, with *r* = 1, *?* = , *c* = 0, and *d* = 1, yields

Similarly, to find (-2)^{3 + 4i}, compute the polar form of -2:

and use the formula above to compute

The value of a complex power depends on the branch used. For example, if the polar form *i* = 1*e*^{5?i/2} is used to compute *i*^{i}, the power is found to be *e*^{-5?/2}; the principal value of *i*^{i}, computed above, is *e*^{-?/2}. The set of all possible values for *i*^{i} is given by^{[28]}

So there is an infinity of values that are possible candidates for the value of *i*^{i}, one for each integer *k*. All of them have a zero imaginary part, so one can say *i*^{i} has an infinity of valid real values.

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*? 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 hasRegardless 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:

This identity does not hold even when considering log as a multivalued function. The possible values of log(

*w*^{z}) contain those of*z*? log*w*as a subset. Using Log(*w*) for the principal value of log(*w*) and m, n as any integers the possible values of both sides are: - 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 a calculation using principal branches shows thatand

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 ? -1)^{1/2}are {1, -1}. The identity holds, but saying {1} = {(-1 ? -1)^{1/2}} is wrong. - 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:^{[29]}For any integer n, we have:- (taking the -th power of both sides)
- (using and expanding the exponent)
- (using )
- (dividing by e)

*x*=*e*. Here, before expanding the exponent, the second line should be*e*^{x})^{y}=*e*^{xy}must be replaced by the identity

Exponentiation with integer exponents can be defined in any multiplicative monoid.^{[30]} A monoid is an algebraic structure consisting of a set *X* together with a rule for composition ("multiplication") satisfying an associative law and a multiplicative identity, denoted by 1. Exponentiation is defined inductively by

- for all ,
- for all and non-negative integers
*n*, - If
*n*is a negative integer, then is only defined^{[31]}if has an inverse in*X*.

Monoids include many structures of importance in mathematics, including groups and rings (under multiplication), with more specific examples of the latter being matrix rings and fields.

If *A* is a square matrix, then the product of *A* with itself *n* times is called the matrix power. Also is defined to be the identity matrix,^{[32]} and if *A* is invertible, then .

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.^{[33]} This is the standard interpretation of a Markov chain, for example. Then is the state of the system after two time steps, and so forth: is the state of the system after *n* time steps. The matrix power 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, , which is a linear operator acting on functions to give a new function . The *n*-th power of the differentiation operator is the *n*-th derivative:

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.^{[34]} 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.

A field is an algebraic structure in which multiplication, addition, subtraction, and division are all well-defined and satisfy their familiar properties. The real numbers, for example, form a field, as do the complex numbers and rational numbers. Unlike these familiar examples of fields, which are all infinite sets, some fields have only finitely many elements. The simplest example is the field with two elements with addition defined by and , and multiplication and .

Exponentiation in finite fields has applications in public key cryptography. For example, the Diffie-Hellman key exchange uses the fact that exponentiation is computationally inexpensive in finite fields, whereas the discrete logarithm (the inverse of exponentiation) is computationally expensive.

Any finite field *F* has the property that there is a unique prime number *p* such that for all *x* in *F*; that is, *x* added to itself *p* times is zero. For example, in , the prime number *p* = 2 has this property. This prime number is called the characteristic of the field. Suppose that *F* is a field of characteristic *p*, and consider the function that raises each element of *F* to the power *p*. This is called the Frobenius automorphism of *F*. It is an automorphism of the field because of the Freshman's dream identity . The Frobenius automorphism is important in number theory because it generates the Galois group of *F* over its prime subfield.

Exponentiation for integer exponents can be defined for quite general structures in abstract algebra.

Let *X* be a set with a power-associative binary operation which is written multiplicatively. Then *x*^{n} is defined for any element *x* of *X* and any nonzero natural number *n* as the product of *n* copies of *x*, which is recursively defined by

One has the following properties

If the operation has a two-sided identity element 1, then *x*^{0} is defined to be equal to 1 for any *x*:^{[]}

If the operation also has two-sided inverses and is associative, then the magma is a group. The inverse of *x* can be denoted by *x*^{-1} and follows all the usual rules for exponents:

If the multiplication operation is commutative (as, for instance, in abelian groups), then the following holds:

If the binary operation is written additively, as it often is for abelian groups, 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 there are several power-associative binary operations defined on a set, any of which might be iterated, 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.

Superscript notation is also used, especially in group theory, to indicate conjugation. That is, *g*^{h} = *h*^{-1}*gh*, 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.

If *n* is a natural number, and *A* is an arbitrary set, then the expression *A*^{n} is often used to denote the set of ordered *n*-tuples of elements of *A*. This is equivalent to letting *A*^{n} denote the set of functions from the set {0, 1, 2, ..., *n* - 1} to the set *A*; the *n*-tuple (*a*_{0}, *a*_{1}, *a*_{2}, ..., a_{n-1}) represents the function that sends *i* to *a*_{i}.

For an infinite cardinal number ? and a set *A*, the notation *A*^{?} is also used to denote the set of all functions from a set of size ? to *A*. This is sometimes written ^{?}*A* to distinguish it from cardinal exponentiation, defined below.

This generalized exponential can also be defined for operations on sets or for 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*^{n}, 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 real vector space **R**^{n}.

If the base of the exponentiation operation is a set, the exponentiation operation is the Cartesian product unless otherwise stated. Since multiple Cartesian products produce an *n*-tuple, which can be represented by a function on a set of appropriate cardinality, *S*^{N} becomes simply the set of all functions from *N* to *S* in this case:

This fits in with the exponentiation of cardinal numbers, in the sense that || = ||^{||}, where || is the cardinality of *X*. When "2" is defined as {0, 1}, we have || = 2^{||}, where 2^{X}, usually denoted by **P**(*X*), is the power set of *X*; each subset *Y* of *X* corresponds uniquely to a function on *X* taking the value 1 for *x* ? *Y* and 0 for *x* ? *Y*.

In a Cartesian closed category, the exponential operation can be used to raise an arbitrary object to the power of another object. This generalizes the Cartesian product in the category of sets. If 0 is an initial object in a Cartesian closed category, then the exponential object 0^{0} is isomorphic to any terminal object 1.

In set theory, there are exponential operations for cardinal and ordinal numbers.

If *?* and *?* are cardinal numbers, the expression *?*^{?} represents the cardinality of the set of functions from any set of cardinality *?* to any set of cardinality *?*.^{[35]} If *?* and *?* are finite, then this agrees with the ordinary arithmetic exponential operation. For example, the set of 3-tuples of elements from a 2-element set has cardinality 8 = 2^{3}. In cardinal arithmetic, *?*^{0} is always 1 (even if *?* is an infinite cardinal or zero).

Exponentiation of cardinal numbers is distinct from exponentiation of ordinal numbers, which is defined by a limit process involving transfinite induction.

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 (= 3^{27} = 3^{33} = ^{3}3) respectively.

Zero to the power of zero gives a number of examples of limits that are of the indeterminate form 0^{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*) ? **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** = [-?, +?], 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), (+?, 0), (1, +?) and (1, -?).^{[36]} Accordingly, this allows one to define the powers *x*^{y} by continuity whenever 0 x , -? , except for 0^{0}, (+?)^{0}, 1^{+?} and 1^{-?}, which remain indeterminate forms.

Under this definition by continuity, we obtain:

*x*^{+?}= +? and*x*^{-?}= 0, when 1 <*x*.*x*^{+?}= 0 and*x*^{-?}= +?, when 0 x < 1.- 0
^{y}= 0 and (+?)^{y}= +?, when 0 <*y*. - 0
^{y}= +? and (+?)^{y}= 0, when -? 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} = +? obtained above for negative *n* problematic when *n* is odd, since in this case *x*^{n} -> +? as *x* tends to 0 through positive values, but not negative ones.

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 2^{100}, note that 100 = 64 + 32 + 4. Compute the following in order:

- 2
^{2}= 4 - (2
^{2})^{2}= 2^{4}= 16. - (2
^{4})^{2}= 2^{8}= 256. - (2
^{8})^{2}= 2^{16}= . - (2
^{16})^{2}= 2^{32}= . - (2
^{32})^{2}= 2^{64}= . - 2
^{64}2^{32}2^{4}= 2^{100}= .

This series of steps only requires 8 multiplication operations (the last product above takes 2 multiplications) instead of 99.

In general, the number of multiplication operations required to compute *b*^{n} can be reduced to ?(log *n*) by using exponentiation by squaring or (more generally) 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.^{[37]}

Placing an integer superscript after the name or symbol of a function, as if the function were being raised to a power, commonly refers to repeated function composition rather than repeated multiplication.^{[38]}^{[39]}^{[40]} Thus, *f*^{3}(*x*) may mean *f*(*f*(*f*(*x*)));^{[41]} in particular, *f*^{-1}(*x*) usually denotes the inverse function of *f*. This notation was introduced by Hans Heinrich Bürmann^{[]}^{[39]}^{[40]} and John Frederick William Herschel.^{[38]}^{[39]}^{[40]}Iterated functions are of interest in the study of fractals and dynamical systems. Babbage was the first to study the problem of finding a functional square root *f*^{1/2}(*x*).

To distinguish exponentiation from function composition, the common usage is to write the exponential exponent after the parenthesis enclosing the argument of the function; that is, *f*(*x*)^{3} means (*f*(*x*))^{3}, and *f*(*x*)^{-1} means 1/*f*(*x*).

For historical reasons, and because of the ambiguity resulting of not enclosing arguments with parentheses, a superscript after a function name applied specifically to the trigonometric and hyperbolic functions has a deviating meaning: a positive exponent applied to the function's abbreviation means that the result is raised to that power,^{[42]}^{[43]}^{[44]}^{[45]}^{[46]}^{[47]}^{[48]}^{[20]}^{[40]} while an exponent of -1 still denotes the inverse function.^{[40]} That is, sin^{2}*x* is just a shorthand way to write (sin *x*)^{2} = sin(*x*)^{2} without using parentheses,^{[16]}^{[49]}^{[50]}^{[51]}^{[52]}^{[53]}^{[54]}^{[20]} whereas sin^{-1}*x* refers to the inverse function of the sine, also called arcsin *x*. Each trigonometric and hyperbolic function has its own name and abbreviation both for the reciprocal (for example, 1/(sin *x*) = (sin *x*)^{-1} = sin(*x*)^{-1} = csc *x*), and its inverse (for example cosh^{-1}*x* = arcosh *x*). A similar convention exists for logarithms,^{[40]} where today log^{2}*x* usually means (log *x*)^{2}, not log log *x*.^{[40]}

To avoid ambiguity, some mathematicians^{[]} choose to use ? to denote the compositional meaning, writing *f*^{?n}(*x*) for the n-th iterate of the function *f*(*x*), as in, for example, *f*^{?3}(*x*) meaning *f*(*f*(*f*(*x*))). For the same purpose, *f*^{[n]}(*x*) was used by Benjamin Peirce^{[55]}^{[40]} whereas Alfred Pringsheim and Jules Molk suggested ^{n}*f*(*x*) instead.^{[56]}^{[40]}^{[nb 1]}

Programming languages generally express exponentiation either as an infix operator or as a (prefix) function, as they are linear notations which do not support superscripts:

`x ? y`

: Algol, Commodore BASIC, TRS-80 Level II/III BASIC.^{[57]}^{[58]}`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. Conflicting uses of the symbol`^`

include: XOR (in POSIX Shell arithmetic expansion, AWK, C, C++, C#, D, Go, Java, JavaScript, Perl, PHP, Python, Ruby and Tcl), indirection (Pascal), and string concatenation (OCaml and Standard ML).`x ^^ y`

: Haskell (for fractional base, integer exponents), D.`x ** y`

: 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, VHDL.`pown x y`

: F# (for integer base, integer exponent).`x?y`

: APL.

Many other programming languages lack syntactic support for exponentiation, but provide library functions:

`pow(x, y)`

: C, C++.`Math.Pow(x, y)`

: C#.`math:pow(X, Y)`

: Erlang.`Math.pow(x, y)`

: Java.`[Math]::Pow(x, y)`

: PowerShell.

For certain exponents there are special ways to compute *x*^{y} much faster than through generic exponentiation. These cases include small positive and negative integers (prefer *x* · *x* over *x*^{2}; prefer 1/*x* over *x*^{-1}) and roots (prefer sqrt(*x*) over *x*^{0.5}, prefer cbrt(*x*) over *x*^{1/3}).

Not all programming languages adhere to the same association convention for exponentiation: while the Wolfram language, Google Search and others use right-association (i.e. `a^b^c`

is evaluated as `a^(b^c)`

), many computer programs such as Microsoft Office Excel and Matlab associate to the left (i.e. `a^b^c`

is evaluated as `(a^b)^c`

).

**^**Alfred Pringsheim's and Jules Molk's (1907) notation^{n}*f*(*x*) to denote function compositions must not be confused with Rudolf von Bitter Rucker's (1982) notation^{n}*x*, introduced by Hans Maurer (1901) and Reuben Louis Goodstein (1947) for tetration, or with David Patterson Ellerman's (1995)^{n}*x*pre-superscript notation for roots.

- ^
^{a}^{b}"Compendium of Mathematical Symbols".*Math Vault*. 2020-03-01. Retrieved . - ^
^{a}^{b}^{c}^{d}^{e}Nykamp, Duane. "Basic rules for exponentiation".*Math Insight*. Retrieved . **^**Weisstein, Eric W. "Power".*mathworld.wolfram.com*. Retrieved .- ^
^{a}^{b}Rotman, Joseph J. (2015).*Advanced Modern Algebra, Part 1*. Graduate Studies in Mathematics.**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.**17**. Translated by A.M. Ungar. Dordrecht: D. Reidel. p. 37. ISBN 90-277-0819-3.- ^
^{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.**^**For further analysis see The Sand Reckoner.- ^
^{a}^{b}Quinion, Michael. "Zenzizenzizenzic". World Wide Words. Retrieved . **^**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*.**1**. London: Open Court Publishing Company. p. 344.**^**Earliest Known Uses of Some of the Words of Mathematics**^**Stifel, Michael (1544).*Arithmetica integra*. Nuremberg: Johannes Petreius. p. 235v. Stifel was trying to conveniently represent the terms of geometric progressions. He devised a cumbersome notation for doing that. In*Liber III, Caput III: De Algorithmo numerorum Cossicorum*(Book 3, Chapter 3: On Algorithms of Algebra), on page 235 verso, he presented the notation for the first eight terms of a geometric progression (using 1 as a base) and then he wrote: "*Quemadmodum autem hic vides, quemlibet terminum progressionis cossicæ, suum habere exponentem in suo ordine (ut 1ze habet 1. 1? habet 2 &c.) sic quilibet numerus cossicus, servat exponentem suæ denominationis implicite, qui ei serviat & utilis sit, potissimus in multiplicatione & divisione, ut paulo inferius dicam.*" (However, you see how each term of the progression has its exponent in its order (as 1ze has a 1, 1? has a 2, etc.), so each number is implicitly subject to the exponent of its denomination, which [in turn] is subject to it and is useful mainly in multiplication and division, as I will mention just below.) [Note: Most of Stifel's cumbersome symbols were taken from Christoff Rudolff, who in turn took them from Leonardo Fibonacci's*Liber Abaci*(1202), where they served as shorthand symbols for the Latin words*res*/*radix*(x),*census*/*zensus*(*x*^{2}), and*cubus*(*x*^{3}).]**^**Descartes, René (1637). "*La Géométrie*".*Discourse de la méthode [...]*. Leiden: Jan Maire. p. 299.

(And*Et*aa*, ou*aa^{2}, pour multiplier*par soy mesme; Et*aa^{3}, pour le multiplier encore une fois par*, & ainsi a l'infini**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.)).- ^
^{a}^{b}Euler, Leonhard (1748).*Introductio in analysin infinitorum*(in Latin).**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.**^**Robinson, Raphael Mitchel (October 1958) [1958-04-07]. "A report on primes of the form k · 2^{n}+ 1 and on factors of Fermat numbers" (PDF).*Proceedings of the American Mathematical Society*. University of California, Berkeley, California, USA.**9**(5): 673-681 [677]. doi:10.1090/s0002-9939-1958-0096614-7. Archived (PDF) from the original on 2020-06-28. Retrieved .- ^
^{a}^{b}^{c}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).**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.Regel 7: Ist

*F*(*A*) Teilzeichenreihe eines arithmetischen Ausdrucks oder einer seiner Abkürzungen und*F*eine Funktionenkonstante und*A*eine Zahlenvariable oder Zahlenkonstante, so darf*F A*dafür geschrieben werden. [Darüber hinaus ist noch die Abkürzung*F*^{n}(*A*) für (*F*(*A*))^{n}üblich. Dabei kann*F*sowohl Funktionenkonstante als auch Funktionenvariable sein.] **^**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; Schwarz, Hans Rudolf; Hackbusch, Wolfgang; Luderer, Bernd; Blath, Jochen; Schied, Alexander; Dempe, Stephan; Wanka, Gert; Hromkovi?, Juraj; Gottwald, Siegfried (2013) [2012]. Zeidler, Eberhard (ed.).*Springer-Handbuch der Mathematik I*(in German).**I**(1 ed.). Berlin / Heidelberg, Germany: Springer Spektrum, Springer Fachmedien Wiesbaden. p. 590. doi:10.1007/978-3-658-00285-5. ISBN 978-3-658-00284-8. (xii+635 pages)- ^
^{a}^{b}Anton, Howard; Bivens, Irl; Davis, Stephen (2012).*Calculus: Early Transcendentals*(9th ed.). John Wiley & Sons. p. 28. - ^
^{a}^{b}Denlinger, Charles G. (2011).*Elements of Real Analysis*. Jones and Bartlett. pp. 278-283. ISBN 978-0-7637-7947-4. **^**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**^**"Principal root of unity", MathWorld.**^**Complex number to a complex power may be real at Cut The Knot gives some references to*i*^{i}.**^**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*. 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, Elements of Mathematics, Theory of Sets, Springer-Verlag, 2004, III.§3.5.**^**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.- ^
^{a}^{b}Herschel, John Frederick William (1813) [1812-11-12]. "On a Remarkable Application of Cotes's Theorem".*Philosophical Transactions of the Royal Society of London*. London: Royal Society of London, printed by W. Bulmer and Co., Cleveland-Row, St. James's, sold by G. and W. Nicol, Pall-Mall.**103**(Part 1): 8-26 [10]. doi:10.1098/rstl.1813.0005. JSTOR 107384. S2CID 118124706. - ^
^{a}^{b}^{c}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 .[2] (NB. Inhere, Herschel refers to his 1813 work and mentions Hans Heinrich Bürmann's older work.) - ^
^{a}^{b}^{c}^{d}^{e}^{f}^{g}^{h}^{i}Cajori, Florian (1952) [March 1929]. "§472. The power of a logarithm / §473. Iterated logarithms / §533. John Herschel's notation for inverse functions / §535. Persistence of rival notations for inverse functions / §537. Powers of trigonometric functions".*A History of Mathematical Notations*.**2**(3rd corrected printing of 1929 issue, 2nd ed.). Chicago, USA: Open court publishing company. pp. 108, 176-179, 336, 346. ISBN 978-1-60206-714-1. Retrieved .[...] §473.

(xviii+367+1 pages including 1 addenda page) (NB. ISBN and link for reprint of 2nd edition by Cosimo, Inc., New York, USA, 2013.)*Iterated logarithms*[...] We note here the symbolism used by Pringsheim and Molk in their joint*Encyclopédie*article: "^{2}log_{b}*a*= log_{b}(log_{b}*a*), ...,^{k+1}log_{b}*a*= log_{b}(^{k}log_{b}*a*)."^{[a]}[...] §533.*John Herschel's notation for inverse functions,*sin^{−1}*x*, tan^{−1}*x*, etc., was published by him in the*Philosophical Transactions of London*, for the year 1813. He says (p. 10): "This notation cos.^{−1}*e*must not be understood to signify 1/cos.*e*, but what is usually written thus, arc (cos.=*e*)." He admits that some authors use cos.^{m}*A*for (cos.*A*)^{m}, but he justifies his own notation by pointing out that since*d*^{2}*x*, ?^{3}*x*, ?^{2}*x*mean*dd**x*,*x*,*x*, we ought to write sin.^{2}*x*for sin. sin.*x*, log.^{3}*x*for log. log. log.*x*. Just as we write*d*^{−n}V=?^{n}V, we may write similarly sin.^{−1}*x*=arc (sin.=*x*), log.^{−1}*x*.=c^{x}. Some years later Herschel explained that in 1813 he used*f*^{n}(*x*),*f*^{−n}(*x*), sin.^{−1}*x*, etc., "as he then supposed for the first time. The work of a German Analyst, Burmann, has, however, within these few months come to his knowledge, in which the same is explained at a considerably earlier date. He[Burmann], however, does not seem to have noticed the convenience of applying this idea to the inverse functions tan^{−1}, etc., nor does he appear at all aware of the inverse calculus of functions to which it gives rise." Herschel adds, "The symmetry of this notation and above all the new and most extensive views it opens of the nature of analytical operations seem to authorize its universal adoption."^{[b]}[...] §535.*Persistence of rival notations for inverse function.*— [...] The use of Herschel's notation underwent a slight change in Benjamin Peirce's books, to remove the chief objection to them; Peirce wrote: "cos^{[−1]}*x*," "log^{[−1]}*x*."^{[c]}[...] §537.*Powers of trigonometric functions.*—Three principal notations have been used to denote, say, the square of sin*x*, namely, (sin*x*)^{2}, sin*x*^{2}, sin^{2}*x*. The prevailing notation at present is sin^{2}*x*, though the first is least likely to be misinterpreted. In the case of sin^{2}*x*two interpretations suggest themselves; first, sin*x*· sin*x*; second,^{[d]}sin (sin*x*). As functions of the last type do not ordinarily present themselves, the danger of misinterpretation is very much less than in case of log^{2}*x*, where log*x*· log*x*and log (log*x*) are of frequent occurrence in analysis. In his*Introductio in analysin*(1748), Euler^{[e]}writes (cos.*z*)^{n}, but in an article of 1754 he adopts sin*?*^{3}for (sin*?*)^{3}[...] The parentheses as in (sin*x*)^{n}were preferred by Karsten,^{[f]}Scherffer ,^{[g]}Frisius ,^{[h]}Abel (in some passages),^{[i]}Ohm.^{[j]}It passed into disuse during the nineteenth century. [...] The designation sin*x*^{2}for (sin*x*)^{2}is found in the writings of Langrange, Lorenz , Lacroix, Vieth , Stolz; it was recommended by Gauss. The notation sin^{n}*x*for (sin*x*)^{n}has been widely used and is now the prevailing one. It is found, for example, in Cagnoli,^{[k]}DeMorgan,^{[l]}Serret,^{[m]}Todhunter,^{[n]}Hobson,^{[o]}Toledo ,^{[p]}Rothe.^{[q]}[...] **^**Peano, Giuseppe (1903).*Formulaire mathématique*(in French).**IV**. p. 229.**^**Cagnoli, Antonio (1786).*Traité de Trigonométrie*(in French). Paris: trad. par Chompré. p. 20.**^**De Morgan, Augustus (1849).*Trigonometry and Double Algebra*. London. p. 35.**^**Serret, Joseph Alfred (1857).*Traité de Trigonométrie*(in French) (2nd ed.). Paris. p. 12.**^**Todhunter, Isaac (1876).*Plane Trigonometry*(6th ed.). London. p. 19.**^**Hobson, Ernest William (1911).*Treatise on Plane Trigonometry*. Cambridge, UK. p. 19.**^**de Toledo, Luis Octavio (1917).*Tradado de Trigonometria*(in Spanish) (3rd ed.). Madrid. p. 64.**^**Rothe, Hermann (1921).*Vorlesungen über höhere Mathematik*(in German). Vienna. p. 261.**^**Karsten, Wenceslaus Johann Gustav (1760). "Sectio XIII. De sectionibus angulorum et arcuum circularium".*Mathesis theoretica Elementaris Atque Sublimior*(in Latin). Rostock. p. 511. Retrieved .[3]**^**Scherffer, Karl "Carolo" (1772).*Institutionum analyticarum, pars secunda*(in Latin). Vienna. p. 144.**^**Frisius (Frisii), Paulli (1782).*Operum tomus primus*(in Latin). Milano. p. 303.**^**Abel, Niels Henrik (1826).*Journal für die reine und angewandte Mathematik*(in German). Berlin: August Leopold Crelle.**I**: 318-337; Missing or empty`|title=`

(help)Abel, Niels Henrik (1827).*Journal für die reine und angewandte Mathematik*(in German). Berlin: August Leopold Crelle.**II**: 26. Missing or empty`|title=`

(help)**^**Ohm, Martin (1829).*System der Mathematik*(in German). Berlin. p. 21. Part 3.**^**Stibitz, George Robert; Larrivee, Jules A. (1957). Written at Underhill, Vermont, USA.*Mathematics and Computers*(1 ed.). New York, USA / Toronto, Canada / London, UK: McGraw-Hill Book Company, Inc. p. 169. LCCN 56-10331. (10+228 pages) (NB. Stibitz uses parentheses even in conjunction with trigonometric functions (like`(cos`

) to avoid the ambiguity of the*u*)^{n}`cos`

notation.)^{n}*u***^**Peirce, Benjamin (1852).*Curves, Functions and Forces*.**I**(new ed.). Boston, USA. p. 203.**^**Pringsheim, Alfred; Molk, Jules (1907).*Encyclopédie des sciences mathématiques pures et appliquées*(in French).**I**. p. 195. Part I.**^**Daneliuk, Timothy "Tim" A. (1982-08-09). "BASCOM - A BASIC compiler for TRS-80 I and II".*InfoWorld*. Software Reviews.**4**(31). Popular Computing, Inc. pp. 41-42. Archived from the original on 2020-02-07. Retrieved .[...] If [...] squaring is accomplished with TRS-80 BASIC's exponentiation (up-arrow) function, interpreter run time is 22 minutes 20 seconds, and compiled run time is 20 minutes 3 seconds. [...]

**^**"80 Contents".*80 Micro*. 1001001, Inc. (45): 5. October 1983. ISSN 0744-7868. Retrieved .[...] The left bracket, [, replaces the up arrow used by RadioShack to indicate exponentiation on our printouts. When entering programs published in 80 Micro, you should make this change. [...]

(NB. At code point 5Bh the TRS-80 character set has an up-arrow symbol "?" in place of the ASCII left square bracket "[".)

- "Introducing 0th power".
*PlanetMath*. - Laws of Exponents with derivation and examples

This article uses material from the Wikipedia page available here. It is released under the Creative Commons Attribution-Share-Alike License 3.0.

Popular Products

Music Scenes

Popular Artists