Search Results for ""

In April 1999, Ed Pegg conjectured on sci.math that there were only finitely many zerofree cubes, to which D. Hickerson responded with a counterexample. A few days later, Lew ...

The bead-sorting algorithm orders a list of a positive integers increasingly by representing numbers as a list of a 1s, where each 1 stands for a bead. The k initial integers ...

Krall and Fink (1949) defined the Bessel polynomials as the function y_n(x) = sum_(k=0)^(n)((n+k)!)/((n-k)!k!)(x/2)^k (1) = sqrt(2/(pix))e^(1/x)K_(-n-1/2)(1/x), (2) where ...

An interpolation formula, sometimes known as the Newton-Bessel formula, given by (1) for p in [0,1], where delta is the central difference and B_(2n) = 1/2G_(2n) (2) = ...

A bicolorable graph G is a graph with chromatic number chi(G)<=2. A graph is bicolorable iff it has no odd graph cycles (König 1950, p. 170; Skiena 1990, p. 213; Harary 1994, ...

The bifolium is a folium with b=0. The bifolium is a quartic curve and is given by the implicit equation is (x^2+y^2)^2=4axy^2 (1) and the polar equation ...

A number is said to be biquadratefree (or quarticfree) if its prime factorization contains no quadrupled factors. All primes and prime powers p^n with n<=3 are therefore ...

Polynomials s_k(x;lambda) which form a Sheffer sequence with g(t) = 1+e^(lambdat) (1) f(t) = e^t-1 (2) and have generating function ...

Gray (1997) defines Bour's minimal curve over complex z by x^' = (z^(m-1))/(m-1)-(z^(m+1))/(m+1) (1) y^' = i((z^(m-1))/(m-1)+(z^(m+1))/(m+1)) (2) z^' = (2z^m)/m, (3) and then ...

A minimal surface given by the parametric equations x(u,v) = u-sinucoshv (1) y(u,v) = 1-cosucoshv (2) z(u,v) = 4sin(1/2u)sinh(1/2v) (3) (Gray 1997), or x(r,phi) = ...