Search Results for ""

The sequence of numbers {j_n} giving the number of digits in the three-fold power tower n^(n^n). The values of n^(n^n) for n=1, 2, ... are 1, 16, 7625597484987, ... (OEIS ...

A knot diagram is a picture of a projection of a knot onto a plane. Usually, only double points are allowed (no more than two points are allowed to be superposed), and the ...

Laguerre-Gauss quadrature, also called Gauss-Laguerre quadrature or Laguerre quadrature, is a Gaussian quadrature over the interval [0,infty) with weighting function ...

Arrange copies of the n digits 1, ..., n such that there is one digit between the 1s, two digits between the 2s, etc. For example, the unique (modulo reversal) n=3 solution ...

Cubic lattice sums include the following: b_2(2s) = sum^'_(i,j=-infty)^infty((-1)^(i+j))/((i^2+j^2)^s) (1) b_3(2s) = ...

Consider a line segment of length 1, and pick a point x at random between [0,1]. This point x divides the line into line segments of length x and 1-x. If a set of points are ...

Li's criterion states that the Riemann hypothesis is equivalent to the statement that, for lambda_n=1/((n-1)!)(d^n)/(ds^n)[s^(n-1)lnxi(s)]|_(s=1), (1) where xi(s) is the ...

A Maclaurin series is a Taylor series expansion of a function about 0, (1) Maclaurin series are named after the Scottish mathematician Colin Maclaurin. The Maclaurin series ...

The Mellin transform is the integral transform defined by phi(z) = int_0^inftyt^(z-1)f(t)dt (1) f(t) = 1/(2pii)int_(c-iinfty)^(c+iinfty)t^(-z)phi(z)dz. (2) It is implemented ...

An algorithm for finding the nearest local minimum of a function which presupposes that the gradient of the function can be computed. The method of steepest descent, also ...