Search Results for ""
1791 - 1800 of 5719 for Numbered Equation 6Search Results
The Lyons group is the sporadic group Ly of order |Ly| = 51765179004000000 (1) = 2^8·3^7·5^6·7·11·31·37·67. (2) It is implemented in the Wolfram Language as LyonsGroupLy[].
The McLaughlin group is the sporadic group McL of order |McL| = 898128000 (1) = 2^7·3^6·5^3·7·11. (2) It is implemented in the Wolfram Language as McLaughlinGroupMcL[].
2^(20)=1024^2=1048576 bytes. Although the term megabyte is almost universally used to refer to 1024^2 bytes, such usage is deprecated in favor of the standard SI naming ...
A constant appearing in formulas for the efficiency of the Euclidean algorithm, B = (12ln2)/(pi^2)[-1/2+6/(pi^2)zeta^'(2)]+C-1/2 (1) = 0.06535142... (2) (OEIS A143304), where ...
The polyhedron compound of the truncated octahedron and its dual, the tetrakis hexahedron. The compound can be constructed from a truncated octahedron of unit edge length by ...
In August 2002, M. Agrawal and colleagues announced a deterministic algorithm for determining if a number is prime that runs in polynomial time (Agrawal et al. 2004). While ...
A Boolean algebra is a mathematical structure that is similar to a Boolean ring, but that is defined using the meet and join operators instead of the usual addition and ...
Clean tile is a game investigated by Buffon (1777) in which players bet on the number of different tiles a thrown coin will partially cover on a floor that is regularly ...
A finite field is a field with a finite field order (i.e., number of elements), also called a Galois field. The order of a finite field is always a prime or a power of a ...
A perfect matching of a graph is a matching (i.e., an independent edge set) in which every vertex of the graph is incident to exactly one edge of the matching. A perfect ...
...
View search results from all Wolfram sites (314326 matches)

