Search Results for ""

In combinatorial logic minimization, a device known as a Karnaugh map is frequently used. It is similar to a truth table, but the various variables are represented along two ...

An integer n which is tested to see if it divides a given number.

A cubic symmetric graph is a symmetric cubic (i.e., regular of order 3). Such graphs were first studied by Foster (1932). They have since been the subject of much interest ...

A Diophantine equation is an equation in which only integer solutions are allowed. Hilbert's 10th problem asked if an algorithm existed for determining whether an arbitrary ...

The automorphism group Co_1 of the Leech lattice modulo a center of order two is called "the" Conway group. There are 15 exceptional conjugacy classes of the Conway group. ...

The Fischer groups are the three sporadic groups Fi_(22), Fi_(23), and Fi_(24)^'. These groups were discovered during the investigation of 3-transposition groups. The Fischer ...

The Janko groups are the four sporadic groups J_1, J_2, J_3 and J_4. The Janko group J_2 is also known as the Hall-Janko group. The Janko groups are implemented in the ...

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[].

The primes with Legendre symbol (n/p)=1 (less than N=pi(d) for trial divisor d) which need be considered when using the quadratic sieve factorization method.

A factorization algorithm which works by expressing N as a quadratic form in two different ways. Then N=a^2+b^2=c^2+d^2, (1) so a^2-c^2=d^2-b^2 (2) (a-c)(a+c)=(d-b)(d+b). (3) ...