Search Results for ""

The modular group Gamma is the set of all transformations w of the form w(t)=(at+b)/(ct+d), where a, b, c, and d are integers and ad-bc=1. A Gamma-modular function is then ...

_2F_1(a,b;c;1)=((c-b)_(-a))/((c)_(-a))=(Gamma(c)Gamma(c-a-b))/(Gamma(c-a)Gamma(c-b)) for R[c-a-b]>0, where _2F_1(a,b;c;x) is a (Gauss) hypergeometric function. If a is a ...

Let a Gram point g_n be called "good" if (-1)^nZ(g_n)>0, and "bad" otherwise (Rosser et al. 1969; Edwards 2001, p. 180). Then the interval between two consecutive good Gram ...

Gram's law (Hutchinson 1925; Edwards 2001, pp. 125, 127, and 171) is the tendency for zeros of the Riemann-Siegel function Z(t) to alternate with Gram points. Stated more ...

In Season 4 episode "Black Swan" of the television crime drama NUMB3RS, the character Amita Ramanujan refers to graph entropies when studying a map of the Los Angeles while ...

A root-finding algorithm which makes use of a third-order Taylor series f(x)=f(x_n)+f^'(x_n)(x-x_n)+1/2f^('')(x_n)(x-x_n)^2+.... (1) A root of f(x) satisfies f(x)=0, so 0 ...

A root-finding algorithm also known as the tangent hyperbolas method or Halley's rational formula. As in Halley's irrational formula, take the second-order Taylor series ...

Let {a_n} be a nonnegative sequence and f(x) a nonnegative integrable function. Define A_n=sum_(k=1)^na_k (1) and F(x)=int_0^xf(t)dt (2) and take p>1. For sums, ...

For all integers n and nonnegative integers t, the harmonic logarithms lambda_n^((t))(x) of order t and degree n are defined as the unique functions satisfying 1. ...

The haversine, also called the haversed sine, is a little-used entire trigonometric function defined by hav(z) = 1/2vers(z) (1) = 1/2(1-cosz) (2) = sin^2(1/2z), (3) where ...