TOPICS
Search

Search Results for ""


781 - 790 of 1005 for complexity measureSearch Results
Define f(x_1,x_2,...,x_n) with x_i positive as f(x_1,x_2,...,x_n)=sum_(i=1)^nx_i+sum_(1<=i<=k<=n)product_(j=i)^k1/(x_j). (1) Then minf=3n-C+o(1) (2) as n increases, where the ...
Twenty golfers wish to play in foursomes for 5 days. Is it possible for each golfer to play no more than once with any other golfer? The answer is yes, and the following ...
For two random variates X and Y, the correlation is defined bY cor(X,Y)=(cov(X,Y))/(sigma_Xsigma_Y), (1) where sigma_X denotes standard deviation and cov(X,Y) is the ...
In the English language, the probability of encountering the rth most common word is given roughly by P(r)=0.1/r for r up to 1000 or so. The law breaks down for less frequent ...
The q-digamma function psi_q(z), also denoted psi_q^((0))(z), is defined as psi_q(z)=1/(Gamma_q(z))(partialGamma_q(z))/(partialz), (1) where Gamma_q(z) is the q-gamma ...
Define the nome by q=e^(-piK^'(k)/K(k))=e^(ipitau), (1) where K(k) is the complete elliptic integral of the first kind with modulus k, K^'(k)=K(sqrt(1-k^2)) is the ...
The Banach-Saks theorem is a result in functional analysis which proves the existence of a "nicely-convergent" subsequence for any sequence {f_n}={f_n}_(n in Z^*) of ...
It is always possible to "fairly" divide a cake among n people using only vertical cuts. Furthermore, it is possible to cut and divide a cake such that each person believes ...
A plot of the map winding number W resulting from mode locking as a function of Omega for the circle map theta_(n+1)=theta_n+Omega-K/(2pi)sin(2pitheta_n) (1) with K=1. (Since ...
The Gauss-Bonnet formula has several formulations. The simplest one expresses the total Gaussian curvature of an embedded triangle in terms of the total geodesic curvature of ...
1 ... 76|77|78|79|80|81|82 ... 101 Previous Next

...