Search Results for ""

The traveling salesman problem is a problem in graph theory requiring the most efficient (i.e., least total distance) Hamiltonian cycle a salesman can take through each of n ...

A correction to a discrete binomial distribution to approximate a continuous distribution. P(a<=X<=b) approx P((a-1/2-np)/(sqrt(np(1-p)))<=z<=(b+1/2-np)/(sqrt(np(1-p)))), ...

The absolute moment of M_n of a probability function P(x) taken about a point a is defined by M_n=int|x-a|^nP(x)dx.

Let S_n be the sum of n random variates X_i with a Bernoulli distribution with P(X_i=1)=p_i. Then sum_(k=0)^infty|P(S_n=k)-(e^(-lambda)lambda^k)/(k!)|<2sum_(i=1)^np_i^2, ...

The discrete uniform distribution is also known as the "equally likely outcomes" distribution. Letting a set S have N elements, each of them having the same probability, then ...

Because the Legendre polynomials form a complete orthogonal system over the interval [-1,1] with respect to the weighting function w(x)=1, any function f(x) may be expanded ...

A biplanar graph is defined as a graph that is the graph union of two planar edge-induced subgraphs. In other words, biplanar graphs are graphs with graph thickness 1 or 2 ...

For a countable set of n disjoint events E_1, E_2, ..., E_n P( union _(i=1)^nE_i)=sum_(i=1)^nP(E_i).

If p_1, ..., p_n are positive numbers which sum to 1 and f is a real continuous function that is convex, then f(sum_(i=1)^np_ix_i)<=sum_(i=1)^np_if(x_i). (1) If f is concave, ...

A sequence {a_i} is said to be periodic with period p with if it satisfies a_i=a_(i+np) for n=1, 2, .... For example, {1,2,1,2,1,2,1,2,1,2,1,2,1,2,...} is a periodic sequence ...