Search Results for ""

The objective of global optimization is to find the globally best solution of (possibly nonlinear) models, in the (possible or known) presence of multiple local optima. ...

A puzzle involving disentangling a set of rings from a looped double rod, originally used by French peasants to lock chests (Steinhaus 1999). The word "baguenaudier" means ...

The Cantor set T_infty, sometimes also called the Cantor comb or no middle third set (Cullen 1968, pp. 78-81), is given by taking the interval [0,1] (set T_0), removing the ...

A column-convex polyomino is a self-avoiding convex polyomino such that the intersection of any vertical line with the polyomino has at most two connected components. ...

A convolution is an integral that expresses the amount of overlap of one function g as it is shifted over another function f. It therefore "blends" one function with another. ...

Cribbage is a game in which each of two players is dealt a hand of six cards. Each player then discards two of his six cards to a four-card "crib" which alternates between ...

The number N_d^((b))(n) of digits d in the base-b representation of a number n is called the b-ary digit count for d. The digit count is implemented in the Wolfram Language ...

A set of m distinct positive integers S={a_1,...,a_m} satisfies the Diophantus property D(n) of order n (a positive integer) if, for all i,j=1, ..., m with i!=j, ...

The falling factorial (x)_n, sometimes also denoted x^(n__) (Graham et al. 1994, p. 48), is defined by (x)_n=x(x-1)...(x-(n-1)) (1) for n>=0. Is also known as the binomial ...

The geometric distribution is a discrete distribution for n=0, 1, 2, ... having probability density function P(n) = p(1-p)^n (1) = pq^n, (2) where 0<p<1, q=1-p, and ...