Search Results for ""

Let f be differentiable on the open interval (a,b) and continuous on the closed interval [a,b]. Then if f(a)=f(b), then there is at least one point c in (a,b) where f^'(c)=0. ...

Sprague (1963) considered the problem of "rolling" five cubes, each which an upright letter "A" on its top, on a chessboard. Here "rolling" means the cubes are moved from ...

A generalization of the binomial coefficient whose notation was suggested by Knuth, |_n; k]=(|_n]!)/(|_k]!|_n-k]!), (1) where |_n] is a Roman factorial. The above expression ...

A powerful numerical integration technique which uses k refinements of the extended trapezoidal rule to remove error terms less than order O(N^(-2k)). The routine advocated ...

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

The root separation (or zero separation) of a polynomial P(x) with roots r_1, r_2, ... is defined by Delta(P)=min_(i!=j)|r_i-r_j|. There are lower bounds on how close two ...

Let E be a Euclidean space, (beta,alpha) be the dot product, and denote the reflection in the hyperplane P_alpha={beta in E|(beta,alpha)=0} by ...

Let sum_(k=1)^(infty)u_k be a series with positive terms, and let rho=lim_(k->infty)u_k^(1/k). 1. If rho<1, the series converges. 2. If rho>1 or rho=infty, the series ...

A special graph vertex that is designated to turn a tree into a rooted tree or a graph into a rooted graph. The root is sometimes also called "eve," or an "endpoint" (Saaty ...

A rotation group is a group in which the elements are orthogonal matrices with determinant 1. In the case of three-dimensional space, the rotation group is known as the ...