Search Results for ""
41 - 50 of 713 for Seifert conjectureSearch Results
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).
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 ...
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 the minimal length of an addition chain for a number n be denoted l(n). Then the Scholz conjecture, also called the Scholz-Brauer conjecture or Brauer-Scholz conjecture, ...
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 ...
...
View search results from all Wolfram sites (1501 matches)

