TOPICS
Search

Search Results for ""


831 - 840 of 8520 for 1Search Results
Suppose x_1<x_2<...<x_n are given positive numbers. Let lambda_1, ..., lambda_n>=0 and sum_(j=1)^(n)lambda_j=1. Then ...
Given a series of positive terms u_i and a sequence of finite positive constants a_i, let rho=lim_(n->infty)(a_n(u_n)/(u_(n+1))-a_(n+1)). 1. If rho>0, the series converges. ...
A marked point process with mark space E is a double sequence (T,Y)=((T_n)_(n>=1),(Y_n)_(n>=1)) of R^^^+-valued random variables and E^_-valued random variables Y_n defined ...
For triangles in the plane, AD·BE·CF=BD·CE·AF. (1) For spherical triangles, sinAD·sinBE·sinCF=sinBD·sinCE·sinAF. (2) This can be generalized to n-gons P=[V_1,...,V_n], where ...
Let a set of random variates X_1, X_2, ..., X_n have a probability function P(X_1=x_1,...,X_n=x_n)=(N!)/(product_(i=1)^(n)x_i!)product_(i=1)^ntheta_i^(x_i) (1) where x_i are ...
Polynomials O_n(x) that can be defined by the sum O_n(x)=1/4sum_(k=0)^(|_n/2_|)(n(n-k-1)!)/(k!)(1/2x)^(2k-n-1) (1) for n>=1, where |_x_| is the floor function. They obey the ...
Polynomials s_k(x;lambda,mu) which are a generalization of the Boole polynomials, form the Sheffer sequence for g(t) = (1+e^(lambdat))^mu (1) f(t) = e^t-1 (2) and have ...
Polynomials P_k(x) which form the Sheffer sequence for g(t) = (2t)/(e^t-1) (1) f(t) = (e^t-1)/(e^t+1) (2) and have generating function ...
A figurate number corresponding to a configuration of points which form a pyramid with r-sided regular polygon bases can be thought of as a generalized pyramidal number, and ...
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 ...
1 ... 81|82|83|84|85|86|87 ... 852 Previous Next

...