TOPICS
Search

Search Results for ""


1691 - 1700 of 2496 for Simple GraphSearch Results
Let L be a nontrivial bounded lattice (or a complemented lattice, etc.). Then L is a tight lattice if every proper tolerance rho of L satisfies (0,a) in rho=>a=0, and dually ...
Triangle picking is the process of picking triangles at random within a given shape in the plane, in space, or in a higher dimension. The most natural definition of a random ...
Related to or being the mathematically most simple case. More generally, the word "trivial" is used to describe any result which requires little or no effort to derive or ...
A formal type of proof most frequently encountered in elementary geometry courses in which known or derived statements are written in the left column, and the reason that ...
A particle P is said to be undergoing uniform circular motion if its radius vector in appropriate coordinates has the form (x(t),y(t),0), where x(t) = Rcos(omegat) (1) y(t) = ...
The vierergruppe is the Abelian abstract group on four elements that is isomorphic to the finite group C2×C2 and the dihedral group D_2. The multiplication table of one ...
The White House switchboard constant is the name given by Munroe (2012) to the constant W = exp[-(1+8^(1/(e-1)))^(1/pi)] (1) = 0.202456141492... (2) (OEIS A182064), the first ...
A sequence of uncorrelated numbers alpha_n developed by Wiener (1926-1927). The numbers are constructed by beginning with {1,-1}, (1) then forming the outer product with ...
When p is a prime number, then a p-group is a group, all of whose elements have order some power of p. For a finite group, the equivalent definition is that the number of ...
Bridge is a card game played with a normal deck of 52 cards. The number of possible distinct 13-card hands is N=(52; 13)=635013559600, (1) where (n; k) is a binomial ...
1 ... 167|168|169|170|171|172|173 ... 250 Previous Next

...