Search Results for ""

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" ...

Consider the Fibonacci-like recurrence a_n=+/-a_(n-1)+/-a_(n-2), (1) where a_0=0, a_1=1, and each sign is chosen independently and at random with probability 1/2. ...

The Enneper surfaces are a three-parameter family of surfaces with constant negative curvature (and nonconstant mean curvature). In general, they are described by elliptic ...

A coordinate system similar to toroidal coordinates but with fourth-degree instead of second-degree surfaces for constant mu so that the toroids of circular cross section are ...

A Trott constant is a real number whose decimal digits are equal to the terms of its continued fraction. The first Trott constant (OEIS A039662) was discovered by M. Trott in ...

A Julia set with constant c chosen at the boundary of the Mandelbrot set (Branner 1989; Dufner et al. 1998, p. 225). The image above was computed using c=i.

If q_n is the nth prime such that M_(q_n) is a Mersenne prime, then q_n∼(3/2)^n. It was modified by Wagstaff (1983) to yield Wagstaff's conjecture, q_n∼(2^(e^(-gamma)))^n, ...

If f:[a,b]->[a,b] (where [a,b] denotes the closed interval from a to b on the real line) satisfies a Lipschitz condition with constant K, i.e., if |f(x)-f(y)|<=K|x-y| for all ...

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 ...