coprime order
41Cyclic code — In coding theory, cyclic codes are linear block error correcting codes that have convenient algebraic structures for efficient error detection and correction. Contents 1 Definition 2 Algebraic structure 3 Examples …
42Finitely-generated abelian group — In abstract algebra, an abelian group (G,+) is called finitely generated if there exist finitely many elements x1,...,xs in G such that every x in G can be written in the form x = n1x1 + n2x2 + ... + nsxs with integers n1,...,ns. In this case, we …
43Sylow theorems — In mathematics, specifically group theory, the Sylow theorems, named after Ludwig Sylow, form a partial converse to Lagrange s theorem, which states that if H is a subgroup of a finite group G , then the order of H divides the order of G . The… …
44Seifert fiber space — A Seifert fiber space is a 3 manifold together with a nice decomposition as a disjoint union of circles. In other words it is a S^1 bundle (circle bundle) over a 2 dimensional orbifold. Most small 3 manifolds are Seifert fiber spaces, and they… …
45Shor's algorithm — Shor s algorithm, first introduced by mathematician Peter Shor, is a quantum algorithm for integer factorization. On a quantum computer, to factor an integer N, Shor s algorithm takes polynomial time in log{N}, specifically O((log{N})^3),… …
46Frobenius group — In mathematics, a Frobenius group is a transitive permutation group on a finite set, such that no non trivial elementfixes more than one point and some non trivial element fixes a point. They are named after F. G. Frobenius. Structure The… …
47Multiplicative group of integers modulo n — In modular arithmetic the set of congruence classes relatively prime to the modulus n form a group under multiplication called the multiplicative group of integers modulo n. It is also called the group of primitive residue classes modulo n. In… …
48On-Line Encyclopedia of Integer Sequences — URL oeis.org Created by Neil Sloane Launched 1996 ( …
49Countable set — Countable redirects here. For the linguistic concept, see Count noun. Not to be confused with (recursively) enumerable sets. In mathematics, a countable set is a set with the same cardinality (number of elements) as some subset of the set of… …
50Sieve of Eratosthenes — Sieve of Eratosthenes: algorithm steps for primes below 121 (including optimization of starting from prime s square). In mathematics, the sieve of Eratosthenes (Greek: κόσκινον Ἐρατοσθένους), one of a number of prime number sieves, is a simple,… …
