Search Results for ""

A transformation of period 2.

Rule 30 is one of the elementary cellular automaton rules introduced by Stephen Wolfram in 1983 (Wolfram 1983, 2002). It specifies the next color in a cell, depending on its ...

"Chaos" is a tricky thing to define. In fact, it is much easier to list properties that a system described as "chaotic" has rather than to give a precise definition of chaos. ...

Lucas's theorem states that if n>=3 be a squarefree integer and Phi_n(z) a cyclotomic polynomial, then Phi_n(z)=U_n^2(z)-(-1)^((n-1)/2)nzV_n^2(z), (1) where U_n(z) and V_n(z) ...

The Frucht graph is smallest cubic identity graph (Skiena 1990, p. 185). It is implemented in the Wolfram Language as GraphData["FruchtGraph"]. It has 12 vertices and 18 ...

Let L(n,d) be the smallest tour length for n points in a d-D hypercube. Then there exists a smallest constant alpha(d) such that for all optimal tours in the hypercube, lim ...

The Owen T-function is defined as T(x,a)=1/(2pi)int_0^a(e^(-x^2(1+t^2)/2))/(1+t^2)dt. It is implemented in the Wolfram Language as OwenT[x, a]. A special value is given by ...

A 32-sided polygon. The regular icosidodecagon is a constructible polygon, and the regular icosidodecahedron of side length 1 has inradius r, circumradius R, and area A r = ...

A polynomial with 2 terms.

The derivative rule d/(dx)[(f(x))/(g(x))]=(g(x)f^'(x)-f(x)g^'(x))/([g(x)]^2).