Search Results for ""

A searching algorithm which works on a sorted table by testing the middle of an interval, eliminating the half of the table in which the key cannot lie, and then repeating ...

A number of spellings of "Chebyshev" (which is the spelling used exclusively in this work) are commonly found in the literature. These include Tchebicheff, Čebyšev, ...

Let p be a prime with n digits and let A be a constant. Call p an "A-prime" if the concatenation of the first n digits of A (ignoring the decimal point if one is present) ...

The map projection having transformation equations x = (lambda-lambda_0)cosphi_1 (1) y = phi, (2) and the inverse formulas are phi = y (3) lambda = lambda_0+xsecphi_1, (4) ...

An embedding of a 1-sphere in a 3-manifold which exists continuously over the 2-disk also extends over the disk as an embedding. An alternate phrasing is that if a knot group ...

The E_n(x) function is defined by the integral E_n(x)=int_1^infty(e^(-xt)dt)/(t^n) (1) and is given by the Wolfram Language function ExpIntegralE[n, x]. Defining t=eta^(-1) ...

Given triangle DeltaABC, there are four lines simultaneously tangent to the B- and C-excircles (with centers J_B and J_C, respectively). Of these, three correspond to the ...

At rational arguments p/q, the digamma function psi_0(p/q) is given by psi_0(p/q)=-gamma-ln(2q)-1/2picot(p/qpi) +2sum_(k=1)^([q/2]-1)cos((2pipk)/q)ln[sin((pik)/q)] (1) for ...

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

The hyperfactorial (Sloane and Plouffe 1995) is the function defined by H(n) = K(n+1) (1) = product_(k=1)^(n)k^k, (2) where K(n) is the K-function. The hyperfactorial is ...