Search Results for ""

There are two kinds of Bell polynomials. A Bell polynomial B_n(x), also called an exponential polynomial and denoted phi_n(x) (Bell 1934, Roman 1984, pp. 63-67) is a ...

The sequence a(n) given by the exponents of the highest power of 2 dividing n, i.e., the number of trailing 0s in the binary representation of n. For n=1, 2, ..., the first ...

The Lemke graph is the 8-node graph with 13 edges illustrated above (Lemke and Kleitman 1989, Hurlbert 2011, Hurlbert 2013). The Lemke graph is the smallest graph that does ...

The degree to which a given quantity is correct and free from error. For example, a quantity specified as 100+/-1 has an (absolute) accuracy of +/-1 (meaning its true value ...

A gambling game played at carnivals in which a player may bet on any one of the numbers 1 through 6. Three dice are then rolled and, if his number appears, he receives back a ...

In a 1631 edition of Academiae Algebrae, J. Faulhaber published the general formula for the power sum of the first n positive integers, sum_(k=1)^(n)k^p = H_(n,-p) (1) = ...

A number s of trials in which the probability of success p_i varies from trial to trial. Let x be the number of successes, then var(x)=spq-ssigma_p^2, (1) where sigma_p^2 is ...

In general, polynomial equations higher than fourth degree are incapable of algebraic solution in terms of a finite number of additions, subtractions, multiplications, ...

Let the difference of successive primes be defined by d_n=p_(n+1)-p_n, and d_n^k by d_n^k={d_n for k=1; |d_(n+1)^(k-1)-d_n^(k-1)| for k>1. (1) N. L. Gilbreath claimed that ...

A set of positive integers is double-free if, for any integer x, the set {x,2x} !subset= S (or equivalently, x in S implies 2x not in S). For example, of the subsets of ...