Search Results for ""

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

Let A and B be two classes of positive integers. Let A(n) be the number of integers in A which are less than or equal to n, and let B(n) be the number of integers in B which ...

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

A path in a graph G is a subgraph of G that is a path graph (West 2000, p. 20). The length of a path is the number of edges it contains. In most contexts, a path must contain ...

Let alpha, -beta, and -gamma^(-1) be the roots of the cubic equation t^3+2t^2-t-1=0, (1) then the Rogers L-function satisfies L(alpha)-L(alpha^2) = 1/7 (2) ...

Grimm conjectured that if n+1, n+2, ..., n+k are all composite numbers, then there are distinct primes p_(i_j) such that p_(i_j)|(n+j) for 1<=j<=k.

A modification of the Eberhart's conjecture proposed by Wagstaff (1983) which proposes that if q_n is the nth prime such that M_(q_n) is a Mersenne prime, then ...