Search Results for ""

The happy end problem, also called the "happy ending problem," is the problem of determining for n>=3 the smallest number of points g(n) in general position in the plane ...

The inverse sine is the multivalued function sin^(-1)z (Zwillinger 1995, p. 465), also denoted arcsinz (Abramowitz and Stegun 1972, p. 79; Harris and Stocker 1998, p. 307; ...

The number of equivalent hyperspheres in n dimensions which can touch an equivalent hypersphere without any intersections, also sometimes called the Newton number, contact ...

The least common multiple of two numbers a and b, variously denoted LCM(a,b) (this work; Zwillinger 1996, p. 91; Råde and Westergren 2004, p. 54), lcm(a,b) (Gellert et al. ...

The Lorenz attractor is an attractor that arises in a simplified system of equations describing the two-dimensional flow of fluid of uniform depth H, with an imposed ...

A magic hexagon of order n is an arrangement of close-packed hexagons containing the numbers 1, 2, ..., H_(n-1), where H_n is the nth hex number such that the numbers along ...

In 1803, Malfatti posed the problem of determining the three circular columns of marble of possibly different sizes which, when carved out of a right triangular prism, would ...

A k-matching in a graph G is a set of k edges, no two of which have a vertex in common (i.e., an independent edge set of size k). Let Phi_k be the number of k-matchings in ...

Given the Mertens function defined by M(n)=sum_(k=1)^nmu(k), (1) where mu(n) is the Möbius function, Stieltjes claimed in an 1885 letter to Hermite that M(x)x^(-1/2) stays ...

The points of intersection of the adjacent angle trisectors of the angles of any triangle DeltaABC are the polygon vertices of an equilateral triangle DeltaDEF known as the ...