Search Results for ""

A problem also known as the points problem or unfinished game. Consider a tournament involving k players playing the same game repetitively. Each game has a single winner, ...

A correction which must be applied to the measured moments m_k obtained from normally distributed data which have been binned in order to obtain correct estimators mu^^_i for ...

The randomization of a deck of cards by repeated interleaving. More generally, a shuffle is a rearrangement of the elements in an ordered list. Shuffling by exactly ...

The Sierpiński carpet is the fractal illustrated above which may be constructed analogously to the Sierpiński sieve, but using squares instead of triangles. It can be ...

There are several fractal curves associated with Sierpiński. The area for the first Sierpiński curve illustrated above (Sierpiński curve 1912) is A=1/3(7-4sqrt(2)). The curve ...

As proved by Sierpiński (1960), there exist infinitely many positive odd numbers k such that k·2^n+1 is composite for every n>=1. Numbers k with this property are called ...

A process of successively crossing out members of a list according to a set of rules such that only some remain. The best known sieve is the sieve of Eratosthenes for ...

In the IEEE 754-2008 standard (referred to as IEEE 754 henceforth), a signaling NaN or sNaN is a NaN which is signaling in the sense of being most commonly returned in ...

The term "similarity transformation" is used either to refer to a geometric similarity, or to a matrix transformation that results in a similarity. A similarity ...

A simple continued fraction is a special case of a generalized continued fraction for which the partial numerators are equal to unity, i.e., a_n=1 for all n=1, 2, .... A ...