Search Results for ""

The Euler-Mascheroni constant gamma=0.577215664901532860606512090082402431042... (OEIS A001620) was calculated to 16 digits by Euler in 1781 and to 32 decimal places by ...

The sum-of-factorial powers function is defined by sf^p(n)=sum_(k=1)^nk!^p. (1) For p=1, sf^1(n) = sum_(k=1)^(n)k! (2) = (-e+Ei(1)+pii+E_(n+2)(-1)Gamma(n+2))/e (3) = ...

The function frac(x) giving the fractional (noninteger) part of a real number x. The symbol {x} is sometimes used instead of frac(x) (Graham et al. 1994, p. 70; Havil 2003, ...

The generalized Petersen graph GP(n,k), also denoted P(n,k) (Biggs 1993, p. 119; Pemmaraju and Skiena 2003, p. 215), for n>=3 and 1<=k<=|_(n-1)/2_| is a connected cubic graph ...

A hash function H projects a value from a set with many (or even an infinite number of) members to a value from a set with a fixed number of (fewer) members. Hash functions ...

A graph G is said to be locally X, where X is a graph (or class of graphs), when for every vertex v, the graph induced on G by the set of adjacent vertices of V (sometimes ...

A Mrs. Perkins's quilt is a dissection of a square of side n into a number of smaller squares. The name "Mrs. Perkins's Quilt" comes from a problem in one of Dudeney's books, ...

The natural logarithm of 2 is a transcendental quantity that arises often in decay problems, especially when half-lives are being converted to decay constants. ln2 has ...

A primality test is a test to determine whether or not a given number is prime, as opposed to actually decomposing the number into its constituent prime factors (which is ...

The smallest cubic graphs with graph crossing number CN(G)=n have been termed "crossing number graphs" or n-crossing graphs by Pegg and Exoo (2009). The n-crossing graphs are ...