Search Results for ""

Let v be a n-vector whose entries are each 1 (with probability p) or 0 (with probability q=1-p). An s-run is an isolated group of s consecutive 1s. Ignoring the boundaries, ...

The van der Grinten projection is a map projection given by the transformation x = (1) y = sgn(phi)(pi|PQ-Asqrt((A^2+1)(P^2+A^2)-Q^2)|)/(P^2+A^2), (2) where A = ...

A special case of the quadratic Diophantine equation having the form x^2-Dy^2=1, (1) where D>0 is a nonsquare natural number (Dickson 2005). The equation x^2-Dy^2=+/-4 (2) ...

An amicable pair (m,n) consists of two integers m,n for which the sum of proper divisors (the divisors excluding the number itself) of one number equals the other. Amicable ...

The binomial coefficient (n; k) is the number of ways of picking k unordered outcomes from n possibilities, also known as a combination or combinatorial number. The symbols ...

P(n), sometimes also denoted p(n) (Abramowitz and Stegun 1972, p. 825; Comtet 1974, p. 94; Hardy and Wright 1979, p. 273; Conway and Guy 1996, p. 94; Andrews 1998, p. 1), ...

The 120-cell is a finite regular four-dimensional polytope with Schläfli symbol {5,3,3}. It is also known as the hyperdodecahedron or hecatonicosachoron, and is composed of ...

The 600-cell is the finite regular four-dimensional polytope with Schläfli symbol {3,3,5}. It is also known as the hypericosahedron or hexacosichoron. It is composed of 600 ...

An alternating knot is a knot which possesses a knot diagram in which crossings alternate between under- and overpasses. Not all knot diagrams of alternating knots need be ...

A bipartite graph, also called a bigraph, is a set of graph vertices decomposed into two disjoint sets such that no two graph vertices within the same set are adjacent. A ...