Search Results for ""

d_n=p_(n+1)-p_n. (1) The first few values are 1, 2, 2, 4, 2, 4, 2, 4, 6, 2, 6, 4, 2, 4, 6, 6, ... (OEIS A001223). Rankin has shown that d_n>(clnnlnlnnlnlnlnlnn)/((lnlnlnn)^2) ...

tau(n) is prime for n=63001, 458329, 942841, 966289, 1510441, ... (OEIS A135430). These values are also known as Lehmer-Ramanujan numbers or LR numbers since the first of ...

A root-finding algorithm based on the iteration formula x_(n+1)=x_n-(f(x_n))/(f^'(x_n)){1+(f(x_n)f^('')(x_n))/(2[f^'(x_n)]^2)}. This method, like Newton's method, has poor ...

Assemble six 1×2×2 blocks and three 1×1×1 blocks into a 3×3×3 cube.

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 modified Lommel functions of the first and second kind give the solution to the Lommel differential equation with a minus sign in front of the linear term, i.e., ...

Stratton (1935), Chu and Stratton (1941), and Rhodes (1970) define the spheroidal functions as those solutions of the differential equation (1) that remain finite at the ...

A complicated polynomial root-finding algorithm which is used in the IMSL® (IMSL, Houston, TX) library and which Press et al. (1992) describe as "practically a standard in ...

The standard deviation sigma of a probability distribution is defined as the square root of the variance sigma^2, sigma = sqrt(<x^2>-<x>^2) (1) = sqrt(mu_2^'-mu^2), (2) where ...

The conditional intensity lambda(t) associated to a temporal point process N is defined to be the expected infinitesimal rate at which events are expected to occur around ...