Search Results for ""

A game in which the possible moves are the same for each player in any position. All positions in all impartial games form an additive Abelian group. For impartial games in ...

Denote the sum of two matrices A and B (of the same dimensions) by C=A+B. The sum is defined by adding entries with the same indices c_(ij)=a_(ij)+b_(ij) over all i and j. ...

A series is said to be convergent if it approaches some limit (D'Angelo and West 2000, p. 259). Formally, the infinite series sum_(n=1)^(infty)a_n is convergent if the ...

Let s_b(n) be the sum of the base-b digits of n, and epsilon(n)=(-1)^(s_2(n)) the Thue-Morse sequence, then product_(n=0)^infty((2n+1)/(2n+2))^(epsilon(n))=1/2sqrt(2).

Let F be a finite field with q elements, and let F_s be a field containing F such that [F_s:F]=s. Let chi be a nontrivial multiplicative character of F and chi^'=chi ...

The combining of two or more quantities using the plus operator. The individual numbers being combined are called addends, and the total is called the sum. The first of ...

A generalization of an Ulam sequence in which each term is the sum of two earlier terms in exactly s ways. (s,t)-additive sequences are a further generalization in which each ...

A series sum_(n)u_n is said to converge absolutely if the series sum_(n)|u_n| converges, where |u_n| denotes the absolute value. If a series is absolutely convergent, then ...

Let (Omega)_(ij) be the resistance distance matrix of a connected graph G on n nodes. Then Foster's theorems state that sum_((i,j) in E(G)))Omega_(ij)=n-1, where E(g) is the ...

The sum-of-factorial powers function is defined by sf^p(n)=sum_(k=1)^nk!^p. (1) For p=1, sf^1(n) = sum_(k=1)^(n)k! (2) = (-e+Ei(1)+pii+E_(n+2)(-1)Gamma(n+2))/e (3) = ...