Search Results for ""

An n-tuple, sometimes simply called a "tuple" when the number n is known implicitly, is another word for a list, i.e., an ordered set of n elements. It can be interpreted as ...

Let v be a n-vector whose entries are each 1 (with probability p) or 0 (with probability q=1-p). An s-run is an isolated group of s consecutive 1s. Ignoring the boundaries, ...

A number of interesting graphs are associated with the work of van Cleemput and Zamfirescu (2018). Two 13- and 15-node graphs, denoted alpha and beta respectively, were used ...

Chebyshev noticed that the remainder upon dividing the primes by 4 gives 3 more often than 1, as plotted above in the left figure. Similarly, dividing the primes by 3 gives 2 ...

A property of motion which is conserved to exponential accuracy in the small parameter representing the typical rate of change of the gross properties of the body.

Two figures are said to be similar when all corresponding angles are equal, and are inversely similar when all corresponding angles are equal and described in the opposite ...

A mensuration formula is simply a formula for computing the length-related properties of an object (such as area, circumradius, etc., of a polygon) based on other known ...

Sylvester's four-point problem asks for the probability q(R) that four points chosen at random in a planar region R have a convex hull which is a quadrilateral (Sylvester ...

The tower of Hanoi (commonly also known as the "towers of Hanoi"), is a puzzle invented by E. Lucas in 1883. It is also known as the Tower of Brahma puzzle and appeared as an ...

A clique of a graph G is a complete subgraph of G, and the clique of largest possible size is referred to as a maximum clique (which has size known as the (upper) clique ...