Search Results for ""
61 - 70 of 4429 for Sum of squares functionSearch Results
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 matrix direct sum of n matrices constructs a block diagonal matrix from a set of square matrices, i.e., direct sum _(i=1)^nA_i = diag(A_1,A_2,...,A_n) (1) = [A_1 ; A_2 ; ...
The odd divisor function sigma_k^((o))(n)=sum_(d|n; d odd)d^k (1) is the sum of kth powers of the odd divisors of a number n. It is the analog of the divisor function for odd ...
The prime zeta function P(s)=sum_(p)1/(p^s), (1) where the sum is taken over primes is a generalization of the Riemann zeta function zeta(s)=sum_(k=1)^infty1/(k^s), (2) where ...
A digit sum s_b(n) is a sum of the base-b digits of n, which can be implemented in the Wolfram Language as DigitSum[n_, b_:10] := Total[IntegerDigits[n, b]]The following ...
A sum which includes both the Jacobi triple product and the q-binomial theorem as special cases. Ramanujan's sum is ...
A function tau(n) related to the divisor function sigma_k(n), also sometimes called Ramanujan's tau function. It is defined via the Fourier series of the modular discriminant ...
The axiom of Zermelo-Fraenkel set theory which asserts the existence for any set a of the sum (union) x of all sets that are elements of a. The axiom may be stated ...
A zero-sum game is a game in which players make payments only to each other. In such a game, one player's loss is the other player's gain, so the total amount of "money" ...
The group direct sum of a sequence {G_n}_(n=0)^infty of groups G_n is the set of all sequences {g_n}_(n=0)^infty, where each g_n is an element of G_n, and g_n is equal to the ...
...
View search results from all Wolfram sites (444221 matches)

