Search Results for ""

Given a simplex of unit content in Euclidean d-space, pick n>=d+1 points uniformly and independently at random, and denote the expected content of their convex hull by ...

The (complete) gamma function Gamma(n) is defined to be an extension of the factorial to complex and real number arguments. It is related to the factorial by Gamma(n)=(n-1)!, ...

The parametric equations for a catenary are x = t (1) y = acosh(t/a), (2) giving the evolute as x = t-a/2sinh((2t)/a) (3) y = 2acosh(t/(2a)). (4) For t>0, the evolute has arc ...

An ellipse intersects a circle in 0, 1, 2, 3, or 4 points. The points of intersection of a circle of center (x_0,y_0) and radius r with an ellipse of semi-major and ...

A cubic polyhedral graph is a graph that is both cubic and polyhedral. The numbers of cubical polyhedral graphs on n=2, 4, ... nodes are 0, 1, 1, 2, 5, 14, 50, 233, 1249, ... ...

Given a positive sequence {a_n}, sqrt(sum_(j=-infty)^infty|sum_(n=-infty; n!=j)^infty(a_n)/(j-n)|^2)<=pisqrt(sum_(n=-infty)^infty|a_n|^2), (1) where the a_ns are real and ...

A logarithmic singularity is a singularity of an analytic function whose main z-dependent term is of order O(lnz). An example is the singularity of the Bessel function of the ...

Neville's algorithm is an interpolation algorithm which proceeds by first fitting a polynomial of degree 0 through the point (x_k,y_k) for k=1, ..., n, i.e., P_k(x)=y_k. A ...

The numbers of eigenvalues that are positive, negative, or 0 do not change under a congruence transformation. Gradshteyn and Ryzhik (2000) state it as follows: when a ...

A statement which is rigorously known to be correct. A statement which is not true is called false, although certain statements can be proved to be rigorously undecidable ...