Search Results for ""

Zarankiewicz's conjecture asserts that graph crossing number for a complete bipartite graph K_(m,n) is Z(m,n)=|_n/2_||_(n-1)/2_||_m/2_||_(m-1)/2_|, (1) where |_x_| is the ...

Roughly speaking, the metric tensor g_(ij) is a function which tells how to compute the distance between any two points in a given space. Its components can be viewed as ...

A primitive root of a prime p is an integer g such that g (mod p) has multiplicative order p-1 (Ribenboim 1996, p. 22). More generally, if GCD(g,n)=1 (g and n are relatively ...

Legendre showed that there is no rational algebraic function which always gives primes. In 1752, Goldbach showed that no polynomial with integer coefficients can give a prime ...

Smarandache sequences are any of a number of simply generated integer sequences resembling those considered in published works by Smarandache such as the consecutive number ...

Elder's theorem is a generalization of Stanley's theorem which states that the total number of occurrences of an integer k among all unordered partitions of n is equal to the ...

A hex number, also called a centered hexagonal number, is given by H_n = 1+6T_n (1) = 3n^2+3n+1, (2) where T_n=n(n+1)/2 is the nth triangular number and the indexing with ...

There are two identities known as Catalan's identity. The first is F_n^2-F_(n+r)F_(n-r)=(-1)^(n-r)F_r^2, where F_n is a Fibonacci number. Letting r=1 gives Cassini's ...

For every partition of all the points on a line into two nonempty sets such that no point of either lies between two points of the other, there is a point of one set which ...

Let F(n) be a family of partitions of n and let F(n,d) denote the set of partitions in F(n) with Durfee square of size d. The Durfee polynomial of F(n) is then defined as the ...