Search Results for ""

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

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

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

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

Square line picking is the selection of pairs of points (corresponding to endpoints of a line segment) randomly placed inside a square. n random line segments can be picked ...

Picking two independent sets of points x and y from a unit uniform distribution and placing them at coordinates (x,y) gives points uniformly distributed over the unit square. ...

The number of cells in a generalized Chinese checkers board (or "centered" hexagram). Unlike the polygonal numbers, there is ambiguity in the case of the star numbers as to ...

Let X be a set of v>=3 elements together with a set B of 3-subset (triples) of X such that every 2-subset of X occurs in exactly one triple of B. Then B is called a Steiner ...