Search Results for ""

Set covering deployment (sometimes written "set-covering deployment" and abbreviated SCDP for "set covering deployment problem") seeks an optimal stationing of troops in a ...

A simple directed graph is a directed graph having no multiple edges or graph loops (corresponding to a binary adjacency matrix with 0s on the diagonal). The number of simple ...

The (small) rhombicosidodecahedron (Cundy and Rowlett 1989, p. 111), sometimes simply called the rhombicosidodecahedron (Maeder 1997; Wenninger 1989, p. 27; Conway et al. ...

An integer is k-smooth if it has no prime factors >k. The following table gives the first few k-smooth numbers for small k. Berndt (1994, p. 52) called the 7-smooth numbers ...

The asymptotic series for the gamma function is given by (1) (OEIS A001163 and A001164). The coefficient a_n of z^(-n) can given explicitly by ...

Given a function f(x)=f_0(x), write f_1=f^'(x) and define the Sturm functions by f_n(x)=-{f_(n-2)(x)-f_(n-1)(x)[(f_(n-2)(x))/(f_(n-1)(x))]}, (1) where [P(x)/Q(x)] is a ...

In database structures, two quantities are generally of interest: the average number of comparisons required to 1. Find an existing random record, and 2. Insert a new random ...

The simple continued fraction representations of e given by [2; 1, 2, 1, 1, 4, 1, 1, 6, ...] (OEIS A003417). This continued fraction is sometimes known as Euler's continued ...

RSA numbers are difficult to-factor composite numbers having exactly two prime factors (i.e., so-called semiprimes) that were listed in the Factoring Challenge of RSA ...

The Sierpiński sieve is a fractal described by Sierpiński in 1915 and appearing in Italian art from the 13th century (Wolfram 2002, p. 43). It is also called the Sierpiński ...