Search Results for ""
651 - 660 of 2089 for Eulers Polygon Division ProblemSearch Results
An Euler number prime is an Euler number E_n such that the absolute value |E_n| is prime (the absolute value is needed since E_n takes on alternating positive and negative ...
A square array made by combining n objects of two types such that the first and second elements form Latin squares. Euler squares are also known as Graeco-Latin squares, ...
Euler's continued fraction is the name given by Borwein et al. (2004, p. 30) to Euler's formula for the inverse tangent, ...
A compact manifold admits a Lorentzian structure iff its Euler characteristic vanishes. Therefore, every noncompact manifold admits a Lorentzian structure.
The index of a vector field with finitely many zeros on a compact, oriented manifold is the same as the Euler characteristic of the manifold.
How can n points be distributed on a unit sphere such that they maximize the minimum distance between any pair of points? This maximum distance is called the covering radius, ...
Conway's soldiers, also known as the "solitaire army" game (Berlekamp et al. 1982) or "checker-jumping problem" (Honsberger 1976) is a one-player game played on an infinite ...
A Kirkman triple system of order v=6n+3 is a Steiner triple system with parallelism (Ball and Coxeter 1987), i.e., one with the following additional stipulation: the set of ...
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 ...
A pseudoperfect number, sometimes also called a semiperfect number (Benkoski 1972, Butske et al. 1999), is a positive integer such as 20=1+4+5+10 which is the sum of some (or ...
...
View search results from all Wolfram sites (162574 matches)

