Search Results for ""

The important binomial theorem states that sum_(k=0)^n(n; k)r^k=(1+r)^n. (1) Consider sums of powers of binomial coefficients a_n^((r)) = sum_(k=0)^(n)(n; k)^r (2) = ...

Closed forms are known for the sums of reciprocals of even-indexed Fibonacci numbers P_F^((e)) = sum_(n=1)^(infty)1/(F_(2n)) (1) = ...

nu_((r))=sum_(x)x^((r))f(x), where x^((r))=x(x-1)...(x-r+1).

sum_(k=-infty)^infty(a; m-k)(b; n-k)(a+b+k; k)=(a+n; m)(b+m; n).

An equation is said to be a closed-form solution if it solves a given problem in terms of functions and mathematical operations from a given generally-accepted set. For ...

The Dirichlet beta function is defined by the sum beta(x) = sum_(n=0)^(infty)(-1)^n(2n+1)^(-x) (1) = 2^(-x)Phi(-1,x,1/2), (2) where Phi(z,s,a) is the Lerch transcendent. The ...

A pair of primes (p,q) that sum to an even integer 2n=p+q are known as a Goldbach partition (Oliveira e Silva). Letting r(2n) denote the number of Goldbach partitions of 2n ...

An edge-magic graph is a labeled graph with e graph edges labeled with distinct elements {1,2,...,e} so that the sum of the graph edge labels at each graph vertex is the ...

If all the diagonals--including those obtained by "wrapping around" the edges--of a magic square sum to the same magic constant, the square is said to be a panmagic square ...

The Greek problems of antiquity were a set of geometric problems whose solution was sought using only compass and straightedge: 1. circle squaring. 2. cube duplication. 3. ...