Search Results for ""

A conjecture concerning primes.

The Littlewood conjecture states that for any two real numbers x,y in R, lim inf_(n->infty)n|nx-nint(nx)||ny-nint(ny)|=0 where nint(z) denotes the nearest integer function. ...

Petersson considered the absolutely converging Dirichlet L-series phi(s)=product_(p)1/(1-c(p)p^(-s)+p^(2k-1)p^(-2s)). (1) Writing the denominator as ...

Seymour conjectured that a graph G of order n with minimum vertex degree delta(G)>=kn/(k+1) contains the kth graph power of a Hamiltonian cycle, generalizing Pósa's ...

The tau conjecture, also known as Ramanujan's hypothesis after its proposer, states that tau(n)∼O(n^(11/2+epsilon)), where tau(n) is the tau function. This was proven by ...

Let B_k be the kth Bernoulli number and consider nB_(n-1)=-1 (mod n), where the residues of fractions are taken in the usual way so as to yield integers, for which the ...

Goldbach's original conjecture (sometimes called the "ternary" Goldbach conjecture), written in a June 7, 1742 letter to Euler, states "at least it seems that every number ...

The bellows conjecture asserts that all flexible polyhedra keep a constant volume as they are flexed (Cromwell 1997). The conjecture was apparently proposed by Dennis ...

A pair of vertices (x,y) of a graph G is called an omega-critical pair if omega(G+xy)>omega(G), where G+xy denotes the graph obtained by adding the edge xy to G and omega(H) ...

Carmichael's conjecture asserts that there are an infinite number of Carmichael numbers. This was proven by Alford et al. (1994).