Search Results for ""

An algorithm for multiplying two 32-bit integers modulo a 32-bit constant without using any intermediates larger than 32 bits. It is also useful in certain types of random ...

The Schwarzian derivative is defined by D_(Schwarzian)=(f^(''')(x))/(f^'(x))-3/2[(f^('')(x))/(f^'(x))]^2. The Feigenbaum constant is universal for one-dimensional maps if its ...

Let f be analytic on the unit disk, and assume that 1. |f(z)|<=1 for all z and 2. f(0)=0. Then |f(z)|<=|z| and |f^'(0)|<=1. If either |f(z)|=|z| for some z!=0 or if ...

A modification of the Eberhart's conjecture proposed by Wagstaff (1983) which proposes that if q_n is the nth prime such that M_(q_n) is a Mersenne prime, then ...

A zero-sum game is a game in which players make payments only to each other. In such a game, one player's loss is the other player's gain, so the total amount of "money" ...

The Fourier transform is a generalization of the complex Fourier series in the limit as L->infty. Replace the discrete A_n with the continuous F(k)dk while letting n/L->k. ...

Let s(n)=sigma(n)-n, where sigma(n) is the divisor function and s(n) is the restricted divisor function, and define the aliquot sequence of n by ...

A curve whose centrode revolves about a fixed axis with constant angle and speed when the curve is traversed with unit speed. The tangent indicatrix of a curve of constant ...

The Davenport constant of a finite Abelian group G is defined to be the length of the longest minimal zero-system of G and is denoted D(G). Symbolically, ...

A geometric series sum_(k)a_k is a series for which the ratio of each two consecutive terms a_(k+1)/a_k is a constant function of the summation index k. The more general case ...