Search Results for ""
101 - 110 of 113 for chaosSearch Results

An out-shuffle, also known as a perfect shuffle (Golomb 1961), is a riffle shuffle in which the top half of the deck is placed in the right hand, and cards are then ...
The Skewes number (or first Skewes number) is the number Sk_1 above which pi(n)<li(n) must fail (assuming that the Riemann hypothesis is true), where pi(n) is the prime ...
Let b(k) be the number of 1s in the binary expression of k, i.e., the binary digit count of 1, giving 1, 1, 2, 1, 2, 2, 3, 1, 2, 2, 3, ... (OEIS A000120) for k=1, 2, .... ...
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 ...
Let x=[a_0;a_1,...]=a_0+1/(a_1+1/(a_2+1/(a_3+...))) (1) be the simple continued fraction of a "generic" real number x, where the numbers a_i are the partial denominator. ...
The partial differential equation u_t+u_(xxx)-6uu_x=0 (1) (Lamb 1980; Zwillinger 1997, p. 175), often abbreviated "KdV." This is a nondimensionalized version of the equation ...
A polygon can be defined (as illustrated above) as a geometric object "consisting of a number of points (called vertices) and an equal number of line segments (called sides), ...
A regular polygon is an n-sided polygon in which the sides are all the same length and are symmetrically placed about a common center (i.e., the polygon is both equiangular ...
A partial differential equation which appears in differential geometry and relativistic field theory. Its name is a wordplay on its similar form to the Klein-Gordon equation. ...
The Thue-Morse sequence, also called the Morse-Thue sequence or Prouhet-Thue-Morse sequence (Allouche and Cosnard 2000), is one of a number of related sequences of numbers ...

...