Search Results for ""

Given a sequence {a_k}_(k=1)^n, a partial sum of the first N terms is given by S_N=sum_(k=1)^Na_k.

If a_1>=a_2>=...>=a_n (1) b_1>=b_2>=...>=b_n, (2) then nsum_(k=1)^na_kb_k>=(sum_(k=1)^na_k)(sum_(k=1)^nb_k). (3) This is true for any distribution.

The sum of sets A and B in a vector space, equal to {a+b:a in A,b in B}.

A sum in which subsequent terms cancel each other, leaving only initial and final terms. For example, S = sum_(i=1)^(n-1)(a_i-a_(i+1)) (1) = ...

Given two bicentric points P=p:q:r and U=u:v:w, their bicentric sum is defined by p+u:q+v:r:w.

For a given function f(x) over a partition of a given interval, the lower sum is the sum of box areas m^*Deltax_k using the infimum m of the function f(x) in each subinterval ...

An exponential sum of the form sum_(n=1)^Ne^(2piiP(n)), (1) where P(n) is a real polynomial (Weyl 1914, 1916; Montgomery 2001). Writing e(theta)=e^(2piitheta), (2) a notation ...

A continuous distribution in which the logarithm of a variable has a normal distribution. It is a general case of Gibrat's distribution, to which the log normal distribution ...

Two oriented knots (or links) can be summed by placing them side by side and joining them by straight bars so that orientation is preserved in the sum. The knot sum is also ...

The Kronecker sum is the matrix sum defined by A direct sum B=A tensor I_b+I_a tensor B, (1) where A and B are square matrices of order a and b, respectively, I_n is the ...