Search Results for ""

The expected number of trials needed to collect a complete set of n different objects when picked at random with repetition is nH_n (Havil 2003, p. 131). For n=1, 2, ..., the ...

A labeled ternary tree containing the labels 1 to n with root 1, branches leading to nodes labeled 2, 3, 4, branches from these leading to 5, 6, 7 and 8, 9, 10 respectively, ...

Let P be the principal (initial investment), r be the annual compounded rate, i^((n)) the "nominal rate," n be the number of times interest is compounded per year (i.e., the ...

Any computable function can be incorporated into a program using while-loops (i.e., "while something is true, do something else"). For-loops (which have a fixed iteration ...

A computation is an operation that begins with some initial conditions and gives an output which follows from a definite set of rules. The most common example are ...

Computation time (also called "running time") is the length of time required to perform a computational process. Representation a computation as a sequence of rule ...

It is conjectured that any convex body in n-dimensional Euclidean space has an interior point lying on normals through 2n distinct boundary points (Croft et al. 1991). This ...

Let X and Y be sets, and let R subset= X×Y be a relation on X×Y. Then R is a concurrent relation if and only if for any finite subset F of X, there exists a single element p ...

Condorcet's jury theorem states that given a group of voters (a "jury") independently choosing by majority vote between a correct outcome with probability 0<=p<=1 and an ...

A product of ANDs, denoted ^ _(k=1)^nA_k. The conjunctions of a Boolean algebra A of subsets of cardinality p are the 2^p functions A_lambda= union _(i in lambda)A_i, where ...