Search Results for ""

Given a geometric sequence {a_1,a_1r,a_1r^2,...}, the number r is called the common ratio associated to the sequence.

A compact surface is a surface which is also a compact set. A compact surface has a triangulation with a finite number of triangles. The sphere and torus are compact.

The connected domination number of a connected graph G, denoted d(G), is the size of a minimum connected dominating set of a graph G. The maximum leaf number l(G) and ...

The cross number of a zero-system sigma={g_1,g_2,...,g_n} of G is defined as K(sigma)=sum_(i=1)^n1/(|g_i|) The cross number of a group G has two different definitions. 1. ...

The Dirichlet kernel D_n^M is obtained by integrating the number theoretic character e^(i<xi,x>) over the ball |xi|<=M, D_n^M=-1/(2pir)d/(dr)D_(n-2)^M.

A snark on 30 vertices with edge chromatic number 4. It is implemented in the Wolfram Language as GraphData["DoubleStarSnark"].

If an infinite number of points in the plane are all separated by integer distances, then all the points lie on a straight line.

A sequence {a_1,a_2,a_3,...} fulfils a given property eventually if it fulfils it from some point onward, or, more precisely, if the property is fulfilled by the subsequence ...

Fatou dust is a Fatou set for a point outside the underlying set. Such a set has zero area and has an infinite number of disconnected components.

The only whole number solution to the Diophantine equation y^3=x^2+2 is y=3, x=+/-5. This theorem was offered as a problem by Fermat, who suppressed his own proof.