Search Results for ""

An integer sequence given by the recurrence relation a(n)=a(a(n-2))+a(n-a(n-2)) with a(1)=a(2)=1. The first few values are 1, 1, 2, 3, 3, 4, 5, 6, 6, 7, 7, 8, 9, 10, 10, 11, ...

The ordinary differential equation y^('')+r/zy^'=(Az^m+s/(z^2))y. (1) It has solution y=c_1I_(-nu)((2sqrt(A)z^(m/2+1))/(m+2))z^((1-r)/2) ...

The parameter r in the exponential equation of population growth N(t)=N_0e^(rt), where N_0 is the initial population size (at t=0) and t is the elapsed time.

The Mandelbar set is a fractal set analogous to the Mandelbrot set or its generalization to a higher power with the variable z replaced by its complex conjugate z^_.

A curve on which points of a map z_n (such as the Mandelbrot set) diverge to a given value r_(max) at the same rate. A common method of obtaining lemniscates is to define an ...

The Mann-Whitney test statistic is equivalent to the Wilcoxon test statistic (van der Waerden 1969).

For a real number x, the mantissa is defined as the positive fractional part x-|_x_|=frac(x), where |_x_| denotes the floor function. For example, for x=3.14159, the mantissa ...

A set of maximum degree to which all other degrees of recursively enumerable sets can be many-one reduced. If set A is many-one complete, then it is one-one complete, and ...

A map u:R^n->R^n from a domain G is called a map of class C^r if each component of u(x)=(u_1(x_1,...,x_n),...,u_m(x_1,...,x_n)) is of class C^r (0<=r<=infty or r=omega) in G, ...

An n-cycle is a finite sequence of points Y_0, ..., Y_(n-1) such that, under a map G, Y_1 = G(Y_0) (1) Y_2 = G(Y_1) (2) Y_(n-1) = G(Y_(n-2)) (3) Y_0 = G(Y_(n-1)). (4) In ...