Search Results for ""

The minimal enclosing circle problem, sometimes also known as the bomb problem, is the problem of finding the circle of smallest radius that contains a given set of points in ...

The minimum spanning tree of a weighted graph is a set of edges of minimum total weight which form a spanning tree of the graph. When a graph is unweighted, any spanning tree ...

Minkowski's conjecture states that every lattice tiling of R^n by unit hypercubes contains two hypercubes that meet in an (n-1)-dimensional face. Minkowski first considered ...

A modified spherical Bessel function of the first kind (Abramowitz and Stegun 1972), also called a "spherical modified Bessel function of the first kind" (Arfken 1985), is ...

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

L_nu(z) = (1/2z)^(nu+1)sum_(k=0)^(infty)((1/2z)^(2k))/(Gamma(k+3/2)Gamma(k+nu+3/2)) (1) = (2(1/2z)^nu)/(sqrt(pi)Gamma(nu+1/2))int_0^(pi/2)sinh(zcostheta)sin^(2nu)thetadtheta, ...

Draw three circles in the plane, none of which lies completely inside another, and the common external tangent lines for each pair. Then points of intersection of the three ...

A monomial is a product of positive integer powers of a fixed set of variables (possibly) together with a coefficient, e.g., x, 3xy^2, or -2x^2y^3z. A monomial can also be ...

Any method which solves a problem by generating suitable random numbers and observing that fraction of the numbers obeying some property or properties. The method is useful ...

The moth graph is the 6-vertex graph illustrated above. It is implemented in the Wolfram Language as GraphData["MothGraph"].