Search Results for ""

The smallest number of times u(K) a knot K must be passed through itself to untie it. Lower bounds can be computed using relatively straightforward techniques, but it is in ...

Consider three mutually tangent circles, and draw their inner Soddy circle. Then draw the inner Soddy circles of this circle with each pair of the original three, and ...

A Chaitin's constant, also called a Chaitin omega number, introduced by Chaitin (1975), is the halting probability of a universal prefix-free (self-delimiting) Turing ...

The Champernowne constant has decimal expansion C=0.1234567891011... (OEIS A033307). The Earls sequence (starting position of n copies of the digit n) for e is given for n=1, ...

The Church-Turing thesis (formerly commonly known simply as Church's thesis) says that any real-world computation can be translated into an equivalent computation involving a ...

The proposal originally made by Georg Cantor that there is no infinite set with a cardinal number between that of the "small" infinite set of integers aleph_0 and the "large" ...

Draw antiparallels through the symmedian point K. The points where these lines intersect the sides then lie on a circle, known as the cosine circle (or sometimes the second ...

The curl of a vector field, denoted curl(F) or del xF (the notation used in this work), is defined as the vector field having magnitude equal to the maximum "circulation" at ...

The distribution function D(x), also called the cumulative distribution function (CDF) or cumulative frequency function, describes the probability that a variate X takes on a ...

The Egyptian Mathematical Leather Roll (EMLR), dates to the Middle Kingdom, and was purchased in Egypt in 1858 by Henry Rhind, near the time when the Rhind papyrus was ...