Search Results for ""

A binary tree in which special nodes are added wherever a null subtree was present in the original tree so that each node in the original tree (except the root node) has ...

An empty graph on n nodes consists of n isolated nodes with no edges. Such graphs are sometimes also called edgeless graphs or null graphs (though the term "null graph" is ...

Given a square matrix M, the following are equivalent: 1. |M|!=0. 2. The columns of M are linearly independent. 3. The rows of M are linearly independent. 4. Range(M) = R^n. ...

The Fourier transform of the generalized function 1/x is given by F_x(-PV1/(pix))(k) = -1/piPVint_(-infty)^infty(e^(-2piikx))/xdx (1) = ...

Riemann defined the function f(x) by f(x) = sum_(p^(nu)<=x; p prime)1/nu (1) = sum_(n=1)^(|_lgx_|)(pi(x^(1/n)))/n (2) = pi(x)+1/2pi(x^(1/2))+1/3pi(x^(1/3))+... (3) (Hardy ...

Let f(x,y) be a homogeneous function of order n so that f(tx,ty)=t^nf(x,y). (1) Then define x^'=xt and y^'=yt. Then nt^(n-1)f(x,y) = ...

For a delta function at (x_0,y_0), R(p,tau) = int_(-infty)^inftyint_(-infty)^inftydelta(x-x_0)delta(y-y_0)delta[y-(tau+px)]dydx (1) = ...

A modified spherical Bessel function of the second kind, also called a "spherical modified Bessel function of the first kind" (Arfken 1985) or (regrettably) a "modified ...

Zeros of the Riemann zeta function zeta(s) come in two different types. So-called "trivial zeros" occur at all negative even integers s=-2, -4, -6, ..., and "nontrivial ...

By way of analogy with the prime counting function pi(x), the notation pi_(a,b)(x) denotes the number of primes of the form ak+b less than or equal to x (Shanks 1993, pp. ...