Search Results for ""

The Hadwiger number of a graph G, variously denoted eta(G) (Zelinka 1976, Ivančo 1988) or h(G) (Stiebitz 1990), is the number of vertices in the largest complete minor of G ...

For every k>1, there exist only finite many pairs of powers (p,p^') with p and p^' natural numbers and k=p^'-p.

The number of equivalent hyperspheres in n dimensions which can touch an equivalent hypersphere without any intersections, also sometimes called the Newton number, contact ...

The conjecture that all integers >1 occur as a value of the totient valence function (i.e., all integers >1 occur as multiplicities). The conjecture was proved by Ford ...

The conjecture made by Belgian mathematician Eugène Charles Catalan in 1844 that 8 and 9 (2^3 and 3^2) are the only consecutive powers (excluding 0 and 1). In other words, ...

If m is an integer, then for every residue class r (mod m), there are infinitely many nonnegative integers n for which P(n)=r (mod m), where P(n) is the partition function P.

Given the Mertens function defined by M(n)=sum_(k=1)^nmu(k), (1) where mu(n) is the Möbius function, Stieltjes claimed in an 1885 letter to Hermite that M(x)x^(-1/2) stays ...

Based on a problem in particle physics, Dyson (1962abc) conjectured that the constant term in the Laurent series product_(1<=i!=j<=n)(1-(x_i)/(x_j))^(a_i) is the multinomial ...

Let the difference of successive primes be defined by d_n=p_(n+1)-p_n, and d_n^k by d_n^k={d_n for k=1; |d_(n+1)^(k-1)-d_n^(k-1)| for k>1. (1) N. L. Gilbreath claimed that ...

The uniformity conjecture postulates a relationship between the syntactic length of expressions built up from the natural numbers using field operations, exponentials, and ...