TOPICS
Search

Search Results for ""


501 - 510 of 13135 for Reynolds numberSearch Results
As shown by Schur (1916), the Schur number S(n) satisfies S(n)<=R(n)-2 for n=1, 2, ..., where R(n) is a Ramsey number.
For a subgroup H of a group G, the index of H, denoted (G:H), is the cardinal number of the set of left cosets of H in G (which is equal to the cardinal number of the set of ...
An element of an extension field of a field F which is not algebraic over F. A transcendental number is a complex number which is transcendental over the field Q of rational ...
The real part R[z] of a complex number z=x+iy is the real number not multiplying i, so R[x+iy]=x. In terms of z itself, R[z]=1/2(z+z^_), where z^_ is the complex conjugate of ...
A flexagon made by folding a strip into adjacent equilateral triangles. The number of states possible in a hexaflexagon is the Catalan number C_5=42.
The third prime number, which is also the second Fermat prime, the third Sophie Germain prime, and Fibonacci number F_4. It is an Eisenstein prime, but not a Gaussian prime, ...
For any real number r>=0, an irrational number alpha can be approximated by infinitely many rational fractions p/q in such a way that ...
The maximal independence polynomial I_G(x) for the graph G may be defined as the polynomial I_G(x)=sum_(k=i(G))^(alpha(G))s_kx^k, where i(G) is the lower independence number, ...
The maximal irredundance polynomial R_G(x) for the graph G may be defined as the polynomial R_G(x)=sum_(k=ir(G))^(IR(G))r_kx^k, where ir(G) is the (lower) irredundance ...
The maximal matching-generating polynomial M_G(x) for the graph G may be defined as the polynomial M_G(x)=sum_(k=nu_L(G))^(nu(G))m_kx^k, where nu_L(G) is the lower matching ...
1 ... 48|49|50|51|52|53|54 ... 1314 Previous Next

...