Search Results for ""
4771 - 4780 of 13135 for Simple probabilitySearch Results
Let the least term h of a sequence be a term which is smaller than all but a finite number of the terms which are equal to h. Then h is called the lower limit of the ...
The lower matching number of a graph is the minimum size of a maximal independent edge set. The (upper) matching number may be similarly defined as the largest size of an ...
For a given function f(x) over a partition of a given interval, the lower sum is the sum of box areas m^*Deltax_k using the infimum m of the function f(x) in each subinterval ...
A triangular matrix L of the form L_(ij)={a_(ij) for i>=j; 0 for i<j. (1) Written explicitly, L=[a_(11) 0 ... 0; a_(21) a_(22) ... 0; | | ... 0; a_(n1) a_(n2) ... a_(nn)]. ...
An equilateral parallelogram whose acute angles are 45 degrees. Sometimes, the restriction to 45 degrees is dropped, and it is required only that two opposite angles are ...
A method for constructing magic squares of odd order.
A two-dimensional map similar to the Hénon map but with the term -alphax_n^2 replaced by -alpha|x_n|. It is given by the equations x_(n+1) = 1-alpha|x_n|+y_n (1) y_(n+1) = ...
If every component L of X/O_(p^')(X) satisfies the "Schreler property," then L_(p^')(Y)<=L_(p^')(X) for every p-local subgroup Y of X, where L_(p^') is the p-layer.
h_t+(|h|^nh_(xxx))_x=0, where h(x,t) is the height of a film at position x and time t and n is a parameter characteristic of the surface forces.
The Lucas central circle is the circumcircle of the Lucas central triangle. The center, radius, and circle function appear to be complicated, and neither the center nor the ...
...
View search results from all Wolfram sites (45054 matches)

