Search Results for ""

A set function mu is finitely additive if, given any finite disjoint collection of sets {E_k}_(k=1)^n on which mu is defined, mu( union _(k=1)^nE_k)=sum_(k=1)^nmu(E_k).

Define G(a,n)=1/aint_0^infty[1-e^(aEi(-t))sum_(k=0)^(n-1)((-a)^k[Ei(-t)]^k)/(k!)]. Then the Flajolet-Odlyzko constant is defined as G(1/2,1)=0.757823011268... (OEIS A143297).

A vector norm defined for a vector x=[x_1; x_2; |; x_n], with complex entries by |x|_1=sum_(r=1)^n|x_r|. The L^1-norm |x|_1 of a vector x is implemented in the Wolfram ...

Also known as the alternating series test. Given a series sum_(n=1)^infty(-1)^(n+1)a_n with a_n>0, if a_n is monotonic decreasing as n->infty and lim_(n->infty)a_n=0, then ...

Sequences x_n^((1)), x_n^((2)), ..., x_n^((k)) are linearly dependent if constants c_1, c_2, ..., c_k (not all zero) exist such that sum_(i=1)^kc_ix_n^((i))=0 for n=0, 1, ....

A method for finding roots which defines P_j(x)=(P(x))/((x-x_1)...(x-x_j)), (1) so the derivative is (2) One step of Newton's method can then be written as ...

A technically defined group characterizing a system of linear differential equations y_j^'=sum_(k=1)^na_(jk)(x)y_k for j=1, ..., n, where a_(jk) are complex analytic ...

A multidimensional polylogarithm is a generalization of the usual polylogarithm to L_(a_1,...,a_m)(z)=sum_(n_1>...>n_m>0)(z^(n_1))/(n_1^(a_1)...n_m^(a_m)) with positive ...

R(X_1,...X_n)=sum_(i=1)^nH(X_i)-H(X_1,...,X_n), where H(x_i) is the entropy and H(X_1,...,X_n) is the joint entropy. Linear redundancy is defined as ...

Consider the problem of comparing two real numbers x and y based on their continued fraction representations. Then the mean number of iterations needed to determine if x<y or ...