coprime order
1Order (group theory) — This article is about order in group theory. For order in other branches of mathematics, see Order (mathematics). For order in other disciplines, see Order. In group theory, a branch of mathematics, the term order is used in two closely related… …
2Order (number theory) — In number theory, the order of an element a pmod{n} is the smallest integer k such that a^k equiv 1pmod{n}. Note that the order is only defined when gcd(a,n) = 1, i.e. a and n are coprimes.By Euler s theorem, the order (mod n) must divide phi(n) …
3Multiplicative 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 …
4Abelian group — For other uses, see Abelian (disambiguation). Abelian group is also an archaic name for the symplectic group Concepts in group theory category of groups subgroups, normal subgroups group homomorphisms, kernel, image, quotient direct product,… …
5Central series — In mathematics, especially in the fields of group theory and Lie theory, a central series is a kind of normal series of subgroups or Lie subalgebras, expressing the idea that the commutator is nearly trivial. For groups, this is an explicit… …
6Transposable integer — A summary of this article appears in Repeating decimal. The digits of some specific integers permute or shift cyclically when they are multiplied by a number n. Examples are: 142857 × 3 = 428571 (shifts cyclically one place left) 142857 × 5 =… …
7Modular representation theory — is a branch of mathematics, and that part of representation theory that studies linear representations of finite group G over a field K of positive characteristic. As well as having applications to group theory, modular representations arise… …
8Euler's totient function — For other functions named after Euler, see List of topics named after Leonhard Euler. The first thousand values of φ(n) In number theory, the totient φ(n) of a positive integer n is defined to be the number of positive integers less than or equal …
9Prime number — Prime redirects here. For other uses, see Prime (disambiguation). A prime number (or a prime) is a natural number greater than 1 that has no positive divisors other than 1 and itself. A natural number greater than 1 that is not a prime number is… …
10Primitive root modulo n — In modular arithmetic, a branch of number theory, a primitive root modulo n is any number g with the property that any number coprime to n is congruent to a power of g (mod n ). That is, if g is a primitive root (mod n ) and gcd( a , n ) = 1,… …
