Search Results for ""

The nonlinear three-dimensional map X^. = -(Y+Z) (1) Y^. = X+aY (2) Z^. = b+XZ-cZ (3) whose strange attractor is show above for a=0.2, b=0.2, and c=8.0.

Let X and Y be topological spaces. Then their join is the factor space X*Y=(X×Y×I)/∼, (1) where ∼ is the equivalence relation (x,y,t)∼(x^',y^',t^')<=>{t=t^'=0 and x=x^'; or ; ...

F(x) = Li_2(1-x) (1) = int_(1-x)^0(ln(1-t))/tdt, (2) where Li_2(x) is the dilogarithm.

Transparallel processing refers to this search for regularities in O(2^N) strings as if only one string of length N were concerned (as is possible if the strings form a ...

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 Fibonacci number F_(n+1) gives the number of ways for 2×1 dominoes to cover a 2×n checkerboard, as illustrated in the diagrams above (Dickau). The numbers of domino ...

Series reversion is the computation of the coefficients of the inverse function given those of the forward function. For a function expressed in a series with no constant ...

The Smarandache function mu(n) is the function first considered by Lucas (1883), Neuberg (1887), and Kempner (1918) and subsequently rediscovered by Smarandache (1980) that ...

Let each of f(a,b,c) and g(a,b,c) be a triangle center function or the zero function, and let one of the following three conditions hold. 1. The degree of homogeneity of g ...

A Mersenne prime is a Mersenne number, i.e., a number of the form M_n=2^n-1, that is prime. In order for M_n to be prime, n must itself be prime. This is true since for ...