Search Results for ""
3711 - 3720 of 6485 for Finite Group D 4Search Results
For every positive integer n, there exists a circle which contains exactly n lattice points in its interior. H. Steinhaus proved that for every positive integer n, there ...
If sets E and F are independent, then so are E and F^', where F^' is the complement of F (i.e., the set of all possible outcomes not contained in F). Let union denote "or" ...
A pairing function is a function that reversibly maps Z^*×Z^* onto Z^*, where Z^*={0,1,2,...} denotes nonnegative integers. Pairing functions arise naturally in the ...
R^- denotes the real negative numbers.
The Higman-Sims graph is the unique strongly regular graph on 100 nodes (Higman and Sims 1968, Brouwer 1983, Brouwer and Haemers 1993). It was also constructed independently ...
Iofinova and Ivanov (1985) showed that there exist exactly five bipartite cubic semisymmetric graphs whose automorphism groups preserves the bipartite parts and acts ...
In its original form, the Poincaré conjecture states that every simply connected closed three-manifold is homeomorphic to the three-sphere (in a topologist's sense) S^3, ...
The term "(a,b)-leaper" (sometimes explicitly called a "single-pattern leaper") describes a fairy chess piece such as a knight that may make moves which simultaneously change ...
alpha=1/Nsum_(i=1)^N|x_i-mu|=<|x_i-mu|>.
The Diophantine equation x^2+k=y^3, which is also an elliptic curve. The general equation is still the focus of ongoing study.
...
View search results from all Wolfram sites (352745 matches)

