Search Results for ""
921 - 930 of 13135 for Square Triangular NumberSearch Results
![](/common/images/search/spacer.gif)
In the field of percolation theory, the term percolation threshold is used to denote the probability which "marks the arrival" (Grimmett 1999) of an infinite connected ...
Let s_1, s_2, ... be an infinite series of real numbers lying between 0 and 1. Then corresponding to any arbitrarily large K, there exists a positive integer n and two ...
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, ...
The regular pentagon is the regular polygon with five sides, as illustrated above. A number of distance relationships between vertices of the regular pentagon can be derived ...
A real quantity having a value less than zero (<0) is said to be negative. Negative numbers are denoted with a minus sign preceding the corresponding positive number, i.e., ...
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 Errera graph is the 17-node planar graph illustrated above that tangles the Kempe chains in Kempe's algorithm and thus provides an example of how Kempe's supposed proof ...
A rook polynomial is a polynomial R_(m,n)(x)=sum_(k=0)^(min(m,n))r_kx^k (1) whose number of ways k nonattacking rooks can be arranged on an m×n chessboard. The rook ...
In general, an unresolved nth root, commonly involving a radical symbol RadicalBox[x, n], is known as a surd. However, the term surd or "surd expression" (e.g., Hardy 1967, ...
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, ...
![](/common/images/search/spacer.gif)
...