Search Results for ""

A number n is called a k e-perfect number if sigma_e(n)=kn, where sigma_e(n) is the sum of the e-divisors of n.

A bicubic spline is a special case of bicubic interpolation which uses an interpolation function of the form y(x_1,x_2) = sum_(i=1)^(4)sum_(j=1)^(4)c_(ij)t^(i-1)u^(j-1) (1) ...

The nth root of the content of the set sum of two sets in n-dimensional Euclidean space is greater than or equal to the sum of the nth roots of the contents of the individual ...

product_(k=1)^(n)(1+yq^k) = sum_(m=0)^(n)y^mq^(m(m+1)/2)[n; m]_q (1) = sum_(m=0)^(n)y^mq^(m(m+1)/2)((q)_n)/((q)_m(q)_(n-m)), (2) where [n; m]_q is a q-binomial coefficient.

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.

If, in an interval of x, sum_(r=1)^(n)a_r(x) is uniformly bounded with respect to n and x, and {v_r} is a sequence of positive non-increasing quantities tending to zero, then ...

Let |sum_(n=1)^pa_n|<K, (1) where K is independent of p. Then if f_n>=f_(n+1)>0 and lim_(n->infty)f_n=0, (2) it follows that sum_(n=1)^inftya_nf_n (3) converges.

The Eberlein polynomials of degree 2k and variable x are the orthogonal polynomials arising in the Johnson scheme that may be defined by E_k^((n,v))(x) = ...

For a given bounded function f(x) over a partition of a given interval, the upper sum is the sum of box areas M^*Deltax_k using the supremum M of the function f(x) in each ...

A vector sum is the result of adding two or more vectors together via vector addition. It is denoted using the normal plus sign, i.e., the vector sum of vectors A, B, and C ...