Search Results for ""

A set function mu is said to possess finite subadditivity if, given any finite disjoint collection of sets {E_k}_(k=1)^n on which mu is defined, mu( union ...

In a chain complex of modules ...->C_(i+1)->^(d_(i+1))C_i->^(d_i)C_(i-1)->..., the module B_i of i-boundaries is the image of d_(i+1). It is a submodule of C_i and is ...

The imaginary number i=sqrt(-1), i.e., the square root of -1. The imaginary unit is denoted and commonly referred to as "i." Although there are two possible square roots of ...

A polynomial admitting a multiplicative inverse. In the polynomial ring R[x], where R is an integral domain, the invertible polynomials are precisely the constant polynomials ...

When P and Q are integers such that D=P^2-4Q!=0, define the Lucas sequence {U_k} by U_k=(a^k-b^k)/(a-b) for k>=0, with a and b the two roots of x^2-Px+Q=0. Then define a ...

If f(x) is positive and decreases to 0, then an Euler constant gamma_f=lim_(n->infty)[sum_(k=1)^nf(k)-int_1^nf(x)dx] can be defined. For example, if f(x)=1/x, then ...

Let x=(x_1,x_2,...,x_n) and y=(y_1,y_2,...,y_n) be nonincreasing sequences of real numbers. Then x majorizes y if, for each k=1, 2, ..., n, sum_(i=1)^kx_i>=sum_(i=1)^ky_i, ...

Given a sequence of values {a_k}_(k=1)^n, the running maxima are the sequence of values {max(a_1,...,a_k)}_(k=1)^n. So, for example, given a sequence (3,5,7,8,8,5,7,9,2,5), ...

If f_1(x), ..., f_s(x) are irreducible polynomials with integer coefficients such that no integer n>1 divides f_1(x), ..., f_s(x) for all integers x, then there should exist ...

A Taylor series remainder formula that gives after n terms of the series R_n=(f^((n+1))(x^*))/(n!p)(x-x^*)^(n+1-p)(x-x_0)^p for x^* in (x_0,x) and any p>0 (Blumenthal 1926, ...