For a nonnegative integer exponent, exponentiation iterates multiplication: and . This convention defines in primitive recursive arithmetic. Extensions to other exponents may use different domains and conventions.
An th root of is a solution of , where is a positive integer. For there is a unique nonnegative real root, denoted . For odd each real number has exactly one real root; for even , a positive input has two real solutions and a negative input has none.
For example, denotes the principal nonnegative root, although both and solve . Over the complex numbers, a nonzero has distinct roots, differing by th roots of unity. Specifying the field and the principal-root convention prevents ambiguity.
For a nonnegative integer and a positive integer , the integer nth root is the unique integer such that . Thus .
Because is increasing on the nonnegative integers, binary search with exact comparisons computes the root without relying on rounded floating-point arithmetic. This is useful in perfect-power tests and exact bounds in integer factorization. Verifying the two inequalities also certifies an answer obtained from an approximate initial guess.
An integer root bound brackets an integer nth root using exact inequalities. If has bit length and , thenIndeed, ; taking positive real th roots gives the bounds. They supply an initial interval for binary search.
For and , the bit length is ten, giving . Testing nearby powers then finds the exact value . Using inequalities rather than rounded roots avoids excluding a perfect power at a search boundary.
Repeated exponentiation with right association: and . For example, , rather than . Computing its remainder modulo an integer often uses a chain of smaller exponent moduli; applying Euler's theorem requires checking its coprimality hypothesis at every level.
An addition chain for a positive integer is , where each is the sum of two earlier entries, which may coincide. It computes in multiplications by reusing previously computed powers. For example, computes in five multiplications.
An addition chain restricted to updates with . Each new power uses the most recently computed power as one factor. This restriction reduces the search space, but a shortest star chain need not be a shortest unrestricted addition chain for every target.
An exponent specifies the power in exponentiation: in , is the base and is the exponent. For a positive integer exponent, . For a positive real number base, a real exponent is defined by using the exponential function and natural logarithm. The Lp norm uses its exponent to determine how strongly large absolute values affect the result.
The square of a number is the product . For a real number, it is nonnegative. The sum of squares of real coordinates is the squared Euclidean norm of the corresponding vector.
The hyperoperation hierarchy successively iterates basic arithmetic operations. In the usual indexing, successor is followed by addition, multiplication, exponentiation and their higher iterates. A sequence beginning with addition shifts this index by one. Each fixed rank is a primitive recursive function; this does not imply that the evaluator taking the rank as an additional variable is primitive recursive.
Articles by others on the same topic
Exponentiation is a mathematical operation that involves raising a number, called the base, to the power of an exponent. The exponent indicates how many times the base is multiplied by itself. The operation can be expressed in the form: \[ a^n \] where: - \( a \) is the base, - \( n \) is the exponent.