coprime elements
21Multiplicative order — In number theory, given an integer a and a positive integer n with gcd(a,n) = 1, the multiplicative order of a modulo n is the smallest positive integer k with ak ≡ 1 (mod n). The order of a modulo n is usually written ordn(a), or On(a). Contents …
22Chebotarev's density theorem — in algebraic number theory describes statistically the splitting of primes in a given Galois extension K of the field Q of rational numbers. Generally speaking, a prime integer will factor into several ideal primes in the ring of algebraic… …
23In-place matrix transposition — In place matrix transposition, also called in situ matrix transposition, is the problem of transposing an N imes M matrix in place in computer memory: ideally with O(1) (bounded) additional storage, or at most with additional storage much less… …
24Additive function — Different definitions exist depending on the specific field of application. Traditionally, an additive function is a function that preserves the addition operation:: f ( x + y ) = f ( x ) + f ( y )for any two elements x and y in the domain. An… …
25Spherical 3-manifold — In mathematics, a spherical 3 manifold M is a 3 manifold of the form M = S3 / Γ where Γ is a finite subgroup of SO(4) acting freely by rotations on the 3 sphere S3. All such manifolds are prime, orientable, and closed. Spherical 3 manifolds are… …
26Schur–Zassenhaus theorem — The Schur–Zassenhaus theorem is a theorem in group theory which states that if G is a finite group, and N is a normal subgroup whose order is coprime to the order of the quotient group G/N, then G is a semidirect product of N and G/N.An… …
27Local ring — In abstract algebra, more particularly in ring theory, local rings are certain rings that are comparatively simple, and serve to describe what is called local behaviour , in the sense of functions defined on varieties or manifolds, or of… …
28Dickson polynomial — In mathematics, the Dickson polynomials, denoted Dn(x,α), form a polynomial sequence studied by L. E. Dickson (1897). Over the complex numbers, Dickson polynomials are essentially equivalent to Chebyshev polynomials with a change of variable …
29Number theory — A Lehmer sieve an analog computer once used for finding primes and solving simple diophantine equations. Number theory is a branch of pure mathematics devoted primarily to the study of the integers. Number theorists study prime numbers (the… …
30Pythagorean theorem — See also: Pythagorean trigonometric identity The Pythagorean theorem: The sum of the areas of the two squares on the legs (a and b) equals the area of the square on the hypotenuse (c) …
