Search Results for ""

For a set of n numbers or values of a discrete distribution x_i, ..., x_n, the root-mean-square (abbreviated "RMS" and sometimes called the quadratic mean), is the square ...

Let V be a real vector space (e.g., the real continuous functions C(I) on a closed interval I, two-dimensional Euclidean space R^2, the twice differentiable real functions ...

An expression is called "well-defined" (or "unambiguous") if its definition assigns it a unique interpretation or value. Otherwise, the expression is said to not be ...

In the algebraic geometry of Grothendieck, a stack refers to a sheaf of categories. In particular, a stack is a presheaf of categories in which the following descent ...

Dickson (1913, 2005) defined an amicable triple to be a triple of three numbers (l,m,n) such that s(l) = m+n (1) s(m) = l+n (2) s(n) = l+m, (3) where s(n) is the restricted ...

Let Gamma(z) be the gamma function and n!! denote a double factorial, then [(Gamma(m+1/2))/(Gamma(m))]^2[1/m+(1/2)^21/(m+1)+((1·3)/(2·4))^21/(m+2)+...]_()_(n) ...

A column-convex self-avoiding polygon which contains the bottom edge of its minimal bounding rectangle. The anisotropic perimeter and area generating function ...

The attractor of the iterated function system given by the set of "fern functions" f_1(x,y) = [0.85 0.04; -0.04 0.85][x; y]+[0.00; 1.60] (1) f_2(x,y) = [-0.15 0.28; 0.26 ...

Polynomials s_k(x;lambda) which form a Sheffer sequence with g(t) = 1+e^(lambdat) (1) f(t) = e^t-1 (2) and have generating function ...

Brent's method is a root-finding algorithm which combines root bracketing, bisection, and inverse quadratic interpolation. It is sometimes known as the van ...