Search Results for ""

If J is a simple closed curve in R^2, then the Jordan curve theorem, also called the Jordan-Brouwer theorem (Spanier 1966) states that R^2-J has two components (an "inside" ...

Define the juggler sequence for a positive integer a_1=n as the sequence of numbers produced by the iteration a_(k+1)={|_a_k^(1/2)_| for even a_k; |_a_k^(3/2)_| for odd a_k, ...

A combinatorial conjecture formulated by Kneser (1955). It states that whenever the n-subsets of a (2n+k)-set are divided into k+1 classes, then two disjoint subsets end up ...

A grand unified theory of mathematics which includes the search for a generalization of Artin reciprocity (known as Langlands reciprocity) to non-Abelian Galois extensions of ...

The Lehmer cotangent expansion for which the convergence is slowest occurs when the inequality in the recurrence equation b_k>=b_(k-1)^2+b_(k-1)+1. (1) for ...

The Mordell conjecture states that Diophantine equations that give rise to surfaces with two or more holes have only finite many solutions in Gaussian integers with no common ...

A figurate number which is the sum of two consecutive pyramidal numbers, O_n=P_(n-1)+P_n=1/3n(2n^2+1). (1) The first few are 1, 6, 19, 44, 85, 146, 231, 344, 489, 670, 891, ...

Two losing gambling games can be set up so that when they are played one after the other, they become winning. There are many ways to construct such scenarios, the simplest ...

Dirac (1952) proved that if the minimum vertex degree delta(G)>=n/2 for a graph G on n>=3 nodes, then G contains a Hamiltonian cycle (Bollobás 1978, Komlós et al. 1996). In ...

The numbers of positive definite n×n matrices of given types are summarized in the following table. For example, the three positive eigenvalues 2×2 (0,1)-matrices are [1 0; 0 ...