Search Results for ""

The Platonic solids, also called the regular solids or regular polyhedra, are convex polyhedra with equivalent faces composed of congruent convex regular polygons. There are ...

An arithmetic progression of primes is a set of primes of the form p_1+kd for fixed p_1 and d and consecutive k, i.e., {p_1,p_1+d,p_1+2d,...}. For example, 199, 409, 619, ...

A prime gap of length n is a run of n-1 consecutive composite numbers between two successive primes. Therefore, the difference between two successive primes p_k and p_(k+1) ...

The prime number theorem gives an asymptotic form for the prime counting function pi(n), which counts the number of primes less than some integer n. Legendre (1808) suggested ...

A graph is said to be regular of degree r if all local degrees are the same number r. A 0-regular graph is an empty graph, a 1-regular graph consists of disconnected edges, ...

Topology is the mathematical study of the properties that are preserved through deformations, twistings, and stretchings of objects. Tearing, however, is not allowed. A ...

A unit-distance graph is a distance graph having an embedding in the Euclidean plane (unit-distance embedding) in which vertices are distinct points and all edges are of ...

The Fibonacci numbers are the sequence of numbers {F_n}_(n=1)^infty defined by the linear recurrence equation F_n=F_(n-1)+F_(n-2) (1) with F_1=F_2=1. As a result of the ...

The 13 Archimedean solids are the convex polyhedra that have a similar arrangement of nonintersecting regular convex polygons of two or more different types arranged in the ...

The (lower) domination number gamma(G) of a graph G is the minimum size of a dominating set of vertices in G, i.e., the size of a minimum dominating set. This is equivalent ...