Search Results for ""

Tetrahedron picking is the process of picking tetrahedra at random within a given shape in 3 or higher dimensions. The most natural definition of a random tetrahedron is one ...

A strategy for the iterated prisoner's dilemma in which a prisoner cooperates on the first move, and thereafter copies the previous move of the other prisoner. Any better ...

Transparallel processing refers to this search for regularities in O(2^N) strings as if only one string of length N were concerned (as is possible if the strings form a ...

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

An odd alternating permutation number, more commonly called an Euler number or secant number.

Theory of Computation

A generalized hypergeometric function _pF_q[alpha_1,alpha_2,...,alpha_p; beta_1,beta_2,...,beta_q;z], is said to be k-balanced if sum_(i=1)^qbeta_i=k+sum_(i=1)^palpha_i.

Apéry's constant is defined by zeta(3)=1.2020569..., (1) (OEIS A002117) where zeta(z) is the Riemann zeta function. Apéry (1979) proved that zeta(3) is irrational, although ...

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

Dijkstra's algorithm is an algorithm for finding a graph geodesic, i.e., the shortest path between two graph vertices in a graph. It functions by constructing a shortest-path ...