Search Results for ""

The property of being continuous.

A statement, also known as an axiom, which is taken to be true without proof. Postulates are the basic structure from which lemmas and theorems are derived. The whole of ...

The phrase dependent percolation is used in two-dimensional discrete percolation to describe any general model in which the states of the various graph edges (in the case of ...

Combinatorial geometry is a blending of principles from the areas of combinatorics and geometry. It deals with combinations and arrangements of geometric objects and with ...

Ballantine's series is the series for pi given by pi=864sum_(n=0)^infty((n!)^24^n)/((2n+1)!325^(n+1)) +1824sum_(n=0)^infty((n!)^24^n)/((2n+1)!3250^(n+1))-20cot^(-1)239 ...

The distance polynomial is the characteristic polynomial of the graph distance matrix. The following table summarizes distance polynomials for some common classes of graphs. ...

The Diophantine equation sum_(j=1)^(m-1)j^n=m^n. Erdős conjectured that there is no solution to this equation other than the trivial solution 1^1+2^1=3^1, although this ...

Consider the Euclid numbers defined by E_k=1+p_k#, where p_k is the kth prime and p# is the primorial. The first few values of E_k are 3, 7, 31, 211, 2311, 30031, 510511, ... ...

Let X be a connected topological space. Then X is unicoherent provided that for any closed connected subsets A and B of X, if X=A union B, then A intersection B is connected. ...

The happy end problem, also called the "happy ending problem," is the problem of determining for n>=3 the smallest number of points g(n) in general position in the plane ...