Search Results for ""

The Hanoi graph H_n corresponding to the allowed moves in the tower of Hanoi problem. The above figure shows the Hanoi graphs for small n. The Hanoi graph H_n can be ...

A bitangent is a line that is tangent to a curve at two distinct points. Aa general plane quartic curve has 28 bitangents in the complex projective plane. However, as shown ...

A fundamental system of logic based on the concept of a generalized function whose argument is also a function (Schönfinkel 1924). This mathematical discipline was ...

A special case of Apollonius' problem requiring the determination of a circle touching three mutually tangent circles (also called the kissing circles problem). There are two ...

In order to find integers x and y such that x^2=y^2 (mod n) (1) (a modified form of Fermat's factorization method), in which case there is a 50% chance that GCD(n,x-y) is a ...

A doubly stochastic matrix is a matrix A=(a_(ij)) such that a_(ij)>=0 and sum_(i)a_(ij)=sum_(j)a_(ij)=1 is some field for all i and j. In other words, both the matrix itself ...

According to Hardy and Wright (1979), the 44-digit Ferrier's prime determined to be prime using only a mechanical calculator, is the largest prime found before the days of ...

The simple continued fraction of the Golomb-Dickman constant lambda is [0; 1, 1, 1, 1, 1, 22, 1, 2, 3, 1, 1, 11, ...] (OEIS A225336). Note that this continued fraction ...

A connected graph is said to be highly irregular if the neighbors of each vertex have distinct vertex degrees. Highly irregular graphs exist on all orders except 3, 5 and 7, ...

An isolated singularity is a singularity for which there exists a (small) real number epsilon such that there are no other singularities within a neighborhood of radius ...