Search Results for ""
3981 - 3990 of 6485 for Finite Group D 4Search Results
A relation R on a set S is reflexive provided that xRx for every x in S.
An open connected set is called a region (sometimes also called a domain).
A shift in phase.
Let a number n be written in binary as n=(epsilon_kepsilon_(k-1)...epsilon_1epsilon_0)_2, (1) and define b_n=sum_(i=0)^(k-1)epsilon_iepsilon_(i+1) (2) as the number of digits ...
A position in a game is safe for a player A if the person who plays next (player B) will lose.
A point at which two noncrossing branches of a curve meet with different tangents.
A formula is called satisfiable if it takes at least one true value in some interpretation.
Schmidt (1993) proposed the problem of determining if for any integer r>=2, the sequence of numbers {c_k^((r))}_(k=1)^infty defined by the binomial sums sum_(k=0)^n(n; ...
In the American system, 10^(54).
To multiply the size of a d-D object by a factor a, c=a^d copies are required, and the quantity d=(lnc)/(lna) is called the similarity dimension.
...
View search results from all Wolfram sites (352745 matches)

