Search Results for ""

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 ; ...

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 sum-free set S is a set for which the intersection of S and the sumset S+S is empty. For example, the sum-free sets of {1,2,3} are emptyset, {1}, {2}, {3}, {1,3}, and ...

The exponential sum function e_n(x), sometimes also denoted exp_n(x), is defined by e_n(x) = sum_(k=0)^(n)(x^k)/(k!) (1) = (e^xGamma(n+1,x))/(Gamma(n+1)), (2) where ...

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 ...

sum_(n=0)^(N-1)e^(inx) = (1-e^(iNx))/(1-e^(ix)) (1) = (-e^(iNx/2)(e^(-iNx/2)-e^(iNx/2)))/(-e^(ix/2)(e^(-ix/2)-e^(ix/2))) (2) = (sin(1/2Nx))/(sin(1/2x))e^(ix(N-1)/2), (3) ...

The great success mathematicians had studying hypergeometric functions _pF_q(a_1,...,a_p;b_1,...,b_q;z) for the convergent cases (p<=q+1) prompted attempts to provide ...