Search Results for ""

A k-matching in a graph G is a set of k edges, no two of which have a vertex in common (i.e., an independent edge set of size k). Let Phi_k be the number of k-matchings in ...

A Mersenne number is a number of the form M_n=2^n-1, (1) where n is an integer. The Mersenne numbers consist of all 1s in base-2, and are therefore binary repunits. The first ...

Given a Poisson process, the probability of obtaining exactly n successes in N trials is given by the limit of a binomial distribution P_p(n|N)=(N!)/(n!(N-n)!)p^n(1-p)^(N-n). ...

A statistical distribution published by William Gosset in 1908. His employer, Guinness Breweries, required him to publish under a pseudonym, so he chose "Student." Given N ...

Let L(n,d) be the smallest tour length for n points in a d-D hypercube. Then there exists a smallest constant alpha(d) such that for all optimal tours in the hypercube, lim ...

Code 177 is a totalistic cellular automaton that yields patterns with seemingly random features. The rules and 300 steps of this automaton are illustrated above.

Code 2040 is a totalistic cellular automaton that yields patterns with seemingly random features. The rules and 300 steps of this automaton are illustrated above.

Code 912 is a totalistic cellular automaton that yields patterns with seemingly random features. The rules and 300 steps of this automaton are illustrated above.

The look and say sequence generated from a starting digit of 3, as given by Vardi (1991).

A lag system, introduced by Wang (1963), is a sort of opposite to a tag system. Lag systems allow dependence on more than just the first element, but remove only the first ...