TOPICS
Search

Search Results for ""


9711 - 9720 of 13135 for Simple probabilitySearch Results
Given the generating functions defined by (1+53x+9x^2)/(1-82x-82x^2+x^3) = sum_(n=1)^(infty)a_nx^n (1) (2-26x-12x^2)/(1-82x-82x^2+x^3) = sum_(n=0)^(infty)b_nx^n (2) ...
The ramp function is defined by R(x) = xH(x) (1) = int_(-infty)^xH(x^')dx^' (2) = int_(-infty)^inftyH(x^')H(x-x^')dx^' (3) = H(x)*H(x), (4) where H(x) is the Heaviside step ...
Ramsey's theorem is a generalization of Dilworth's lemma which states for each pair of positive integers k and l there exists an integer R(k,l) (known as the Ramsey number) ...
The Randić energy of a graph is defined as the graph energy of its Randić matrix, i.e., the sum of the absolute values of the eigenvalues of its Randić matrix.
The Randić index of a graph is defined as half the sum of the matrix elements of its Randić matrix. While the index was introduced to model the branching of the carbon-atom ...
The Randić spectral radius rho_(Randic) of a graph is defined as the largest eigenvalue of its Randić matrix.
A random permutation is a permutation containing a fixed number n of a random selection from a given set of elements. There are two main algorithms for constructing random ...
A random polygon is a polygon generated in some random way. Kendall conjectured that the shape of a random polygon is close to a disk as the area of the polygon becomes large ...
If the rank polynomial R(x,y) of a graph G is given by sumrho_(rs)x^ry^s, then rho_(rs) is the number of subgraphs of G with rank r and co-rank s, and the matrix (rho_(rs)) ...
Let u_k be a series with positive terms and suppose rho=lim_(k->infty)(u_(k+1))/(u_k). Then 1. If rho<1, the series converges. 2. If rho>1 or rho=infty, the series diverges. ...
1 ... 969|970|971|972|973|974|975 ... 1314 Previous Next

...