Search Results for ""

Let I(G) denote the set of all independent sets of vertices of a graph G, and let I(G,u) denote the independent sets of G that contain the vertex u. A fractional coloring of ...

The reversal of a positive integer abc...z is z...cba. The reversal of a positive integer n is implemented in the Wolfram Language as IntegerReverse[n]. A positive integer ...

The Gelfond-Schneider constant is the number 2^(sqrt(2))=2.66514414... (OEIS A007507) that is known to be transcendental by Gelfond's theorem. Both the Gelfand-Schneider ...

The ring of integers is the set of integers ..., -2, -1, 0, 1, 2, ..., which form a ring. This ring is commonly denoted Z (doublestruck Z), or sometimes I (doublestruck I). ...

A brute-force method of finding a divisor of an integer n by simply plugging in one or a set of integers and seeing if they divide n. Repeated application of trial division ...

A Thâbit ibn Kurrah prime, sometimes called a 321-prime, is a Thâbit ibn Kurrah number (i.e., a number of the form 3·2^n-1 for nonnegative integer n) that is prime. The ...

The first of the Hardy-Littlewood conjectures. The k-tuple conjecture states that the asymptotic number of prime constellations can be computed explicitly. In particular, ...

An acyclic graph is a graph having no graph cycles. Acyclic graphs are bipartite. A connected acyclic graph is known as a tree, and a possibly disconnected acyclic graph is ...

A Gaussian quadrature-like formula over the interval [-1,1] which has weighting function W(x)=x. The general formula is int_(-1)^1xf(x)dx=sum_(i=1)^nw_i[f(x_i)-f(-x_i)]. n ...

If the four points making up a quadrilateral are joined pairwise by six distinct lines, a figure known as a complete quadrangle results. A complete quadrangle is therefore a ...