natural number

ambiguous mathematical term used either for non-negative or for strictly positive integers, depending on usage

Uses your system voice; voice and rate in settings.

≈ 12 min read

Cite, export and learn8 citation formats · 8 exports · lesson and quiz

Names in other languages

  • Magyartermészetes szám
  • Polskiliczby naturalne
  • Englishnatural number
  • Españolnúmero natural
  • euzenbaki arrunt
  • bsprirodan broj
  • sqnumër natyror
  • uznatural son
  • 中文自然数

Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.

In mathematics, the natural numbers are the numbers used for counting up, starting from 0 or 1. The first few natural numbers are 0 (if included), 1, 2, 3, and so on. The terms positive integers, non-negative integers, whole numbers, and counting numbers are also used.

The set of the natural numbers is commonly denoted by a bold or a blackboard bold . The natural numbers are used for counting, and for labeling the result of a count, such as: "there are seven days in a week", in which case they are called cardinal numbers.

They are also used to label places in an ordered series, such as: "the third day of the month", in which case they are called ordinal numbers. Natural numbers are commonly expressed in writing using ten symbols called digits (0, 1, 2, 3, 4, 5, 6, 7, 8, 9).

These expressions, called numerals, can also be used as unique identifiers or labels (like the jersey numbers of a sports team) that are referred to as nominal numbers, which resemble natural numbers but have no specific mathematical properties. Natural numbers can be compared by magnitude, with larger numbers coming after smaller ones in the list 1, 2, 3, ....

This gives a total order on the natural numbers. Two basic arithmetic operations are defined on natural numbers: addition and multiplication.

However, the inverse operations, subtraction and division, only sometimes give natural-number results: subtracting a larger natural number from a smaller one results in a negative number and dividing one natural number by another commonly leaves a remainder. The most common number systems used throughout mathematics – the integers, rational numbers, real numbers, and complex numbers – contain the natural numbers, and are defined successively, one from the other, starting from the natural numbers.

Arithmetic is the study of the ways to perform basic operations on these number systems. Number theory is the study of the properties of these operations and their generalizations. Much of combinatorics involves counting mathematical objects, patterns and structures that are defined using natural numbers.

Intuitive concept

An intuitive and implicit understanding of natural numbers is developed through using numbers for counting, ordering and basic arithmetic. Within this are two closely related aspects of what a natural number is: the ; and .

Formal definitions

Formal definitions take the existing, intuitive notion of natural numbers together with the rules of arithmetic and define them both in the more fundamental terms of mathematical logic. Formal systems typically assume that the defining characteristic of natural numbers is their fixed order and establish this order using the primitive notion of a successor.

Every natural number has a successor, which is another unique natural number that it is followed by. Two standard formal definitions are based on the Peano axioms and set theory. The Peano axioms (named for Giuseppe Peano) do not explicitly define what the natural numbers , but instead comprise a list of statements or axioms that must be true of natural numbers, however they are defined.

In contrast, set theory defines each natural number as a particular set, in which a set can be generally understood as a collection of distinct objects or elements. While the two methods are different, they are consistent in that the natural number sets collectively the Peano axioms.

Peano axioms

The five Peano axioms are: is a natural number. Every natural number has a successor which is also a natural number. is not the successor of any natural number. If the successor of equals the successor of , then equals .

The axiom of induction: If a statement is true of , and if the truth of that statement for a number implies its truth for the successor of that number, then the statement is true for every natural number. These are not the original axioms published by Peano, but are named in his honor. Some forms of the Peano axioms have in place of .

In ordinary arithmetic, the successor of is .

Set-theoretic definition

In set theory each natural number is defined as a specific set. A variety of constructions have been proposed, however the standard solution (due to John von Neumann) is: Call , the empty set. Define the successor of any set by .

By the axiom of infinity, there exist sets which contain 0 and are closed under the successor function. Such sets are said to be inductive. The intersection of all inductive sets is still an inductive set.

This intersection is the set of the natural numbers. This produces an iterative definition of the natural numbers called the von Neumann ordinals: \begin{alignat}{2} 0 & && {} = \{\ \} && {} = \varnothing \\ 1 & = 0 \cup \{0\} && {} = \{0\} && = \{ \varnothing\} \\ 2 & = 1 \cup \{1\} && {} = \{0,1\} && {} = \{\varnothing,\{\varnothing\}\}\\ 3 & = 2 \cup \{2\} && {} = \{0,1,2\} && {} = \{\varnothing,\{\varnothing\},\{\varnothing,\{\varnothing\}\}\} \\ n & = n-1 \cup \{n-1\} && {} = \{0,1, ...,n-1\} && {} = \{\varnothing,\{\varnothing\},...,\{\varnothing,\{\varnothing\},...\}\}\\ \end{alignat} In this construction every natural number is a set containing elements, where each element is a natural number less than .

From this, the intuitive concepts of cardinality and order can be formally defined as: Cardinality: a set has elements if there is a one-to-one correspondence or bijection from to . Order: if and only if is a subset of . Another construction sometimes called defines and and is now largely only of historical interest.

Properties

This section uses the convention that is a natural number: .

Addition

Given the set \mathbb{N} of natural numbers and the successor function S \colon \mathbb{N} \to \mathbb{N} sending each natural number to the next one, addition ( ) is defined by: \begin{align} a + 0 & = a & \textrm{(1)}\\ a + S(b) & = S(a+b) & \textrm{(2)}\\ \end{align} In the statements above, (1) explicitly defines addition for the first natural number and (2) gives a recursive definition for each subsequent number in terms of previous definitions, as illustrated below. \begin{alignat}{2} & a + 1 = a + S(0) = S(a+0) = S(a) \\ & a + 2 = a + S(1) = S(a+1) = S(S(a)) \\ & a + 3 = a + S(2) = S(a+2) = S(S(S(a))) \end{alignat} In this way, addition can be seen as repeated application of the successor function. Intuitively, is evaluated by applying the successor function to as many times as it must be applied to to produce .

The algebraic structure (\mathbb{N}, +) is a commutative monoid with identity element  . It is a free monoid on one generator. This commutative monoid satisfies the cancellation property, so it can be embedded in a group.

The smallest group containing the natural numbers is the integers.

Multiplication

Analogously, given that addition has been defined, a multiplication operator \times can be defined via and . This turns (\mathbb{N}^*, \times) into a free commutative monoid with identity element 1; a generator set for this monoid is the set of prime numbers.

Relationship between addition and multiplication

In the natural numbers, addition and multiplication are compatible, which is expressed in the distribution law: . However \mathbb{N} is not closed under subtraction (that is, subtracting one natural from another does not always result in another natural); equivalently, one can say that \mathbb{N} lacks additive inverses.

These properties of addition and multiplication mean that \mathbb{N} is not a ring; instead it is a semiring (also known as a rig). Semirings are an algebraic generalization of rings where multiplication is not necessarily commutative, although multiplication in \mathbb{N} is commutative.

If the natural numbers are taken as "excluding 0", and "starting at 1", the definitions of + and × are as above, except that they begin with and . Furthermore, (\mathbb{N^*}, +) has no identity element.

Order

A total order on the natural numbers is defined by letting if and only if there exists another natural number where . This order is compatible with the arithmetical operations in the following sense: if , and are natural numbers and , then and . An important property of the natural numbers is that they are well-ordered: every non-empty set of natural numbers has a least element.

The rank among well-ordered sets is expressed by an ordinal number; for the natural numbers, this is denoted as (omega).

Division

While it is in general not possible to divide one natural number by another and get a natural number as result, the procedure of division with remainder or Euclidean division is available as a substitute: for any two natural numbers and with there are natural numbers and such that a = b \times q + r \text{ and } r The number is called the quotient and is called the remainder of the division of by  . The numbers and are uniquely determined by and  .

This Euclidean division is key to the several other properties (divisibility), algorithms (such as the Euclidean algorithm), and ideas in number theory.

Algebraic properties satisfied by the natural numbers

The addition (+) and multiplication (×) operations on natural numbers as defined above have several algebraic properties: Closure under addition and multiplication: for all natural numbers and , both and are natural numbers. Associativity: for all natural numbers , , and , and . Commutativity: for all natural numbers and , and .

Existence of identity elements: for every natural number , and . If the natural numbers are taken as "excluding 0", and "starting at 1", then for every natural number , . However, the "existence of additive identity element" property is not satisfied Distributivity of multiplication over addition for all natural numbers , , and , .

No nonzero zero divisors: if and are natural numbers such that , then or (or both).

History

For most of history, what are now called natural numbers were simply numbers. Between the late middle ages and end of the 17th century, the concept of number expanded to include negative, rational and irrational numbers, becoming what we now call the real numbers. With this came the need to distinguish between the original numbers and these new types.

Nicolas Chuquet used the term in 1484. The earliest known use of "natural number" as a complete English phrase is in 1763. The 1771 Encyclopaedia Britannica defines natural numbers in the logarithm article.

Formal construction

In 19th century Europe, there was mathematical and philosophical discussion about the exact nature of the natural numbers. Henri Poincaré stated that axioms can only be demonstrated in their finite application, and concluded that it is "the power of the mind" which allows conceiving of the indefinite repetition of the same act.

Leopold Kronecker summarized his belief as "God made the integers, all else is the work of man". The constructivists saw a need to improve upon the logical rigor in the foundations of mathematics. In the 1860s, Hermann Grassmann suggested a recursive definition for natural numbers, thus stating they were not really natural—but a consequence of definitions.

Later, two classes of such formal definitions emerged, using set theory and Peano's axioms respectively. Later still, they were shown to be equivalent in most practical applications. Set-theoretical definitions of natural numbers were initiated by Frege.

He initially defined a natural number as the class of all sets that are in one-to-one correspondence with a particular set. However, this definition turned out to lead to paradoxes, including Russell's paradox.

To avoid such paradoxes, the formalism was modified so that a natural number is defined as a particular set, and any set that can be put into one-to-one correspondence with that set is said to have that number of elements. In 1881, Charles Sanders Peirce provided the first axiomatization of natural-number arithmetic.

In 1888, Richard Dedekind proposed another axiomatization of natural-number arithmetic, and in 1889, Peano published a simplified version of Dedekind's axioms in his book The principles of arithmetic presented by a new method ( ). This approach is now called Peano arithmetic.

It is based on an axiomatization of the properties of ordinal numbers: each natural number has a successor and every non-zero natural number has a unique predecessor. Peano arithmetic is equiconsistent with several weak systems of set theory. One such system is ZFC with the axiom of infinity replaced by its negation.

Theorems that can be proved in ZFC but cannot be proved using the Peano Axioms include Goodstein's theorem.

Generalizations

The most common number systems used throughout mathematics are extensions of the natural numbers, in the sense that each of them contains a subset which has the same arithmetical structure. These number systems can also be formally defined in terms of natural numbers (though they need not be).

If the difference of every two natural numbers is considered to be a number, the result is the integers, which include zero and negative numbers. If the quotient of every two integers is considered to be a number, the result is the rational numbers, including fractions. If every infinite decimal is considered to be a number, the result is the real numbers.

If every solution of a polynomial equation is considered to be a number, the result is the complex numbers. Other generalizations of natural numbers are discussed in .

See also

Sequence – Function of the natural numbers in another set

Bibliography

– English translation of .

Text derived from https://en.wikipedia.org/w/index.php?oldid=1375965996 under CC BY-SA 4.0; modifications have been made.

Words in each sectionFormal constructionFormal constructionFormal construction: 352 words352Set-theoretic definitionSet-theoretic definitionSet-theoretic definition: 239 words239AdditionAdditionAddition: 203 words203Formal definitionsFormal definitionsFormal definitions: 166 words166GeneralizationsGeneralizationsGeneralizations: 137 words137Relationship between ad…Relationship between addition and multiplicationRelationship between addition and multiplication: 129 words129Algebraic properties sa…Algebraic properties satisfied by the natural numbersAlgebraic properties satisfied by the natural numbers: 113 words113Peano axiomsPeano axiomsPeano axioms: 109 words109DivisionDivisionDivision: 103 words103HistoryHistoryHistory: 94 words94OrderOrderOrder: 83 words83MultiplicationMultiplicationMultiplication: 42 words42Intuitive conceptIntuitive conceptIntuitive concept: 34 words34BibliographyBibliographyBibliography: 24 words24PropertiesPropertiesProperties: 10 words10See alsoSee alsoSee also: 9 words9
Words in each section. Measured from the stored article body; sections below the minimum are not plotted.

Provenance

snapshot natural-number-002558-fb92dd30c5bb8ad1 · hash fb92dd30c5bb8ad1f06ceca02f443673cc92a2cae2e7676f2751148d24a1f494 · captured 2026-09-21 · ledger · version history

Cite this page as: encyclopegia.org, “natural number”, snapshot natural-number-002558-fb92dd30c5bb8ad1. https://encyclopegia.org/a/natural-number

Sources cited in this revision

No external citation was extracted for this revision. That is a statement about the source, not a claim that none exists.