Search Results for ""
611 - 620 of 736 for COMPLEXITYSearch Results

The quintuple product identity, also called the Watson quintuple product identity, states (1) It can also be written (2) or (3) The quintuple product identity can be written ...
Following Ramanujan (1913-1914), write product_(k=1,3,5,...)^infty(1+e^(-kpisqrt(n)))=2^(1/4)e^(-pisqrt(n)/24)G_n (1) ...
The so-called reaching algorithm can solve the shortest path problem (i.e., the problem of finding the graph geodesic between two given nodes) on an m-edge graph in O(m) ...
Closed forms are known for the sums of reciprocals of even-indexed Lucas numbers P_L^((e)) = sum_(n=1)^(infty)1/(L_(2n)) (1) = sum_(n=1)^(infty)1/(phi^(2n)+phi^(-2n)) (2) = ...
The Reynolds transport theorem, also called simply the Reynolds theorem, is an important result in fluid mechanics that's often considered a three-dimensional analog of the ...
Let R be the class of expressions generated by 1. The rational numbers and the two real numbers pi and ln2, 2. The variable x, 3. The operations of addition, multiplication, ...
The S distribution is defined in terms of its distribution function F(x) as the solution to the initial value problem (dF)/(dx)=alpha(F^g-F^h), where F(x_0)=F_0 (Savageau ...
Regular tessellations of the plane by two or more convex regular polygons such that the same polygons in the same order surround each polygon vertex are called semiregular ...
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 ...

...