Search Results for ""

An even permutation is a permutation obtainable from an even number of two-element swaps, i.e., a permutation with permutation symbol equal to +1. For initial set {1,2,3,4}, ...

The unique even prime number 2. All other primes are odd primes. Humorously, that means 2 is the "oddest" prime of all. The sequence 2, 4, 6, 10, 14, 22, 26, 34, 38, ... ...

For any real alpha and beta such that beta>alpha, let p(alpha)!=0 and p(beta)!=0 be real polynomials of degree n, and v(x) denote the number of sign changes in the sequence ...

Gödel's first incompleteness theorem states that all consistent axiomatic formulations of number theory which include Peano arithmetic include undecidable propositions ...

A Goldbach number is a positive integer that is the sum of two odd primes (Li 1999). Let E(x) (the "exceptional set of Goldbach numbers") denote the number of even numbers ...

The kth power of a graph G is a graph with the same set of vertices as G and an edge between two vertices iff there is a path of length at most k between them (Skiena 1990, ...

A connected graph G is said to be t-tough if, for every integer k>1, G cannot be split into k different connected components by the removal of fewer than tk vertices. The ...

The number of elements in a group G, denoted |G|. If the order of a group is a finite number, the group is said to be a finite group. The order of an element g of a finite ...

The Hadwiger conjecture is a generalization of the four-color theorem which states that for any loopless graph G with h(G) the Hadwiger number and chi(G) the chromatic ...

Let n be an integer such that n>=lambda_1, where lambda=(lambda_1,lambda_2,...) is a partition of n=|lambda| if lambda_1>=lambda_2>=...>=0, where lambda_i are a sequence of ...