Search Results for ""

The function defined by U(p)=(p#)^(p#), where p is a prime number and p# is a primorial. The values for p=2, 3, ..., are 4, 46656, ...

The number of graph edges meeting at a given node in a graph is called the order of that graph vertex.

x^n=sum_(k=0)^n<n; k>(x+k; n), where <n; k> is an Eulerian number and (n; k) is a binomial coefficient (Worpitzky 1883; Comtet 1974, p. 242).

A theorem outlined by Kolmogorov (1954) which was subsequently proved in the 1960s by Arnol'd (1963) and Moser (1962; Tabor 1989, p. 105). It gives conditions under which ...

Guy's "strong law of small numbers" states that there aren't enough small numbers to meet the many demands made of them. Guy (1988) also gives several interesting and ...

Successive application of Archimedes' recurrence formula gives the Archimedes algorithm, which can be used to provide successive approximations to pi (pi). The algorithm is ...

The Bickart points are the foci F_1 and F_2 of the Steiner circumellipse. They have trilinear coordinates alpha_1:beta_1:gamma_1 and alpha_2:beta_2:gamma_2, where alpha_i = ...

A Tschirnhausen transformation can be used to algebraically transform a general quintic equation to the form z^5+c_1z+c_0=0. (1) In practice, the general quintic is first ...

The covariant derivative of a contravariant tensor A^a (also called the "semicolon derivative" since its symbol is a semicolon) is given by A^a_(;b) = ...

The science of adversarial information protection.