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 constant e is base of the natural logarithm. e is sometimes known as Napier's constant, although its symbol (e) honors Euler. e is the unique number with the property ...

A coordinate system (mu,nu,psi) given by the coordinate transformation x = (mucospsi)/(mu^2+nu^2) (1) y = (musinpsi)/(mu^2+nu^2) (2) z = nu/(mu^2+nu^2) (3) and defined for ...

136·2^(256) approx 1.575×10^(79). According to Eddington, the exact number of protons in the universe, where 136 was the reciprocal of the fine structure constant as best as ...

The bias of a series is defined as Q[a_i,a_(i+1),a_(i+2)]=(a_ia_(i+2)-a_(i+1)^2)/(a_ia_(i+1)a_(i+2)). A series is geometric iff Q=0. A series is artistic iff the bias is ...

The coordinate system obtained by inversion of Cartesian coordinates, with u,v,w in (-infty,infty). The transformation equations are x = u/(u^2+v^2+w^2) (1) y = ...

A coordinate system which is similar to bispherical coordinates but having fourth-degree surfaces instead of second-degree surfaces for constant mu. The coordinates are given ...

Nice approximations for the golden ratio phi are given by phi approx sqrt((5pi)/6) (1) approx (7pi)/(5e), (2) the last of which is due to W. van Doorn (pers. comm., Jul. 18, ...

Landau (1911) proved that for any fixed x>1, sum_(0<|I[rho]|<=T)x^rho=-T/(2pi)Lambda(x)+O(lnT) as T->infty, where the sum runs over the nontrivial Riemann zeta function zeros ...

Mills (1947) proved the existence of a real constant A such that |_A^(3^n)_| (1) is prime for all integers n>=1, where |_x_| is the floor function. Mills (1947) did not, ...