Search Results for ""

The path covering number (or path-covering number; Slater 1972) of a graph G, variously denoted as summarized below, is the minimum number of vertex-disjoint paths that cover ...

There are at least 15 classes of convex pentagonal tilings, as illustrated above. The first five were discovered during investigations of German mathematician Karl Reinhardt ...

The pentagonal hexecontahedron is the 60-faced dual polyhedron of the snub dodecahedron A_8 (Holden 1971, p. 55). It is Wenninger dual W_(18). A tetrahedron 10-compound, cube ...

The pentagonal icositetrahedron is the 24-faced dual polyhedron of the snub cube A_7 and Wenninger dual W_(17). The mineral cuprite (Cu_2O) forms in pentagonal ...

A pentomino is a 5-polyomino. There are 12 free pentominoes, 18 one-sided pentominoes, and 63 fixed pentominoes. The twelve free pentominoes are known by the letters of the ...

A perfect power is a number n of the form m^k, where m>1 is a positive integer and k>=2. If the prime factorization of n is n=p_1^(a_1)p_2^(a_2)...p_k^(a_k), then n is a ...

A permutation group is a finite group G whose elements are permutations of a given set and whose group operation is composition of permutations in G. Permutation groups have ...

The problem in calculus of variations to find the minimal surface of a boundary with specified constraints (usually having no singularities on the surface). In general, there ...

The positive integers 216 and 12960000 appear in an obscure passage in Plato's The Republic. In this passage, Plato alludes to the fact that 216 is equal to 6^3, where 6 is ...

The triangle bounded by the polars of the vertices of a triangle DeltaABC with respect to a conic is called its polar triangle. The following table summarizes polar triangles ...