Movatterモバイル変換


[0]ホーム

URL:


Jump to content
WikipediaThe Free Encyclopedia
Search

Exponentiation

From Wikipedia, the free encyclopedia
(Redirected fromExponentiate)
Arithmetic operation
"Exponent" redirects here. For other uses, seeExponent (disambiguation).

Graphs ofy =bx for various basesb:  base 10,  base e,  base 2,  base 1/2. Each curve passes through the point(0, 1) because any nonzero number raised to the power of0 is1. Atx = 1, the value ofy equals the base because any number raised to the power of1 is the number itself.
Arithmetic operations
Addition (+)
term+termsummand+summandaddend+addendaugend+addend}={\displaystyle \scriptstyle \left.{\begin{matrix}\scriptstyle {\text{term}}\,+\,{\text{term}}\\\scriptstyle {\text{summand}}\,+\,{\text{summand}}\\\scriptstyle {\text{addend}}\,+\,{\text{addend}}\\\scriptstyle {\text{augend}}\,+\,{\text{addend}}\end{matrix}}\right\}\,=\,}sum{\displaystyle \scriptstyle {\text{sum}}}
Subtraction (−)
termtermminuendsubtrahend}={\displaystyle \scriptstyle \left.{\begin{matrix}\scriptstyle {\text{term}}\,-\,{\text{term}}\\\scriptstyle {\text{minuend}}\,-\,{\text{subtrahend}}\end{matrix}}\right\}\,=\,}difference{\displaystyle \scriptstyle {\text{difference}}}
Multiplication (×)
factor×factormultiplier×multiplicand}={\displaystyle \scriptstyle \left.{\begin{matrix}\scriptstyle {\text{factor}}\,\times \,{\text{factor}}\\\scriptstyle {\text{multiplier}}\,\times \,{\text{multiplicand}}\end{matrix}}\right\}\,=\,}product{\displaystyle \scriptstyle {\text{product}}}
Division (÷)
dividenddivisornumeratordenominator}={\displaystyle \scriptstyle \left.{\begin{matrix}\scriptstyle {\frac {\scriptstyle {\text{dividend}}}{\scriptstyle {\text{divisor}}}}\\[1ex]\scriptstyle {\frac {\scriptstyle {\text{numerator}}}{\scriptstyle {\text{denominator}}}}\end{matrix}}\right\}\,=\,}{fractionquotientratio{\displaystyle \scriptstyle \left\{{\begin{matrix}\scriptstyle {\text{fraction}}\\\scriptstyle {\text{quotient}}\\\scriptstyle {\text{ratio}}\end{matrix}}\right.}
Exponentiation (^)
baseexponentbasepower}={\displaystyle \scriptstyle \left.{\begin{matrix}\scriptstyle {\text{base}}^{\text{exponent}}\\\scriptstyle {\text{base}}^{\text{power}}\end{matrix}}\right\}\,=\,}power{\displaystyle \scriptstyle {\text{power}}}
nth root (√)
radicanddegree={\displaystyle \scriptstyle {\sqrt[{\text{degree}}]{\scriptstyle {\text{radicand}}}}\,=\,}root{\displaystyle \scriptstyle {\text{root}}}
Logarithm (log)
logbase(anti-logarithm)={\displaystyle \scriptstyle \log _{\text{base}}({\text{anti-logarithm}})\,=\,}logarithm{\displaystyle \scriptstyle {\text{logarithm}}}

Inmathematics,exponentiation, denotedbn, is anoperation involving two numbers: thebase,b, and theexponent orpower,n.[1] Whenn is a positiveinteger, exponentiation corresponds to repeatedmultiplication of the base: that is,bn is theproduct of multiplyingn bases:[1]bn=b×b××b×bn times.{\displaystyle b^{n}=\underbrace {b\times b\times \dots \times b\times b} _{n{\text{ times}}}.}In particular,b1=b{\displaystyle b^{1}=b}.

The exponent is usually shown as asuperscript to the right of the base asbn or in computer code asb^n. Thisbinary operation is often read as "b to the powern"; it may also be referred to as "b raised to thenth power", "thenth power ofb",[2] or, most briefly, "b to then".

The above definition ofbn{\displaystyle b^{n}} immediately implies several properties, in particular the multiplication rule:[nb 1]

bn×bm=b××bn times×b××bm times=b××bn+m times = bn+m.{\displaystyle {\begin{aligned}b^{n}\times b^{m}&=\underbrace {b\times \dots \times b} _{n{\text{ times}}}\times \underbrace {b\times \dots \times b} _{m{\text{ times}}}\\[1ex]&=\underbrace {b\times \dots \times b} _{n+m{\text{ times}}}\ =\ b^{n+m}.\end{aligned}}}

That is, when multiplying a base raised to one power times the same base raised to another power, the powers add. Extending this rule to the power zero givesb0×bn=b0+n=bn{\displaystyle b^{0}\times b^{n}=b^{0+n}=b^{n}}, and dividing both sides bybn{\displaystyle b^{n}} givesb0=bn/bn=1{\displaystyle b^{0}=b^{n}/b^{n}=1}. That is, the multiplication rule implies the definitionb0=1.{\displaystyle b^{0}=1.}A similar argument implies the definition for negative integer powers:bn=1/bn.{\displaystyle b^{-n}=1/b^{n}.}That is, extending the multiplication rule givesbn×bn=bn+n=b0=1{\displaystyle b^{-n}\times b^{n}=b^{-n+n}=b^{0}=1}. Dividing both sides bybn{\displaystyle b^{n}} givesbn=1/bn{\displaystyle b^{-n}=1/b^{n}}. This also implies the definition for fractional powers:bn/m=bnm.{\displaystyle b^{n/m}={\sqrt[{m}]{b^{n}}}.}For example,b1/2×b1/2=b1/2+1/2=b1=b{\displaystyle b^{1/2}\times b^{1/2}=b^{1/2\,+\,1/2}=b^{1}=b}, meaning(b1/2)2=b{\displaystyle (b^{1/2})^{2}=b}, which is the definition of square root:b1/2=b{\displaystyle b^{1/2}={\sqrt {b}}}.

The definition of exponentiation can be extended in a natural way (preserving the multiplication rule) to definebx{\displaystyle b^{x}} for any positive real baseb{\displaystyle b} and any real number exponentx{\displaystyle x}. More involved definitions allowcomplex base and exponent, as well as certain types ofmatrices as base or exponent.

Exponentiation is used extensively in many fields, includingeconomics,biology,chemistry,physics, andcomputer science, with applications such ascompound interest,population growth,chemical reaction kinetics,wave behavior, andpublic-key cryptography.

Etymology

[edit]

The termexponent originates from theLatinexponentem, thepresent participle ofexponere, meaning "to put forth".[3] The termpower (Latin:potentia, potestas, dignitas) is a mistranslation[4][5] of theancient Greek δύναμις (dúnamis, here: "amplification"[4]) used by theGreek mathematicianEuclid for the square of a line,[6] followingHippocrates of Chios.[7]

History

[edit]

Antiquity

[edit]

The Sand Reckoner

[edit]
Main article:The Sand Reckoner

InThe Sand Reckoner,Archimedes proved the law of exponents,10a · 10b = 10a+b, necessary to manipulate powers of10.[8] He then used powers of10 to estimate the number of grains of sand that can be contained in the universe.

Islamic Golden Age

[edit]

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

[edit]

In the 9th century, the Persian mathematicianAl-Khwarizmi used the terms مَال (māl, "possessions", "property") for asquare—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 acube, which laterIslamic mathematicians represented inmathematical notation as the lettersmīm (m) andkāf (k), respectively, by the 15th century, as seen in the work ofAbu'l-Hasan ibn Ali al-Qalasadi.[10]

15th–18th century

[edit]

Introducing exponents

[edit]

Nicolas Chuquet used a form of exponential notation in the 15th century, for example122 to represent12x2.[11] This was later used byHenricus Grammateus andMichael 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 exampleiii4 for4x3.[12]

"Exponent"; "square" and "cube"

[edit]

The wordexponent 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

[edit]

In 1636,James Hume used in essence modern notation, when inL'algèbre de Viète he wroteAiii forA3.[15] Early in the 17th century, the first form of our modern exponential notation was introduced byRené Descartes in his text titledLa Géométrie; there, the notation is introduced in Book I.[16]

I designate ...aa, ora2 in multiplyinga by itself; anda3 in multiplying it once more again bya, 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 writepolynomials, for example, asax +bxx +cx3 +d.

"Indices"

[edit]

Samuel Jeake introduced the termindices in 1696.[6] The terminvolution was used synonymously with the termindices, but had declined in usage[17] and should not be confused withits more common meaning.

Variable exponents, non-integer exponents

[edit]

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 notalgebraic functions, since in those the exponents must be constant.[18]

20th century

[edit]

As calculation was mechanized, notation was adapted to numerical capacity by conventions in exponential notation. For exampleKonrad Zuse introducedfloating-point arithmetic in his 1938 computer Z1. Oneregister contained representation of leading digits, and a second contained representation of the exponent of 10. EarlierLeonardo Torres Quevedo contributedEssays on Automation (1914) which had suggested the floating-point representation of numbers. The more flexibledecimal floating-point representation was introduced in 1946 with aBell Laboratories computer. Eventually educators and engineers adoptedscientific notation of numbers, consistent with common reference toorder of magnitude in aratio scale.[19]

For instance, in 1961 theSchool Mathematics Study Group developed the notation in connection with units used in themetric system.[20][21]

Exponents also came to be used to describeunits of measurement andquantity dimensions. For instance, sinceforce is mass times acceleration, it is measured in kg m/sec2. Using M for mass, L for length, and T for time, the expression M L T–2 is used indimensional analysis to describe force.[22][23]

Terminology

[edit]

The expressionb2 =b ·b is called "thesquare ofb" or "b squared", because the area of a square with side-lengthb isb2. (It is true that it could also be called "b to the second power", but "the square ofb" and "b squared" are more traditional)

Similarly, the expressionb3 =b ·b ·b is called "thecube ofb" or "b cubed", because the volume of a cube with side-lengthb isb3.

When an exponent is apositive integer, that exponent indicates how many copies of the base are multiplied together. For example,35 = 3 · 3 · 3 · 3 · 3 = 243. The base3 appears5 times in the multiplication, because the exponent is5. Here,243 is the5th power of 3, or3 raised to the 5th power.

The word "raised" is usually omitted, and sometimes "power" as well, so35 can be simply read "3 to the 5th", or "3 to the 5".

Integer exponents

[edit]

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

Positive exponents

[edit]

The definition of the exponentiation as an iterated multiplication can beformalized by usinginduction,[24] and this definition can be used as soon as one has anassociative multiplication:

The base case is

b1=b{\displaystyle b^{1}=b}

and therecurrence is

bn+1=bnb.{\displaystyle b^{n+1}=b^{n}\cdot b.}

The associativity of multiplication implies that for any positive integersm andn,

bm+n=bmbn,{\displaystyle b^{m+n}=b^{m}\cdot b^{n},}

and

(bm)n=bmn.{\displaystyle (b^{m})^{n}=b^{mn}.}

Zero exponent

[edit]

As mentioned earlier, a (nonzero) number raised to the0 power is1:[25][1]

b0=1.{\displaystyle b^{0}=1.}

This value is also obtained by theempty product convention, which may be used in everyalgebraic structure with a multiplication that has anidentity. This way the formula

bm+n=bmbn{\displaystyle b^{m+n}=b^{m}\cdot b^{n}}

also holds forn=0{\displaystyle n=0}.

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

Negative exponents

[edit]

Exponentiation with negative exponents is defined by the following identity, which holds for any integern and nonzerob:

bn=1bn{\displaystyle 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 ({\displaystyle \infty }).[26]

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

The same definition applies toinvertible elements in a multiplicativemonoid, that is, analgebraic structure, with an associative multiplication and amultiplicative identity denoted1 (for example, thesquare matrices of a given dimension). In particular, in such a structure, the inverse of aninvertible elementx is standardly denotedx1.{\displaystyle x^{-1}.}

Identities and properties

[edit]
"Laws of Indices" redirects here. For the horse, seeLaws of Indices (horse).

The followingidentities, often calledexponent rules, hold for all integer exponents, provided that the base is non-zero:[1]

bmbn=bm+n(bm)n=bmnbncn=(bc)n{\displaystyle {\begin{aligned}b^{m}\cdot b^{n}&=b^{m+n}\\\left(b^{m}\right)^{n}&=b^{m\cdot n}\\b^{n}\cdot c^{n}&=(b\cdot c)^{n}\end{aligned}}}

Unlike addition and multiplication, exponentiation is notcommutative: for example,23=8{\displaystyle 2^{3}=8}, but reversing the operands gives the different value32=9{\displaystyle 3^{2}=9}. Also unlike addition and multiplication, exponentiation is notassociative: for example,(23)2 = 82 = 64, whereas2(32) = 29 = 512. Without parentheses, the conventionalorder of operations forserial exponentiation in superscript notation is top-down (orright-associative), not bottom-up[27][28][29] (orleft-associative). That is,

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

which, in general, is different from

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

Powers of a sum

[edit]

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

(a+b)n=i=0n(ni)aibni=i=0nn!i!(ni)!aibni.{\displaystyle (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. thatab =ba), which is implied if they belong to astructure that iscommutative. Otherwise, ifa andb are, say,square matrices of the same size, this formula cannot be used. It follows that incomputer algebra, manyalgorithms involving integer exponents must be changed when the exponentiation bases do not commute. Some general purposecomputer algebra systems use a different notation (sometimes^^ instead of^) for exponentiation with non-commuting bases, which is then callednon-commutative exponentiation.

Combinatorial interpretation

[edit]

For nonnegative integersn andm, the value ofnm is the number offunctions from aset ofm elements to a set ofn elements (seecardinal exponentiation). Such functions can be represented asm-tuples from ann-element set (or asm-letter words from ann-letter alphabet). Some examples for particular values ofm andn are given in the following table:

nmThenm possiblem-tuples of elements from the set{1, ...,n}
05 = 0none
14 = 1(1, 1, 1, 1)
23 = 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)
32 = 9(1, 1), (1, 2), (1, 3), (2, 1), (2, 2), (2, 3), (3, 1), (3, 2), (3, 3)
41 = 4(1), (2), (3), (4)
50 = 1()

Particular bases

[edit]

Powers of ten

[edit]
See also:Scientific notation
Main article:Power of 10

In the base ten (decimal) number system, integer powers of10 are written as the digit1 followed or preceded by a number of zeroes determined by the sign and magnitude of the exponent. For example,103 =1000 and10−4 =0.0001.

Exponentiation with base10 is used inscientific notation to denote large or small numbers. For instance,299792458 m/s (thespeed of light in vacuum, inmetres per second) can be written as2.99792458×108 m/s and thenapproximated as2.998×108 m/s.

SI prefixes based on powers of10 are also used to describe small or large quantities. For example, the prefixkilo means103 =1000, so a kilometre is1000 m.

Powers of two

[edit]
Main article:Power of two

The first negative powers of2 have special names:21{\displaystyle 2^{-1}}is ahalf;22{\displaystyle 2^{-2}} is aquarter.

Powers of2 appear inset theory, since a set withn members has apower set, the set of all of itssubsets, which has2n members.

Integer powers of2 are important incomputer science. The positive integer powers2n give the number of possible values for ann-bit integerbinary number; for example, abyte may take28 = 256 different values. Thebinary number system expresses any number as a sum of powers of2, and denotes it as a sequence of0 and1, separated by abinary point, where1 indicates a power of2 that appears in the sum; the exponent is determined by the place of this1: the nonnegative exponents are the rank of the1 on the left of the point (starting from0), and the negative exponents are determined by the rank on the right of the point.

Powers of one

[edit]

Every power of one equals:1n = 1.

Powers of zero

[edit]

For a positive exponentn > 0, thenth power of zero is zero:0n = 0. For a negative\ exponent,0n=1/0n=1/0{\displaystyle 0^{-n}=1/0^{n}=1/0} is undefined.

The expression00 is eitherdefined aslimx0xx=1{\displaystyle \lim _{x\to 0}x^{x}=1}, or it is left undefined.

Powers of negative one

[edit]

Since a negative number times another negative is positive, we have:

(1)n={1for even n,1for odd n.{\displaystyle (-1)^{n}=\left\{{\begin{array}{rl}1&{\text{for even }}n,\\-1&{\text{for odd }}n.\\\end{array}}\right.}

Because of this, powers of−1 are useful for expressing alternatingsequences. For a similar discussion of powers of the complex numberi, see§ nth roots of a complex number.

Large exponents

[edit]

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

bn → ∞ asn → ∞ whenb > 1

This can be read as "b to the power ofn tends to+∞ asn tends to infinity whenb is greater than one".

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

bn → 0 asn → ∞ when|b| < 1

Any power of one is always one:

bn = 1 for alln forb = 1

Powers of a negative numberb1{\displaystyle b\leq -1} alternate between positive and negative asn alternates between even and odd, and thus do not tend to any limit asn grows.

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

(1 + 1/n)ne asn → ∞

See§ Exponential function below.

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

Power functions

[edit]
Main article:Power law
Power functions forn = 1, 3, 5
Power functions forn = 2, 4, 6

Real functions of the formf(x)=cxn{\displaystyle f(x)=cx^{n}}, wherec0{\displaystyle c\neq 0}, are sometimes called power functions.[30] Whenn{\displaystyle n} is aninteger andn1{\displaystyle n\geq 1}, two primary families exist: forn{\displaystyle n} even, and forn{\displaystyle n} odd. In general forc>0{\displaystyle c>0}, whenn{\displaystyle n} is evenf(x)=cxn{\displaystyle f(x)=cx^{n}} will tend towards positiveinfinity with increasingx{\displaystyle x}, and also towards positive infinity with decreasingx{\displaystyle x}. All graphs from the family of even power functions have the general shape ofy=cx2{\displaystyle y=cx^{2}}, flattening more in the middle asn{\displaystyle n} increases.[31] Functions with this kind ofsymmetry(f(x)=f(x){\displaystyle f(-x)=f(x)}) are calledeven functions.

Whenn{\displaystyle n} is odd,f(x){\displaystyle f(x)}'sasymptotic behavior reverses from positivex{\displaystyle x} to negativex{\displaystyle x}. Forc>0{\displaystyle c>0},f(x)=cxn{\displaystyle f(x)=cx^{n}} will also tend towards positiveinfinity with increasingx{\displaystyle x}, but towards negative infinity with decreasingx{\displaystyle x}. All graphs from the family of odd power functions have the general shape ofy=cx3{\displaystyle y=cx^{3}}, flattening more in the middle asn{\displaystyle n} increases and losing all flatness there in the straight line forn=1{\displaystyle n=1}. Functions with this kind of symmetry(f(x)=f(x){\displaystyle f(-x)=-f(x)}) are calledodd functions.

Forc<0{\displaystyle c<0}, the opposite asymptotic behavior is true in each case.[31]

Table of powers of decimal digits

[edit]
nn2n3n4n5n6n7n8n9n10
1111111111
2481632641282565121024
392781243729218765611968359049
416642561024409616384655362621441048576
5251256253125156257812539062519531259765625
636216129677764665627993616796161007769660466176
749343240116807117649823543576480140353607282475249
8645124096327682621442097152167772161342177281073741824
9817296561590495314414782969430467213874204893486784401
10100100010000100000100000010000000100000000100000000010000000000

Rational exponents

[edit]
From top to bottom:x1/8,x1/4,x1/2,x1,x2,x4,x8.

Ifx is a nonnegativereal number, andn is a positive integer,x1/n{\displaystyle x^{1/n}} orxn{\displaystyle {\sqrt[{n}]{x}}} denotes the unique nonnegative realnth root ofx, that is, the unique nonnegative real numbery such thatyn=x.{\displaystyle y^{n}=x.}

Ifx is a positive real number, andpq{\displaystyle {\frac {p}{q}}} is arational number, withp andq > 0 integers, thenxp/q{\textstyle x^{p/q}} is defined as

xpq=(xp)1q=(x1q)p.{\displaystyle 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 settingy=x1q,{\displaystyle y=x^{\frac {1}{q}},} and writing(x1q)p=yp=((yp)q)1q=((yq)p)1q=(xp)1q.{\displaystyle (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}}.}

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

All these definitions are required for extending the identity(xr)s=xrs{\displaystyle (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 realnth root, which is negative, ifn isodd, and no real root ifn is even. In the latter case, whichever complexnth root one chooses forx1n,{\displaystyle x^{\frac {1}{n}},} the identity(xa)b=xab{\displaystyle (x^{a})^{b}=x^{ab}} cannot be satisfied. For example,

((1)2)12=112=1(1)212=(1)1=1.{\displaystyle \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

[edit]

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 thelogarithm of the base and theexponential function (§ Powers via logarithms, below). The result is always a positive real number, and theidentities 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 tocomplex 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 theprincipal value, but there is no choice of the principal value for which the identity

(br)s=brs{\displaystyle \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 amultivalued function.

Limits of rational exponents

[edit]
The limit ofe1/n ise0 = 1 whenn tends to the infinity.

Since anyirrational number can be expressed as thelimit of a sequence of rational numbers, exponentiation of a positive real numberb with an arbitrary real exponentx can be defined bycontinuity with the rule[32]

bx=limr(Q)xbr(bR+,xR),{\displaystyle 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 ofr only. This limit exists for every positiveb and every realx.

For example, ifx =π, thenon-terminating decimal representationπ = 3.14159... and themonotonicity of the rational powers can be used to obtain intervals bounded by rational powers that are as small as desired, and must containbπ:{\displaystyle b^{\pi }:}

[b3,b4],[b3.1,b3.2],[b3.14,b3.15],[b3.141,b3.142],[b3.1415,b3.1416],[b3.14159,b3.14160],{\displaystyle \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 twosequences that have the same limit, denotedbπ.{\displaystyle b^{\pi }.}

This definesbx{\displaystyle b^{x}} for every positiveb and realx as acontinuous function ofb andx. See alsoWell-defined expression.[33]

Exponential function

[edit]
Main article:Exponential function

Theexponential function may be defined asxex,{\displaystyle x\mapsto e^{x},} wheree2.718{\displaystyle e\approx 2.718} isEuler's number, but to avoidcircular reasoning, this definition cannot be used here. Rather, we give an independent definition of the exponential functionexp(x),{\displaystyle \exp(x),} and ofe=exp(1){\displaystyle e=\exp(1)}, relying only on positive integer powers (repeated multiplication). Then we sketch the proof that this agrees with the previous definition:exp(x)=ex.{\displaystyle \exp(x)=e^{x}.}

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

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

One hasexp(0)=1,{\displaystyle \exp(0)=1,} and theexponential identity (or multiplication rule)exp(x)exp(y)=exp(x+y){\displaystyle \exp(x)\exp(y)=\exp(x+y)} holds as well, since

exp(x)exp(y)=limn(1+xn)n(1+yn)n=limn(1+x+yn+xyn2)n,{\displaystyle \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 termxyn2{\displaystyle {\frac {xy}{n^{2}}}} does not affect the limit, yieldingexp(x)exp(y)=exp(x+y){\displaystyle \exp(x)\exp(y)=\exp(x+y)}.

Euler's number can be defined ase=exp(1){\displaystyle e=\exp(1)}. It follows from the preceding equations thatexp(x)=ex{\displaystyle \exp(x)=e^{x}} whenx is an integer (this results from the repeated-multiplication definition of the exponentiation). Ifx is real,exp(x)=ex{\displaystyle \exp(x)=e^{x}} results from the definitions given in preceding sections, by using the exponential identity ifx is rational, and the continuity of the exponential function otherwise.

The limit that defines the exponential function converges for everycomplex value ofx, and therefore it can be used to extend the definition ofexp(z){\displaystyle \exp(z)}, and thusez,{\displaystyle e^{z},} from the real numbers to any complex argumentz. This extended exponential function still satisfies the exponential identity, and is commonly used for defining exponentiation for complex base and exponent.

Powers via logarithms

[edit]

The definition ofex as the exponential function allows definingbx for every positive real numbersb, in terms of exponential andlogarithm function. Specifically, the fact that thenatural logarithmln(x) is theinverse of the exponential functionex means that one has

b=exp(lnb)=elnb{\displaystyle b=\exp(\ln b)=e^{\ln b}}

for everyb > 0. For preserving the identity(ex)y=exy,{\displaystyle (e^{x})^{y}=e^{xy},} one must have

bx=(elnb)x=exlnb{\displaystyle b^{x}=\left(e^{\ln b}\right)^{x}=e^{x\ln b}}

So,exlnb{\displaystyle e^{x\ln b}} can be used as an alternative definition ofbx for any positive realb. 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

[edit]

Ifb is a positive real number, exponentiation with baseb andcomplex exponentz is defined by means of the exponential function with complex argument (see the end of§ Exponential function, above) as

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

wherelnb{\displaystyle \ln b} denotes thenatural logarithm ofb.

This satisfies the identity

bz+t=bzbt,{\displaystyle b^{z+t}=b^{z}b^{t},}

In general,(bz)t{\textstyle \left(b^{z}\right)^{t}} is not defined, sincebz 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,

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

unlessz is real ort is an integer.

Euler's formula,

eiy=cosy+isiny,{\displaystyle e^{iy}=\cos y+i\sin y,}

allows expressing thepolar form ofbz{\displaystyle b^{z}} in terms of thereal and imaginary parts ofz, namely

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

where theabsolute value of thetrigonometric factor is one. This results from

bx+iy=bxbiy=bxeiylnb=bx(cos(ylnb)+isin(ylnb)).{\displaystyle 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 exponents with a complex base

[edit]

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 ofnth roots, that is, of exponents1/n,{\displaystyle 1/n,} wheren is a positive integer. Although the general theory of exponentiation with non-integer exponents applies tonth roots, this case deserves to be considered first, since it does not need to usecomplex logarithms, and is therefore easier to understand.

nth roots of a complex number

[edit]

Every nonzero complex numberz may be written inpolar form as

z=ρeiθ=ρ(cosθ+isinθ),{\displaystyle z=\rho e^{i\theta }=\rho (\cos \theta +i\sin \theta ),}

whereρ{\displaystyle \rho } is theabsolute value ofz, andθ{\displaystyle \theta } is itsargument. The argument is definedup to an integer multiple of2π; this means that, ifθ{\displaystyle \theta } is the argument of a complex number, thenθ+2kπ{\displaystyle \theta +2k\pi } is also an argument of the same complex number for every integerk{\displaystyle 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 annth root of a complex number can be obtained by taking thenth root of the absolute value and dividing its argument byn:

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

If2π{\displaystyle 2\pi } is added toθ{\displaystyle \theta }, the complex number is not changed, but this adds2iπ/n{\displaystyle 2i\pi /n} to the argument of thenth root, and provides a newnth root. This can be donen times, and provides thennth roots of the complex number.

It is usual to choose one of thennth root as theprincipal root. The common choice is to choose thenth root for whichπ<θπ,{\displaystyle -\pi <\theta \leq \pi ,} that is, thenth root that has the largest real part, and, if there are two, the one with positive imaginary part. This makes the principalnth root acontinuous function in the whole complex plane, except for negative real values of theradicand. This function equals the usualnth root for positive real radicands. For negative real radicands, and odd exponents, the principalnth root is not real, although the usualnth root is real.Analytic continuation shows that the principalnth root is the uniquecomplex differentiable function that extends the usualnth 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 of2π,{\displaystyle 2\pi ,} the complex number comes back to its initial position, and itsnth roots arepermuted circularly (they are multiplied bye2iπ/ne^{2i\pi /n}). This shows that it is not possible to define anth root function that is continuous in the whole complex plane.

Roots of unity

[edit]
Main article:Root of unity
The three third roots of1

Thenth roots of unity are then complex numbers such thatwn = 1, wheren is a positive integer. They arise in various areas of mathematics, such as indiscrete Fourier transform or algebraic solutions of algebraic equations (Lagrange resolvent).

Thennth roots of unity are then first powers ofω=e2πin{\displaystyle \omega =e^{\frac {2\pi i}{n}}}, that is1=ω0=ωn,ω=ω1,ω2,ωn1.{\displaystyle 1=\omega ^{0}=\omega ^{n},\omega =\omega ^{1},\omega ^{2},\omega ^{n-1}.} Thenth roots of unity that have this generating property are calledprimitiventh roots of unity; they have the formωk=e2kπin,{\displaystyle \omega ^{k}=e^{\frac {2k\pi i}{n}},} withkcoprime withn. The unique primitive square root of unity is1;{\displaystyle -1;} the primitive fourth roots of unity arei{\displaystyle i} andi.{\displaystyle -i.}

Thenth roots of unity allow expressing allnth roots of a complex numberz as then products of a givennth roots ofz with anth root of unity.

Geometrically, thenth roots of unity lie on theunit circle of thecomplex plane at the vertices of aregularn-gon with one vertex on the real number 1.

As the numbere2kπin{\displaystyle e^{\frac {2k\pi i}{n}}} is the primitiventh root of unity with the smallest positiveargument, it is called theprincipal primitiventh root of unity, sometimes shortened asprincipalnth root of unity, although this terminology can be confused with theprincipal value of11/n{\displaystyle 1^{1/n}}, which is 1.[34][35][36]

Complex exponentiation

[edit]

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 forzwz^{w}. So, either aprincipal value is defined, which is not continuous for the values ofz that are real and nonpositive, orzwz^{w} is defined as amultivalued function.

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

zw=ewlogz,{\displaystyle z^{w}=e^{w\log z},}

wherelogz{\displaystyle \log z} is the variant of the complex logarithm that is used, which is a function or amultivalued function such that

elogz=z{\displaystyle e^{\log z}=z}

for everyz in itsdomain of definition.

Principal value

[edit]

Theprincipal value of thecomplex logarithm is the unique continuous function, commonly denotedlog,{\displaystyle \log ,} such that, for every nonzero complex numberz,

elogz=z,{\displaystyle e^{\log z}=z,}

and theargument ofz satisfies

π<Argzπ.{\displaystyle -\pi <\operatorname {Arg} z\leq \pi .}

The principal value of the complex logarithm is not defined forz=0,{\displaystyle z=0,} it isdiscontinuous at negative real values ofz, and it isholomorphic (that is, complex differentiable) elsewhere. Ifz is real and positive, the principal value of the complex logarithm is the natural logarithm:logz=lnz.{\displaystyle \log z=\ln z.}

The principal value ofzw{\displaystyle z^{w}} is defined aszw=ewlogz,{\displaystyle z^{w}=e^{w\log z},}wherelogz{\displaystyle \log z} is the principal value of the logarithm.

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

Ifz is real and positive, the principal value ofzw{\displaystyle z^{w}} equals its usual value defined above. Ifw=1/n,{\displaystyle w=1/n,} wheren is an integer, this principal value is the same as the one defined above.

Multivalued function

[edit]

In some contexts, there is a problem with the discontinuity of the principal values oflogz{\displaystyle \log z} andzw{\displaystyle z^{w}} at the negative real values ofz. In this case, it is useful to consider these functions asmultivalued functions.

Iflogz{\displaystyle \log z} denotes one of the values of the multivalued logarithm (typically its principal value), the other values are2ikπ+logz,{\displaystyle 2ik\pi +\log z,} wherek is any integer. Similarly, ifzw{\displaystyle z^{w}} is one value of the exponentiation, then the other values are given by

ew(2ikπ+logz)=zwe2ikπw,{\displaystyle e^{w(2ik\pi +\log z)}=z^{w}e^{2ik\pi w},}

wherek is any integer.

Different values ofk give different values ofzw{\displaystyle z^{w}} unlessw is arational number, that is, there is an integerd such thatdw is an integer. This results from theperiodicity of the exponential function, more specifically, thatea=eb{\displaystyle e^{a}=e^{b}} if and only ifab{\displaystyle a-b} is an integer multiple of2πi.{\displaystyle 2\pi i.}

Ifw=mn{\displaystyle w={\frac {m}{n}}} is a rational number withm andncoprime integers withn>0,{\displaystyle n>0,} thenzw{\displaystyle z^{w}} has exactlyn values. In the casem=1,{\displaystyle m=1,} these values are the same as those described in§nth roots of a complex number. Ifw is an integer, there is only one value that agrees with that of§ Integer exponents.

The multivalued exponentiation is holomorphic forz0,{\displaystyle z\neq 0,} in the sense that itsgraph consists of several sheets that define each a holomorphic function in the neighborhood of every point. Ifz varies continuously along a circle around0, then, after a turn, the value ofzw{\displaystyle z^{w}} has changed of sheet.

Computation

[edit]

Thecanonical formx+iy{\displaystyle x+iy} ofzw{\displaystyle z^{w}} can be computed from the canonical form ofz andw. Although this can be described by a single formula, it is clearer to split the computation in several steps.

Examples
[edit]

In both examples, all values ofzw{\displaystyle z^{w}} have the same argument. More generally, this is true if and only if thereal part ofw is an integer.

Failure of power and logarithm identities

[edit]

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

Irrationality and transcendence

[edit]
Main article:Gelfond–Schneider theorem

Ifb is a positive realalgebraic number, andx is a rational number, thenbx is an algebraic number. This results from the theory ofalgebraic extensions. This remains true ifb is any algebraic number, in which case, all values ofbx (as amultivalued function) are algebraic. Ifx isirrational (that is,not rational), and bothb andx are algebraic, Gelfond–Schneider theorem asserts that all values ofbx aretranscendental (that is, not algebraic), except ifb equals0 or1.

In other words, ifx is irrational andb{0,1},{\displaystyle b\not \in \{0,1\},} then at least one ofb,x andbx is transcendental.

Integer powers in algebra

[edit]

The definition of exponentiation with positive integer exponents as repeated multiplication may apply to anyassociative operation denoted as a multiplication.[nb 2] The definition ofx0 requires further the existence of amultiplicative identity.[38]

Analgebraic structure consisting of a set together with an associative operation denoted multiplicatively, and a multiplicative identity denoted by1 is amonoid. In such a monoid, exponentiation of an elementx is defined inductively by

Ifn is a negative integer,xn{\displaystyle x^{n}} is defined only ifx has amultiplicative inverse.[39] In this case, the inverse ofx is denotedx−1, andxn is defined as(x1)n.{\displaystyle \left(x^{-1}\right)^{-n}.}

Exponentiation with integer exponents obeys the following laws, forx andy in the algebraic structure, andm andn integers:

x0=1xm+n=xmxn(xm)n=xmn(xy)n=xnynif xy=yx,and, in particular, if the multiplication is commutative.{\displaystyle {\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 forgroups,rings,fields,square matrices (which form a ring). They apply also tofunctions from aset to itself, which form a monoid underfunction composition. This includes, as specific instances,geometric transformations, andendomorphisms of anymathematical 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, iff is areal function whose valued can be multiplied,fn{\displaystyle f^{n}} denotes the exponentiation with respect of multiplication, andfn{\displaystyle f^{\circ n}} may denote exponentiation with respect offunction composition. That is,

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

and

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

Commonly,(fn)(x){\displaystyle (f^{n})(x)} is denotedf(x)n,{\displaystyle f(x)^{n},} while(fn)(x){\displaystyle (f^{\circ n})(x)} is denotedfn(x).{\displaystyle f^{n}(x).}

In a group

[edit]

Amultiplicative group is a set with asassociative operation denoted as multiplication, that has anidentity element, and such that every element has an inverse.

So, ifG is a group,xn{\displaystyle x^{n}} is defined for everyxG{\displaystyle x\in G} and every integern.

The set of all powers of an element of a group form asubgroup. A group (or subgroup) that consists of all powers of a specific elementx is thecyclic group generated byx. If all the powers ofx are distinct, the group isisomorphic to theadditive groupZ{\displaystyle \mathbb {Z} } of the integers. Otherwise, the cyclic group isfinite (it has a finite number of elements), and its number of elements is theorder ofx. If the order ofx isn, thenxn=x0=1,{\displaystyle x^{n}=x^{0}=1,} and the cyclic group generated byx consists of then first powers ofx (starting indifferently from the exponent0 or1).

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

Superscript notation is also used forconjugation; that is,gh =h−1gh, whereg andh 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(gh)k=ghk{\displaystyle (g^{h})^{k}=g^{hk}} and(gh)k=gkhk.{\displaystyle (gh)^{k}=g^{k}h^{k}.}

In a ring

[edit]

In aring, it may occur that some nonzero elements satisfyxn=0{\displaystyle x^{n}=0} for some integern. Such an element is said to benilpotent. In acommutative ring, the nilpotent elements form anideal, called thenilradical of the ring.

If the nilradical is reduced to thezero ideal (that is, ifx0{\displaystyle x\neq 0} impliesxn0{\displaystyle x^{n}\neq 0} for every positive integern), the commutative ring is said to bereduced. Reduced rings are important inalgebraic geometry, since thecoordinate ring of anaffine algebraic set is always a reduced ring.

More generally, given an idealI in a commutative ringR, the set of the elements ofR that have a power inI is an ideal, called theradical ofI. The nilradical is the radical of thezero ideal. Aradical ideal is an ideal that equals its own radical. In apolynomial ringk[x1,,xn]{\displaystyle k[x_{1},\ldots ,x_{n}]} over afieldk, 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 ofHilbert's Nullstellensatz).

Matrices and linear operators

[edit]

IfA is a square matrix, then the product ofA with itselfn times is called thematrix power. AlsoA0{\displaystyle A^{0}} is defined to be the identity matrix,[40] and ifA is invertible, thenAn=(A1)n{\displaystyle A^{-n}=\left(A^{-1}\right)^{n}}.

Matrix powers appear often in the context ofdiscrete dynamical systems, where the matrixA expresses a transition from a state vectorx of some system to the next stateAx of the system.[41] This is the standard interpretation of aMarkov chain, for example. ThenA2x{\displaystyle A^{2}x} is the state of the system after two time steps, and so forth:Anx{\displaystyle A^{n}x} is the state of the system aftern time steps. The matrix powerAn{\displaystyle A^{n}} is the transition matrix between the state now and the state at a timen 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 usingeigenvalues and eigenvectors.

Apart from matrices, more generallinear operators can also be exponentiated. An example is thederivative operator of calculus,d/dx{\displaystyle d/dx}, which is a linear operator acting on functionsf(x){\displaystyle f(x)} to give a new function(d/dx)f(x)=f(x){\displaystyle (d/dx)f(x)=f'(x)}. Thenth power of the differentiation operator is thenth derivative:

(ddx)nf(x)=dndxnf(x)=f(n)(x).{\displaystyle \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 ofsemigroups.[42] 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 theheat 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 thefractional derivative which, together with thefractional integral, is one of the basic operations of thefractional calculus.

Finite fields

[edit]
Main article:Finite field

Afield is an algebraic structure in which multiplication, addition, subtraction, and division are defined and satisfy the properties that multiplication isassociative and every nonzero element has amultiplicative inverse. This implies that exponentiation with integer exponents is well-defined, except for nonpositive powers of0. Common examples are the field ofcomplex numbers, thereal numbers and therational numbers, considered earlier in this article, which are allinfinite.

Afinite field is a field with afinite number of elements. This number of elements is either aprime number or aprime power; that is, it has the formq=pk,{\displaystyle q=p^{k},} wherep is a prime number, andk is a positive integer. For every suchq, there are fields withq elements. The fields withq elements are allisomorphic, which allows, in general, working as if there were only one field withq elements, denotedFq.{\displaystyle \mathbb {F} _{q}.}

One has

xq=x{\displaystyle x^{q}=x}

for everyxFq.{\displaystyle x\in \mathbb {F} _{q}.}

Aprimitive element inFq{\displaystyle \mathbb {F} _{q}} is an elementg such that the set of theq − 1 first powers ofg (that is,{g1=g,g2,,gp1=g0=1}{\displaystyle \{g^{1}=g,g^{2},\ldots ,g^{p-1}=g^{0}=1\}}) equals the set of the nonzero elements ofFq.{\displaystyle \mathbb {F} _{q}.} There areφ(p1){\displaystyle \varphi (p-1)} primitive elements inFq,{\displaystyle \mathbb {F} _{q},} whereφ{\displaystyle \varphi } isEuler's totient function.

InFq,{\displaystyle \mathbb {F} _{q},} thefreshman's dream identity

(x+y)p=xp+yp{\displaystyle (x+y)^{p}=x^{p}+y^{p}}

is true for the exponentp. Asxp=x{\displaystyle x^{p}=x} inFq,{\displaystyle \mathbb {F} _{q},} It follows that the map

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

islinear overFq,{\displaystyle \mathbb {F} _{q},} and is afield automorphism, called theFrobenius automorphism. Ifq=pk,{\displaystyle q=p^{k},} the fieldFq{\displaystyle \mathbb {F} _{q}} hask automorphisms, which are thek first powers (undercomposition) ofF. In other words, theGalois group ofFq{\displaystyle \mathbb {F} _{q}} iscyclic of orderk, generated by the Frobenius automorphism.

TheDiffie–Hellman key exchange is an application of exponentiation in finite fields that is widely used forsecure communications. It uses the fact that exponentiation is computationally inexpensive, whereas the inverse operation, thediscrete logarithm, is computationally expensive. More precisely, ifg is a primitive element inFq,{\displaystyle \mathbb {F} _{q},} thenge{\displaystyle g^{e}} can be efficiently computed withexponentiation by squaring for anye, even ifq is large, while there is no known computationally practical algorithm that allows retrievinge fromge{\displaystyle g^{e}} ifq is sufficiently large.

Powers of sets

[edit]

TheCartesian product of twosetsS andT is the set of theordered pairs(x,y){\displaystyle (x,y)} such thatxS{\displaystyle x\in S} andyT.{\displaystyle y\in T.} This operation is not properlycommutative norassociative, but has these propertiesup tocanonicalisomorphisms, that allow identifying, for example,(x,(y,z)),{\displaystyle (x,(y,z)),}((x,y),z),{\displaystyle ((x,y),z),} and(x,y,z).{\displaystyle (x,y,z).}

This allows defining thenth powerSn{\displaystyle S^{n}} of a setS as the set of alln-tuples(x1,,xn){\displaystyle (x_{1},\ldots ,x_{n})} of elements ofS.

WhenS is endowed with some structure, it is frequent thatSn{\displaystyle 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 exampleRn{\displaystyle \mathbb {R} ^{n}} (whereR{\displaystyle \mathbb {R} } denotes the real numbers) denotes the Cartesian product ofn copies ofR,{\displaystyle \mathbb {R} ,} as well as their direct product asvector space,topological spaces,rings, etc.

Sets as exponents

[edit]
See also:Function (mathematics) § Set exponentiation

An-tuple(x1,,xn){\displaystyle (x_{1},\ldots ,x_{n})} of elements ofS can be considered as afunction from{1,,n}.{\displaystyle \{1,\ldots ,n\}.} This generalizes to the following notation.

Given two setsS andT, the set of all functions fromT toS is denotedST{\displaystyle S^{T}}. This exponential notation is justified by the following canonical isomorphisms (for the first one, seeCurrying):

(ST)UST×U,{\displaystyle (S^{T})^{U}\cong S^{T\times U},}
STUST×SU,{\displaystyle S^{T\sqcup U}\cong S^{T}\times S^{U},}

where×{\displaystyle \times } denotes the Cartesian product, and{\displaystyle \sqcup } thedisjoint union.

One can use sets as exponents for other operations on sets, typically fordirect sums ofabelian groups,vector spaces, ormodules. For distinguishing direct sums from direct products, the exponent of a direct sum is placed between parentheses. For example,RN{\displaystyle \mathbb {R} ^{\mathbb {N} }} denotes the vector space of theinfinite sequences of real numbers, andR(N){\displaystyle \mathbb {R} ^{(\mathbb {N} )}} the vector space of those sequences that have a finite number of nonzero elements. The latter has abasis consisting of the sequences with exactly one nonzero element that equals1, while theHamel bases of the former cannot be explicitly described (because their existence involvesZorn's lemma).

In this context,2 can represents the set{0,1}.{\displaystyle \{0,1\}.} So,2S{\displaystyle 2^{S}} denotes thepower set ofS, that is the set of the functions fromS to{0,1},{\displaystyle \{0,1\},} which can be identified with the set of thesubsets ofS, by mapping each function to theinverse image of1.

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

In category theory

[edit]
Main article:Cartesian closed category

In thecategory of sets, themorphisms between setsX andY are the functions fromX toY. It results that the set of the functions fromX toY that is denotedYX{\displaystyle Y^{X}} in the preceding section can also be denotedhom(X,Y).{\displaystyle \hom(X,Y).} The isomorphism(ST)UST×U{\displaystyle (S^{T})^{U}\cong S^{T\times U}} can be rewritten

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

This means the functor "exponentiation to the powerT" is aright adjoint to the functor "direct product withT".

This generalizes to the definition ofexponentiation in a category in which finitedirect products exist: in such a category, the functorXXT{\displaystyle X\to X^{T}} is, if it exists, a right adjoint to the functorYT×Y.{\displaystyle Y\to T\times Y.} A category is called aCartesian closed category, if direct products exist, and the functorYX×Y{\displaystyle Y\to X\times Y} has a right adjoint for everyT.

Repeated exponentiation

[edit]
Main articles:Tetration andHyperoperation

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 ortetration. Iterating tetration leads to another operation, and so on, a concept namedhyperoperation. This sequence of operations is expressed by theAckermann function andKnuth'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, and7625597484987 (=327 = 333 =33) respectively.

Limits of powers

[edit]

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

More precisely, consider the functionf(x,y)=xy{\displaystyle f(x,y)=x^{y}} defined onD={(x,y)R2:x>0}{\displaystyle D=\{(x,y)\in \mathbf {R} ^{2}:x>0\}}. ThenD can be viewed as a subset ofR2 (that is, the set of all pairs(x,y) withx,y belonging to theextended real number lineR = [−∞, +∞], endowed with theproduct topology), which will contain the points at which the functionf has a limit.

In fact,f has a limit at allaccumulation points ofD, except for(0, 0),(+∞, 0),(1, +∞) and(1, −∞).[43] Accordingly, this allows one to define the powersxy by continuity whenever0 ≤x ≤ +∞,−∞ ≤ y ≤ +∞, except for00,(+∞)0,1+∞ and1−∞, which remain indeterminate forms.

Under this definition by continuity, we obtain:

  • x+∞ = +∞ andx−∞ = 0, when1 <x ≤ +∞.
  • x+∞ = 0 andx−∞ = +∞, when0 <x < 1.
  • 0y = 0 and(+∞)y = +∞, when0 <y ≤ +∞.
  • 0y = +∞ and(+∞)y = 0, when−∞ ≤y < 0.

These powers are obtained by taking limits ofxy forpositive values ofx. This method does not permit a definition ofxy whenx < 0, since pairs(x,y) withx < 0 are not accumulation points ofD.

On the other hand, whenn is an integer, the powerxn is already meaningful for all values ofx, including negative ones. This may make the definition0n = +∞ obtained above for negativen problematic whenn is odd, since in this casexn → +∞ asx tends to0 through positive values, but not negative ones.

Efficient computation with integer exponents

[edit]

Computingbn using iterated multiplication requiresn − 1 multiplication operations, but it can be computed more efficiently than that, as illustrated by the following example. To compute2100, applyHorner's rule to the exponent 100 written in binary:

100=22+25+26=22(1+23(1+2)){\displaystyle 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.

22 = 4
2 (22) = 23 = 8
(23)2 = 26 = 64
(26)2 = 212 =4096
(212)2 = 224 =16777216
2 (224) = 225 =33554432
(225)2 = 250 =1125899906842624
(250)2 = 2100 =1267650600228229401496703205376

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

In general, the number of multiplication operations required to computebn can be reduced ton+log2n1,{\displaystyle \sharp n+\lfloor \log _{2}n\rfloor -1,} by usingexponentiation by squaring, wheren{\displaystyle \sharp n} denotes the number of1s in thebinary representation ofn. For some exponents (100 is not among them), the number of multiplications can be further reduced by computing and using the minimaladdition-chain exponentiation. Finding theminimal sequence of multiplications (the minimal-length addition chain for the exponent) forbn is a difficult problem, for which no efficient algorithms are currently known (seeSubset sum problem), but many reasonably efficient heuristic algorithms are available.[44] However, in practical computations, exponentiation by squaring is efficient enough, and much more easy to implement.

Iterated functions

[edit]
See also:Iterated function

Function composition is abinary operation that is defined onfunctions such that thecodomain of the function written on the right is included in thedomain of the function written on the left. It is denotedgf,{\displaystyle g\circ f,} and defined as

(gf)(x)=g(f(x)){\displaystyle (g\circ f)(x)=g(f(x))}

for everyx in the domain off.

If the domain of a functionf equals its codomain, one may compose the function with itself an arbitrary number of time, and this defines thenth power of the function under composition, commonly called thenth iterate of the function. Thusfn{\displaystyle f^{n}} denotes generally thenth iterate off; for example,f3(x){\displaystyle f^{3}(x)} meansf(f(f(x))).{\displaystyle f(f(f(x))).}[45]

When a multiplication is defined on the codomain of the function, this defines a multiplication on functions, thepointwise multiplication, which induces another exponentiation. When usingfunctional notation, the two kinds of exponentiation are generally distinguished by placing the exponent of the functional iterationbefore the parentheses enclosing the arguments of the function, and placing the exponent of pointwise multiplicationafter the parentheses. Thusf2(x)=f(f(x)),{\displaystyle f^{2}(x)=f(f(x)),} andf(x)2=f(x)f(x).{\displaystyle 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 examplef3=fff,{\displaystyle f^{\circ 3}=f\circ f\circ f,} andf3=fff.{\displaystyle 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 thetrigonometric functions. So,sin2x{\displaystyle \sin ^{2}x} andsin2(x){\displaystyle \sin ^{2}(x)} both meansin(x)sin(x){\displaystyle \sin(x)\cdot \sin(x)} and notsin(sin(x)),{\displaystyle \sin(\sin(x)),} which, in any case, is rarely considered. Historically, several variants of these notations were used by different authors.[46][47][48]

In this context, the exponent1{\displaystyle -1} denotes always theinverse function, if it exists. Sosin1x=sin1(x)=arcsinx.{\displaystyle \sin ^{-1}x=\sin ^{-1}(x)=\arcsin x.} For themultiplicative inverse fractions are generally used as in1/sin(x)=1sinx.{\displaystyle 1/\sin(x)={\frac {1}{\sin x}}.}

In programming languages

[edit]

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

In most programming languages with an infix exponentiation operator, it isright-associative, that is,a^b^c is interpreted asa^(b^c).[55] This is because(a^b)^c is equal toa^(b*c) and thus not as useful. In some languages, it is left-associative, notably inAlgol,MATLAB, and theMicrosoft 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 standardlibraries:

In somestatically typed languages that prioritizetype safety such asRust, exponentiation is performed via a multitude of methods:

  • x.pow(y) forx andy as integers
  • x.powf(y) forx andy as floating-point numbers
  • x.powi(y) forx as a float andy as an integer

See also

[edit]

Notes

[edit]
  1. ^There are three common notations formultiplication:x×y{\displaystyle x\times y} is most commonly used for explicit numbers and at a very elementary level;xy{\displaystyle xy} is most common whenvariables are used;xy{\displaystyle x\cdot y} is used for emphasizing that one talks of multiplication or when omitting the multiplication sign would be confusing.
  2. ^More generally,power associativity is sufficient for the definition.

References

[edit]
  1. ^abcdeNykamp, Duane."Basic rules for exponentiation".Math Insight. Retrieved2020-08-27.
  2. ^Weisstein, Eric W."Power".MathWorld. Retrieved2020-08-27.
  3. ^"Exponent | Etymology of exponent by etymonline".
  4. ^abRotman, 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.
  5. ^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.
  6. ^abO'Connor, John J.;Robertson, Edmund F."Etymology of some common mathematical terms".MacTutor History of Mathematics Archive.University of St Andrews.
  7. ^Ball, W. W. Rouse (1915).A Short Account of the History of Mathematics (6th ed.). London:Macmillan. p. 38.
  8. ^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.
  9. ^abQuinion, Michael."Zenzizenzizenzic". World Wide Words. Retrieved2020-04-16.
  10. ^O'Connor, John J.;Robertson, Edmund F."Abu'l Hasan ibn Ali al Qalasadi".MacTutor History of Mathematics Archive.University of St Andrews.
  11. ^Cajori, Florian (1928).A History of Mathematical Notations. Vol. 1. The Open Court Company. p. 102.
  12. ^Cajori, Florian (1928).A History of Mathematical Notations. Vol. 1. London:Open Court Publishing Company. p. 344.
  13. ^"Earliest Known Uses of Some of the Words of Mathematics (E)". 2017-06-23.
  14. ^Stifel, Michael (1544).Arithmetica integra. Nuremberg:Johannes Petreius. p. 235v.
  15. ^Cajori, Florian (1928).A History of Mathematical Notations. Vol. 1. The Open Court Company. p. 204.
  16. ^Descartes, René (1637). "La Géométrie".Discourse de la méthode [...]. Leiden: Jan Maire. p. 299.Etaa, oua2, pour multipliera par soy mesme; Eta3, pour le multiplier encore une fois para, & ainsi a l'infini (Andaa, ora2, in order to multiplya by itself; anda3, in order to multiply it once more bya, and thus to infinity).
  17. ^The most recent usage in this sense cited by the OED is from 1806 ("involution".Oxford English Dictionary (Online ed.).Oxford University Press. (Subscription orparticipating institution membership required.)).
  18. ^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.
  19. ^Janet Shiver & Terri Wiilard "Scientific notation: working with orders of magnitude fromVisionlearning
  20. ^School Mathematics Study Group (1961)Mathematics for Junior High School, volume 2, part 1,Yale University Press
  21. ^Cecelia Callanan (1967) "Scientific Notation",The Mathematics Teacher 60: 252–6JSTOR
  22. ^Edwin Bidwell Wilson (1920)Theory of Dimensions, chapter 11 inAeronautics: A Class Text, via Internet Archive
  23. ^Bridgman, Percy Williams (1922).Dimensional Analysis. New Haven: Yale University Press.OCLC 840631.
  24. ^Hodge, Jonathan K.; Schlicker, Steven; Sundstorm, Ted (2014).Abstract Algebra: an inquiry based approach. CRC Press. p. 94.ISBN 978-1-4665-6706-1.
  25. ^Achatz, Thomas (2005).Technical Shop Mathematics (3rd ed.). Industrial Press. p. 101.ISBN 978-0-8311-3086-2.
  26. ^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. Vol. 151. 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.
  27. ^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 (andB. G. Teubner Verlagsgesellschaft, Leipzig). pp. 115–120, 802.ISBN 3-87144-492-8.
  28. ^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]
  29. ^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)
  30. ^Hass, Joel R.; Heil, Christopher E.; Weir, Maurice D.; Thomas, George B. (2018).Thomas' Calculus (14 ed.). Pearson. pp. 7–8.ISBN 9780134439020.
  31. ^abAnton, Howard; Bivens, Irl; Davis, Stephen (2012).Calculus: Early Transcendentals (9th ed.). John Wiley & Sons. p. 28.ISBN 9780470647691.
  32. ^Denlinger, Charles G. (2011).Elements of Real Analysis. Jones and Bartlett. pp. 278–283.ISBN 978-0-7637-7947-4.
  33. ^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.
  34. ^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 resourceArchived 2007-09-30 at theWayback Machine.
  35. ^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.
  36. ^Weisstein, Eric W."Principal root of unity".MathWorld.
  37. ^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.
  38. ^Bourbaki, Nicolas (1970).Algèbre. Springer. I.2.
  39. ^Bloom, David M. (1979).Linear Algebra and Geometry. Cambridge University Press. p. 45.ISBN 978-0-521-29324-2.
  40. ^Chapter 1, Elementary Linear Algebra, 8E, Howard Anton.
  41. ^Strang, Gilbert (1988).Linear algebra and its applications (3rd ed.). Brooks-Cole. Chapter 5.
  42. ^E. Hille, R. S. Phillips:Functional Analysis and Semi-Groups. American Mathematical Society, 1975.
  43. ^Nicolas Bourbaki,Topologie générale, V.4.2.
  44. ^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 fromthe original(PDF) on 2018-07-23. Retrieved2024-01-11.
  45. ^Peano, Giuseppe (1903).Formulaire mathématique (in French). Vol. IV. p. 229.
  46. ^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.
  47. ^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. Retrieved2020-08-04.[2] (NB. Inhere, Herschel refers to his1813 work and mentionsHans Heinrich Bürmann's older work.)
  48. ^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. Retrieved2016-01-18.
  49. ^Richard Gillam (2003).Unicode Demystified: A Practical Programmer's Guide to the Encoding Standard. Addison-Wesley Professional. p. 33.ISBN 0201700522.
  50. ^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. Retrieved2022-07-04. (2+51+1 pages)
  51. ^Brice Carnahan; James O. Wilkes (1968).Introduction to Digital Computing and FORTRAN IV with MTS Applications. pp. 2–2,2–6.
  52. ^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. Retrieved2022-07-04. (29 pages)
  53. ^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. Retrieved2020-02-06.
  54. ^"80 Contents".80 Micro (45).1001001, Inc.: 5. October 1983.ISSN 0744-7868. Retrieved2020-02-06.
  55. ^Robert W. Sebesta (2010).Concepts of Programming Languages. Addison-Wesley. pp. 130, 324.ISBN 978-0136073475.
Primary
Inverse for left argument
Inverse for right argument
Related articles
bypowers of ten
Negative powers
Positive powers
Classes ofnatural numbers
Powers and related numbers
Of the forma × 2b ± 1
Other polynomial numbers
Recursively defined numbers
Possessing a specific set of other numbers
Expressible via specific sums
2-dimensional
centered
non-centered
3-dimensional
centered
non-centered
pyramidal
4-dimensional
non-centered
Combinatorial numbers
Divisor functions
Prime omega functions
Euler's totient function
Aliquot sequences
Primorial
Otherprime factor ordivisor related numbers
Numeral system-dependent numbers
Arithmetic functions
anddynamics
Digit sum
Digit product
Coding-related
Other
P-adic numbers-related
Digit-composition related
Digit-permutation related
Divisor-related
Other
Generated via asieve
Sorting related
Graphemics related
Authority control databases: NationalEdit this at Wikidata
Retrieved from "https://en.wikipedia.org/w/index.php?title=Exponentiation&oldid=1281632179"
Categories:
Hidden categories:

[8]ページ先頭

©2009-2025 Movatter.jp