For computer representation, see Integer (computer science). For the generalization in algebraic number theory, see Algebraic integer.
Algebraic structure → Group theory Group theory
Basic notions
Subgroup
Normal subgroup
Quotient group
(Semi-)direct product
Group homomorphisms
kernel
image
direct sum
wreath product
simple
finite
infinite
continuous
multiplicative
additive
cyclic
abelian
dihedral
nilpotent
solvable
action
Glossary of group theory
List of group theory topics
Finite groups
Cyclic group Zn
Symmetric group Sn
Alternating group An
Dihedral group Dn
Quaternion group Q
Cauchy's theorem
Lagrange's theorem
Sylow theorems
Hall's theorem
p-group
Elementary abelian group
Frobenius group
Schur multiplier
Classification of finite simple groups
cyclic
alternating
Lie type
sporadic
Discrete groups
Lattices
Integers ()
Free group
Modular groups
PSL(2, )
SL(2, )
Arithmetic group
Lattice
Hyperbolic group
Topological and Lie groups
Solenoid
Circle
General linear GL(n)
Special linear SL(n)
Orthogonal O(n)
Euclidean E(n)
Special orthogonal SO(n)
Unitary U(n)
Special unitary SU(n)
Symplectic Sp(n)
G2
F4
E6
E7
E8
Lorentz
Poincaré
Conformal
Diffeomorphism
Loop
Infinite dimensional Lie group
O(∞)
SU(∞)
Sp(∞)
Algebraic groups
Linear algebraic group
Reductive group
Abelian variety
Elliptic curve
v
t
e
An integer is the number zero (0), a positive natural number (1, 2, 3, etc.) or a negative integer (−1, −2, −3, etc.).[1] The negative numbers are the additive inverses of the corresponding positive numbers.[2] The set of all integers is often denoted by the boldface Z or blackboard bold .[3][4]
The set of natural numbers is a subset of , which in turn is a subset of the set of all rational numbers , itself a subset of the real numbers .[a] Like the set of natural numbers, the set of integers is countably infinite. An integer may be regarded as a real number that can be written without a fractional component. For example, 21, 4, 0, and −2048 are integers, while 9.75, 5+1/2, 5/4 and √2 are not.[8]
The integers form the smallest group and the smallest ring containing the natural numbers. In algebraic number theory, the integers are sometimes qualified as rational integers to distinguish them from the more general algebraic integers. In fact, (rational) integers are algebraic integers that are also rational numbers.
^Science and Technology Encyclopedia. University of Chicago Press. September 2000. p. 280. ISBN 978-0-226-74267-0.
^"Integers: Introduction to the concept, with activities comparing temperatures and money. | Unit 1". OER Commons.
^Cite error: The named reference earliest was invoked but never defined (see the help page).
^Peter Jephson Cameron (1998). Introduction to Algebra. Oxford University Press. p. 4. ISBN 978-0-19-850195-4. Archived from the original on 8 December 2016. Retrieved 15 February 2016.
^Partee, Barbara H.; Meulen, Alice ter; Wall, Robert E. (30 April 1990). Mathematical Methods in Linguistics. Springer Science & Business Media. pp. 78–82. ISBN 978-90-277-2245-4. The natural numbers are not themselves a subset of this set-theoretic representation of the integers. Rather, the set of all integers contains a subset consisting of the positive integers and zero which is isomorphic to the set of natural numbers.
^Wohlgemuth, Andrew (10 June 2014). Introduction to Proof in Abstract Mathematics. Courier Corporation. p. 237. ISBN 978-0-486-14168-8.
^Polkinghorne, John (19 May 2011). Meaning in Mathematics. OUP Oxford. p. 68. ISBN 978-0-19-162189-5.
^Prep, Kaplan Test (4 June 2019). GMAT Complete 2020: The Ultimate in Comprehensive Self-Study for GMAT. Simon and Schuster. ISBN 978-1-5062-4844-8.
Cite error: There are <ref group=lower-alpha> tags or {{efn}} templates on this page, but the references will not show without a {{reflist|group=lower-alpha}} template or {{notelist}} template (see the help page).
An integer is the number zero (0), a positive natural number (1, 2, 3, etc.) or a negative integer (−1, −2, −3, etc.). The negative numbers are the additive...
In computer programming, an integer overflow occurs when an arithmetic operation on integers attempts to create a numeric value that is outside of the...
natural numbers as the non-negative integers 0, 1, 2, 3, ..., while others define them as the positive integers 1, 2, 3, ... . Some authors acknowledge...
integer programming problem is a mathematical optimization or feasibility program in which some or all of the variables are restricted to be integers...
partition of a non-negative integer n, also called an integer partition, is a way of writing n as a sum of positive integers. Two sums that differ only...
decomposition of a positive integer into a product of integers. Every positive integer greater than 1 is either the product of two or more integer factors greater...
number theory, a Gaussian integer is a complex number whose real and imaginary parts are both integers. The Gaussian integers, with ordinary addition and...
number theory, an algebraic integer is a complex number that is integral over the integers. That is, an algebraic integer is a complex root of some monic...
mathematics, a divisor of an integer n , {\displaystyle n,} also called a factor of n , {\displaystyle n,} is an integer m {\displaystyle m} that may...
In mathematics, an integer sequence is a sequence (i.e., an ordered list) of integers. An integer sequence may be specified explicitly by giving a formula...
unknown variables are required to be integers, then the problem is called an integer programming (IP) or integer linear programming (ILP) problem. In...
In mathematics, the Eisenstein integers (named after Gotthold Eisenstein), occasionally also known as Eulerian integers (after Leonhard Euler), are the...
Artocarpus integer, commonly known as chempedak or cempedak, is a species of tree in the family Moraceae, in the same genus as breadfruit and jackfruit...
In number theory, two integers a and b are coprime, relatively prime or mutually prime if the only positive integer that is a divisor of both of them...
In mathematics, the n-dimensional integer lattice (or cubic lattice), denoted Z n {\displaystyle \mathbb {Z} ^{n}} , is the lattice in the Euclidean space...
In mathematics, modular arithmetic is a system of arithmetic for integers, where numbers "wrap around" when reaching a certain value, called the modulus...
mathematics, an almost integer (or near-integer) is any number that is not an integer but is very close to one. Almost integers may be considered interesting...
function (or greatest integer function) is the function that takes as input a real number x, and gives as output the greatest integer less than or equal...
In mathematics, the ring of integers of an algebraic number field K {\displaystyle K} is the ring of all algebraic integers contained in K {\displaystyle...
reporting many computations – especially when dividing two numbers in integer or fixed-point arithmetic; when computing mathematical functions such as...
theory, quadratic integers are a generalization of the usual integers to quadratic fields. Quadratic integers are algebraic integers of degree two, that...
An integer triangle or integral triangle is a triangle all of whose side lengths are integers. A rational triangle is one whose side lengths are rational...
equal to the sum of the only consecutive positive integers to also be prime numbers (2 + 3). In integer sequences, five is also the second Fermat prime...
(/ˈboʊzɒn/ /ˈboʊsɒn/) is a subatomic particle whose spin quantum number has an integer value (0, 1, 2, ...). Bosons form one of the two fundamental classes of...
The quantum Hall effect (or integer quantum Hall effect) is a quantized version of the Hall effect which is observed in two-dimensional electron systems...
data elements. The C language provides basic arithmetic types, such as integer and real number types, and syntax to build array and compound types. Headers...
This is a list of notable integer sequences with links to their entries in the On-Line Encyclopedia of Integer Sequences. OEIS core sequences Index to...
Global Information
