Search Results for ""

A simple directed graph is a directed graph having no multiple edges or graph loops (corresponding to a binary adjacency matrix with 0s on the diagonal). The number of simple ...

Given a simplex of unit content in Euclidean d-space, pick n>=d+1 points uniformly and independently at random, and denote the expected content of their convex hull by ...

Smale's problems are a list of 18 challenging problems for the twenty-first century proposed by Field medalist Steven Smale. These problems were inspired in part by Hilbert's ...

"The" Smarandache constant is the smallest solution to the generalized Andrica's conjecture, x approx 0.567148 (OEIS A038458). The first Smarandache constant is defined as ...

Smarandache sequences are any of a number of simply generated integer sequences resembling those considered in published works by Smarandache such as the consecutive number ...

A Smith number is a composite number the sum of whose digits is the sum of the digits of its prime factors (excluding 1). (The primes are excluded since they trivially ...

Ramanujan calculated mu=1.45136380... (Hardy 1999, Le Lionnais 1983, Berndt 1994), while the correct value is mu=1.45136923488... (OEIS A070769; Derbyshire 2004, p. 114). The ...

Somos's quadratic recurrence constant is defined via the sequence g_n=ng_(n-1)^2 (1) with g_0=1. This has closed-form solution ...

A spectral sequence is a tool of homological algebra that has many applications in algebra, algebraic geometry, and algebraic topology. Roughly speaking, a spectral sequence ...

The sporadic groups are the 26 finite simple groups that do not fit into any of the four infinite families of finite simple groups (i.e., the cyclic groups of prime order, ...