Search Results for ""

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 constant e is base of the natural logarithm. e is sometimes known as Napier's constant, although its symbol (e) honors Euler. e is the unique number with the property ...

An almost integer is a number that is very close to an integer. Near-solutions to Fermat's last theorem provide a number of high-profile almost integers. In the season 7, ...

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 ...

A cubic number is a figurate number of the form n^3 with n a positive integer. The first few are 1, 8, 27, 64, 125, 216, 343, ... (OEIS A000578). The protagonist Christopher ...

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 ...

The Euler-Mascheroni constant gamma, sometimes also called 'Euler's constant' or 'the Euler constant' (but not to be confused with the constant e=2.718281...) is defined as ...

In general, the external similitude center of two circles C_1=C(x_1,r_1) and C_2=C(x_2,r_2) with centers given in Cartesian coordinates is given by ...

There are two definitions of the Fermat number. The less common is a number of the form 2^n+1 obtained by setting x=1 in a Fermat polynomial, the first few of which are 3, 5, ...

Fermat's last theorem is a theorem first proposed by Fermat in the form of a note scribbled in the margin of his copy of the ancient Greek text Arithmetica by Diophantus. The ...