Search Results for ""

The polylogarithm Li_n(z), also known as the Jonquière's function, is the function Li_n(z)=sum_(k=1)^infty(z^k)/(k^n) (1) defined in the complex plane over the open unit ...

Let sum_(k=0)^(infty)a_k=a and sum_(k=0)^(infty)c_k=c be convergent series such that lim_(k->infty)(a_k)/(c_k)=lambda!=0. Then ...

The central binomial coefficient (2n; n) is never squarefree for n>4. This was proved true for all sufficiently large n by Sárkőzy's theorem. Goetgheluck (1988) proved the ...

The binomial coefficient (n; k) is the number of ways of picking k unordered outcomes from n possibilities, also known as a combination or combinatorial number. The symbols ...

A sequence of polynomials p_n satisfying the identities p_n(x+y)=sum_(k>=0)(n; k)p_k(x)p_(n-k)(y).

The differential forms on C^n decompose into forms of type (p,q), sometimes called (p,q)-forms. For example, on C, the exterior algebra decomposes into four types: ^ C = ^ ^0 ...

sum_(i=1)^n((partialu)/(partialx_i))^2=1.

Any sum of a selection of Pi_ks, where Pi_k denotes a k-D polytope.

A partition is a way of writing an integer n as a sum of positive integers where the order of the addends is not significant, possibly subject to one or more additional ...

Given a sequence {a_n}_(n=1)^infty, a formal power series f(s) = sum_(n=1)^(infty)(a_n)/(n^s) (1) = a_1+(a_2)/(2^s)+(a_3)/(3^s)+... (2) is called the Dirichlet generating ...