Search Results for ""

The problem of determining how many nonattacking kings can be placed on an n×n chessboard. For n=8, the solution is 16, as illustrated above (Madachy 1979). In general, the ...

The point Ko of concurrence in Kosnita theorem, i.e., the point of concurrence of the lines connecting the vertices A, B, and C of a triangle DeltaABC with the circumcenters ...

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

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

The Lucas polynomials are the w-polynomials obtained by setting p(x)=x and q(x)=1 in the Lucas polynomial sequence. It is given explicitly by ...

A minimum vertex cut of a graph is a vertex cut of smallest possible size. A vertex cut set of size 1 in a connected graph corresponds to an articulation vertex. The size of ...

The Moses circle is defined as the circle with center at the Brocard midpoint X_(39) that is tangent to the nine-point circle at the center of the Kiepert hyperbola X_(115). ...

Let a set of random variates X_1, X_2, ..., X_n have a probability function P(X_1=x_1,...,X_n=x_n)=(N!)/(product_(i=1)^(n)x_i!)product_(i=1)^ntheta_i^(x_i) (1) where x_i are ...

Murata's constant is defined as C_(Murata) = product_(p)[1+1/((p-1)^2)] (1) = 2.82641999... (2) (OEIS A065485), where the product is over the primes p. It can also be written ...

An odd number is an integer of the form n=2k+1, where k is an integer. The odd numbers are therefore ..., -3, -1, 1, 3, 5, 7, ... (OEIS A005408), which are also the gnomonic ...