Search Results for ""

An n-polyhedral graph (sometimes called a c-net) is a 3-connected simple planar graph on n nodes. Every convex polyhedron can be represented in the plane or on the surface of ...

An integer m such that if p|m, then p^2|m, is called a powerful number. There are an infinite number of powerful numbers, and the first few are 1, 4, 8, 9, 16, 25, 27, 32, ...

The rhombicosahedral graph, illustrated above, is the skeleton of the icosidodecadodecahedron, rhombicosahedron and rhombidodecadodecahedron. It will be implemented in a ...

Sociable numbers are numbers that result in a periodic aliquot sequence, where an aliquot sequence is the sequence of numbers obtained by repeatedly applying the restricted ...

A Wieferich prime is a prime p which is a solution to the congruence equation 2^(p-1)=1 (mod p^2). (1) Note the similarity of this expression to the special case of Fermat's ...

The line on which the orthocenter H, triangle centroid G, circumcenter O, de Longchamps point L, nine-point center N, and a number of other important triangle centers lie. ...

Geometry is the study of figures in a space of a given number of dimensions and of a given type. The most common types of geometry are plane geometry (dealing with objects ...

The smallest possible number of vertices a polyhedral nonhamiltonian graph can have is 11, and there exist 74 such graphs. The Goldner-Harary graph (Goldner and Harary 1975a, ...

A Keith number is an n-digit integer N>9 such that if a Fibonacci-like sequence (in which each term in the sequence is the sum of the n previous terms) is formed with the ...

The regular octahedron, often simply called "the" octahedron, is the Platonic solid with six polyhedron vertices, 12 polyhedron edges, and eight equivalent equilateral ...