Search Results for ""

The four-color theorem states that any map in a plane can be colored using four-colors in such a way that regions sharing a common boundary (other than a single point) do not ...

Let f be a fractional coloring of a graph G. Then the sum of values of f is called its weight, and the minimum possible weight of a fractional coloring is called the ...

An independent vertex set of a graph G is a subset of the vertices such that no two vertices in the subset represent an edge of G. The figure above shows independent sets ...

An irrational number is a number that cannot be expressed as a fraction p/q for any integers p and q. Irrational numbers have decimal expansions that neither terminate nor ...

Let x be a real number, and let R be the set of positive real numbers mu for which 0<|x-p/q|<1/(q^mu) (1) has (at most) finitely many solutions p/q for p and q integers. Then ...

A repunit prime is a repunit (i.e., a number consisting of copies of the single digit 1) that is also a prime number. The base-10 repunit (possibly probable) primes ...

The Sierpiński sieve is a fractal described by Sierpiński in 1915 and appearing in Italian art from the 13th century (Wolfram 2002, p. 43). It is also called the Sierpiński ...

A strong pseudoprime to a base a is an odd composite number n with n-1=d·2^s (for d odd) for which either a^d=1 (mod n) (1) or a^(d·2^r)=-1 (mod n) (2) for some r=0, 1, ..., ...

A function tau(n) related to the divisor function sigma_k(n), also sometimes called Ramanujan's tau function. It is defined via the Fourier series of the modular discriminant ...

P(n), sometimes also denoted p(n) (Abramowitz and Stegun 1972, p. 825; Comtet 1974, p. 94; Hardy and Wright 1979, p. 273; Conway and Guy 1996, p. 94; Andrews 1998, p. 1), ...