Search Results for ""

Let the difference of successive primes be defined by d_n=p_(n+1)-p_n, and d_n^k by d_n^k={d_n for k=1; |d_(n+1)^(k-1)-d_n^(k-1)| for k>1. (1) N. L. Gilbreath claimed that ...

One of the three standard tori given by the parametric equations x = a(1+cosv)cosu (1) y = a(1+cosv)sinu (2) z = asinv, (3) corresponding to the torus with a=c. It has ...

Given a set y=f(x) of n equations in n variables x_1, ..., x_n, written explicitly as y=[f_1(x); f_2(x); |; f_n(x)], (1) or more explicitly as {y_1=f_1(x_1,...,x_n); |; ...

Lagrange's identity is the algebraic identity (sum_(k=1)^na_kb_k)^2=(sum_(k=1)^na_k^2)(sum_(k=1)^nb_k^2)-sum_(1<=k<j<=n)(a_kb_j-a_jb_k)^2 (1) (Mitrinović 1970, p. 41; Marsden ...

The Legendre symbol is a number theoretic function (a/p) which is defined to be equal to +/-1 depending on whether a is a quadratic residue modulo p. The definition is ...

A Lie group is a smooth manifold obeying the group properties and that satisfies the additional condition that the group operations are differentiable. This definition is ...

A transformation of the form w=f(z)=(az+b)/(cz+d), (1) where a, b, c, d in C and ad-bc!=0, (2) is a conformal mapping called a linear fractional transformation. The ...

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 ...

A minimum vertex cover is a vertex cover having the smallest possible number of vertices for a given graph. The size of a minimum vertex cover of a graph G is known as the ...

The perspective image of an infinite checkerboard. It can be constructed starting from any triangle DeltaOXY, where OX and OY form the near corner of the floor, and XY is the ...