Operations on numbers

smallest positive integer divisible by two or more integers

function

mathematical procedure which produces a result from one or more input values

family of positive integers that occur as coefficients in the binomial theorem

thumb|alt=A colorful graphic with brightly colored loops that grow in intensity as the eye goes to the right|Domain coloring of the holomorphic tetration {}^{z}e, with [[hue representing the function argument and brightness representing magnitude]] thumb|alt=A line graph with curves that bend upward dramatically as the values on the x-axis get larger|{}^{n}x, for , showing convergence to the infinitely iterated exponential between the two dots

In computing and mathematics, the modulo operation returns the remainder or signed remainder of a division, after one number is divided by another, the latter being called the modulus of the operation.

In mathematics, the hyperoperation sequence is an infinite sequence of arithmetic operations (called hyperoperations in this context) that starts with a unary operation (the successor function with n = 0). The sequence continues with the binary operations of addition (n = 1), multiplication (n = 2), and exponentiation (n = 3). After that, the sequence proceeds with further binary operations extending beyond exponentiation, using right-associativity. For the operations beyond exponentiation, the nth member of this sequence is named by Reuben Goodstein after the Greek prefix of n suffixed with -

summation where the number of terms is zero

number of ways to partition a set of n objects into k non-empty subsets

given fractions a⁄c and b⁄d, the fraction (a+b)⁄(c+d)

mathematical functions

number of permutations of n elements with k disjoint cycles

hypotenuse of right triangle from its sides