Search Results for ""

If a number fails Miller's primality test for some base a, it is not a prime. If the number passes, it may be a prime. A composite number passing Miller's test is called a ...

Let G=(V,E) be a (not necessarily simple) undirected edge-weighted graph with nonnegative weights. A cut C of G is any nontrivial subset of V, and the weight of the cut is ...

A minimal dominating set is a dominating set in a graph that is not a proper subset of any other dominating set. Every minimum dominating set is a minimal dominating set, but ...

A minimum edge cover is an edge cover having the smallest possible number of edges for a given graph. The size of a minimum edge cover of a graph is known as the edge cover ...

Let five circles with concyclic centers be drawn such that each intersects its neighbors in two points, with one of these intersections lying itself on the circle of centers. ...

Given a point P and a triangle DeltaABC, the Miquel triangle is the triangle DeltaP_AP_BP_C connecting the side points P_A, P_B, and P_C of DeltaABC with respect to which M ...

Consider a convex pentagon and extend the sides to a pentagram. Externally to the pentagon, there are five triangles. Construct the five circumcircles. Each pair of adjacent ...

Let V=R^k be a k-dimensional vector space over R, let S subset V, and let W={w in V:w·n^^=0} be a subspace of V of dimension k-1, where n^^ is a unit normal vector of W. Then ...

Model theory is a general theory of interpretations of axiomatic set theory. It is the branch of logic studying mathematical structures by considering first-order sentences ...

The unique 8_3 configuration. It is transitive and self-dual, but cannot be realized in the real projective plane. Its Levi graph is the Möbius-Kantor graph.