Search Results for ""

A perfect ruler also called a complete ruler, is type of ruler considered by Guy (1994) which has k distinct marks spaced such that the distances between marks can be used to ...

A polyomino-like object made by attaching squares joined either at sides or corners. Because neighboring squares can be in relation to one another as kings may move on a ...

A pseudotree is a connected pseudoforest, i.e., an undirected connected graph that contains at most one graph cycle. Connected acyclic graphs (i.e., trees), are therefore ...

Given a series of positive terms u_i and a sequence of positive constants {a_i}, use Kummer's test rho^'=lim_(n->infty)(a_n(u_n)/(u_(n+1))-a_(n+1)) (1) with a_n=n, giving ...

The Riemann-Siegel integral formula is the following representation of the xi-function xi(s) found in Riemann's Nachlass by Bessel-Hagen in 1926 (Siegel 1932; Edwards 2001, ...

The Steenrod algebra has to do with the cohomology operations in singular cohomology with integer mod 2 coefficients. For every n in Z and i in {0,1,2,3,...} there are ...

Color each segment of a knot diagram using one of three colors. If 1. At any crossing, either the colors are all different or all the same, and 2. At least two colors are ...

A unicyclic graph is a connected graph containing exactly one cycle (Harary 1994, p. 41). A connected unicyclic graph is therefore a pseudotree that is not a tree. ...

Given an n-dimensional vector x=[x_1; x_2; |; x_n], (1) a general vector norm |x|, sometimes written with a double bar as ||x||, is a nonnegative norm defined such that 1. ...

The probability of getting at least one "6" in four rolls of a single 6-sided die is 1-(5/6)^4 approx 0.5177, (1) which is slightly higher than the probability of at least ...