Search Results for ""

The Lemoine cubic is the triangle cubic with trilinear equation It passes through Kimberling centers X_n for n=3, 4, 32, 56, and 1147.

The Lemoine hexagon is a cyclic hexagon with vertices given by the six concyclic intersections of the parallels of a reference triangle through its symmedian point K. The ...

The Lemoine ellipse is an inconic (that is always an ellipse) that has inconic parameters x:y:z=(2(b^2+c^2)-a^2)/(bc):(2(a^2+c^2)-b^2)/(ac): (2(a^2+b^2)-c^2)/(ab). (1) The ...

Given the "peaks" of three equilateral triangles placed on the sides of a triangle T, construct T. The problem was proposed by Lemoine (1868) and solved for the general case ...

Let L denote the partition lattice of the set {1,2,...,n}. The maximum element of L is M={{1,2,...,n}} (1) and the minimum element is m={{1},{2},...,{n}}. (2) Let Z_n denote ...

The Leonard graph is a distance-regular graph on 288 vertices (Brouwer et al. 1989, p. 369) with intersection array {12,11,10,7;1,2,5,12}. It is however not ...

The Lester circle is the circle on which the circumcenter C, nine-point center N, and the first and second Fermat points X and X^' lie (Kimberling 1998, pp. 229-230). Besides ...

Consider a game where everyone in a classroom picks a number between 0 and 100. The person closest to half the average wins. Obviously, picking a number over 50 would be ...

The level set of a differentiable function f:R^n->R corresponding to a real value c is the set of points {(x_1,...,x_n) in R^n:f(x_1,...,x_n)=c}. For example, the level set ...

Levenberg-Marquardt is a popular alternative to the Gauss-Newton method of finding the minimum of a function F(x) that is a sum of squares of nonlinear functions, ...