Search Results for ""

Let G=(V,E) be a (not necessarily simple) undirected edge-weighted graph with nonnegative weights. A cut C of G is any nontrivial subset of V, and the weight of the cut is ...

A minimum edge cover is an edge cover having the smallest possible number of edges for a given graph. The size of a minimum edge cover of a graph is known as the edge cover ...

A modular inverse of an integer b (modulo m) is the integer b^(-1) such that bb^(-1)=1 (mod m). A modular inverse can be computed in the Wolfram Language using PowerMod[b, ...

The direct sum of modules A and B is the module A direct sum B={a direct sum b|a in A,b in B}, (1) where all algebraic operations are defined componentwise. In particular, ...

The monster group is the highest order sporadic group M. It has group order |M| = (1) = (2) where the divisors are precisely the 15 supersingular primes (Ogg 1980). The ...

A generalization of the factorial and double factorial, n! = n(n-1)(n-2)...2·1 (1) n!! = n(n-2)(n-4)... (2) n!!! = n(n-3)(n-6)..., (3) etc., where the products run through ...

A plot of the cells on a grid satisfying bitwise XOR(a,b)<n for consecutive values of n=1, 2, .... It is thought that it was discovered by Jackson Wright on the RLE PDP-1 ...

NAND, also known as the Sheffer stroke, is a connective in logic equivalent to the composition NOT AND that yields true if any condition is false, and false if all conditions ...

NAND, also known as the Sheffer stroke, is a connective in logic equivalent to the composition NOT AND that yields true if any condition is false, and false if all conditions ...

A geometric construction, also called a verging construction, which allows the classical geometric construction rules to be bent in order to permit sliding of a marked ruler. ...