Search Results for ""
1501 - 1510 of 13134 for complexity theorySearch Results
A quadratic field Q(sqrt(D)) with D>0.
A relation R on a set S is reflexive provided that xRx for every x in S.
A reflexive relation.
The least positive integer m^* with the property that chi(y)=1 whenever y=1 (mod m^*) and (y,m)=1.
Euclidean n-space is denoted R^n.
A position in a game is safe for a player A if the person who plays next (player B) will lose.
The modular equation of degree five can be written (u/v)^3+(v/u)^3=2(u^2v^2-1/(u^2v^2)).
A property of finite simple groups which is known for all such groups.
A p-element x of a group G is semisimple if E(C_G(x))!=1, where E(H) is the commuting product of all components of H and C_G(x) is the centralizer of G.
In the American system, 10^(54).
...
View search results from all Wolfram sites (28442 matches)

