Natural number explained

In mathematics, the natural numbers are the numbers 0, 1, 2, 3, and so on, possibly excluding 0.[1] The terms positive integers, non-negative integers, whole numbers, and counting numbers are also used.[2] [3] 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 can also be used to label, like the jersey numbers of a sports team; in this case, they have no specific mathematical properties and are called nominal numbers.[4]

Natural numbers can be compared by magnitude, with larger numbers coming after smaller ones in the list 1, 2, 3, .... Two basic arithmetical 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 can be formally defined in terms of natural numbers.[5] [6]

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.

Terminology and notation

The term natural numbers has two common definitions: either or . Because there is no universal convention, the definition can be chosen to suit the context of use.[7] To eliminate ambiguity, the sequences and are often called the positive integers and the non-negative integers, respectively.

The phrase whole numbers is frequently used for the natural numbers that include 0, although it may also mean all integers, positive and negative.[8] In primary education, counting numbers usually refer to the natural numbers starting at 1, though this definition can vary.[9]

The set of all natural numbers is typically denoted or in blackboard bold as

N.

[10] Whether 0 is included is often determined by the context but may also be specified by using

N

or

Z

(the set of all integers) with a subscript or superscript. Examples include

N1

,[11] or

Z+

[12] (for the set starting at 1) and

N0

[13] or

Z0+

[14] (for the set including 0).

Intuitive concept

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

Size of a collection

Natural numbers can be used to answer questions like: "how many apples are on the table?".[15] A natural number used in this way describes a characteristic of a collection of objects. This characteristic, the size of a collection is called cardinality and a natural number used to describe or measure it is called a cardinal number.Two collections have the same size or cardinality if they have a one-to-one correspondence, meaning the objects can be arranged in pairs (one from each collection), with every object in exactly one pair. For example, in the adjacent image every apple is paired with exactly one orange and every orange is paired with exactly one apple. From this, even without counting or using numbers it can be seen that the group of apples has the same cardinality as the group of oranges, meaning they are both assigned the same cardinal number. Specifically, the natural number 3 is the cardinal number of both, and of any other collection that could be paired off in the same way to either of them.

If two collections do not have the same cardinality, pairing will leave one of the collections with objects that are unpaired and this can be used to define a size relationship between them. The collection in which all objects are paired is said to be "smaller" and the one left with unpaired objects "larger", than the other.

Position in a sequence

Taken together the natural numbers form an infinite sequence, meaning they have a fixed order, specific starting point and no end point, which is the familiar sequence beginning with 1, 2, 3, and so on indefinitely. A natural number can be used to denote a specific position in any other sequence, in which case it is called an ordinal number.[16] To have a specific position in a sequence means to come either before or after every other position in the sequence in a defined way, which is the concept of order.

The natural number 3 then is the thing that comes after 2 and 1, and before 4, 5 and so on. The number 2 is the thing that comes after 1, and 1 is the first element in the sequence. Each number represents the relation that position bears to the rest of the infinite sequence.[17]

Use of natural numbers

Natural numbers are used for counting and the four basic operations of arithmetic: addition; subtraction; multiplication; and division.

Counting

Counting is the process of iterating through a sequence of natural numbers in order starting at 1. It can be performed using numbers alone (as in "counting to 10"), or by applying the count to objects (as in "counting the students in the class").

When applied to a collection of objects, counting determines the cardinality of the collection by establishing a one-to-one correspondence between the objects and the natural numbers. This involves consecutively "tagging" each object with a number while maintaining a running partition of the tagged objects from those not yet tagged. The numbers must be assigned in order starting at 1 (hence they are ordinal numbers) but the order of the objects chosen is arbitrary as long as each object receives one and only one number. The cardinality principle is the understanding that the ordinal number assigned to the final object gives the result of the count, which is the cardinal number of the collection.

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[18] 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 are, 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 satisfy the Peano axioms.

Peano axioms

See main article: Peano axioms.

The five Peano axioms are:[19]

  1. 0 is a natural number.
  2. Every natural number has a successor which is also a natural number.
  3. 0 is not the successor of any natural number.
  4. If the successor of

x

equals the successor of

y

, then

x

equals

y

.
  1. The axiom of induction: If a statement is true of 0, 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 1 in place of 0. In ordinary arithmetic, the successor of

x

is

x+1

.

Set-theoretic definition

See main article: Set-theoretic definition of natural numbers.

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:

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:

Another construction sometimes called defines and and is now largely only of historical interest.

Properties

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

N=N0

.

Addition

Given the set

N

of natural numbers and the successor function

S\colonN\toN

sending each natural number to the next one, addition (

+

) is defined by:

\begin{align} a+0&=a&rm{(1)}\  a+S(b)&=S(a+b)&rm{(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 .

(N,+)

is a commutative monoid with identity element 0. 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

x

can be defined via and . This turns

(N*, x )

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

Addition and multiplication are compatible, which is expressed in the distribution law: . These properties of addition and multiplication make the natural numbers an instance of a commutative semiring. Semirings are an algebraic generalization of the natural numbers where multiplication is not necessarily commutative. The lack of additive inverses, which is equivalent to the fact that

N

is not closed under subtraction (that is, subtracting one natural from another does not always result in another natural), means that

N

is not a ring; instead it is a semiring (also known as a rig).

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,

(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 x q+randr<b.

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:

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.[23]

Nicolas Chuquet used the term progression naturelle (natural progression) in 1484.[24] The earliest known use of "natural number" as a complete English phrase is in 1763.[25] [26] 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.[27] 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.[28] [29] In 1888, Richard Dedekind proposed another axiomatization of natural-number arithmetic,[30] and in 1889, Peano published a simplified version of Dedekind's axioms in his book The principles of arithmetic presented by a new method (la|[[Arithmetices principia, nova methodo exposita]]). 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.[31] Theorems that can be proved in ZFC but cannot be proved using the Peano Axioms include Goodstein's theorem.[32]

Zero as natural number

Starting at 0 or 1 has long been a matter of definition. In 1727, Bernard Le Bovier de Fontenelle wrote that his notions of distance and element led to defining the natural numbers as including or excluding 0.[33] In 1889, Giuseppe Peano used N for the positive integers and started at 1,[34] but he later changed to using N0 and N1.[35] Historically, most definitions have excluded 0,[36] [37] but many mathematicians such as George A. Wentworth, Bertrand Russell, Nicolas Bourbaki, Paul Halmos, Stephen Cole Kleene, and John Horton Conway have preferred to include 0.[38] This approach gained wider adoption in the 1960s and was formalized in ISO 31-11 (1978), which defines natural numbers to include zero, a convention retained in the current ISO 80000-2 standard.[39]

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

Bibliography

External links

Notes and References

  1. Book: Enderton . Herbert B. . Elements of set theory . 1977 . Academic Press . New York . 0122384407 . 66.
  2. Book: Cooke . Heather . Primary Mathematics . 26 October 2000 . SAGE . 978-1-84787-949-3 . 14 . en.
  3. Book: Zegarelli . Mark . Basic Math and Pre-Algebra For Dummies . 28 January 2014 . John Wiley & Sons . 978-1-118-79199-8 . 21 . en . Counting numbers (also called natural numbers): The set of numbers beginning 1, 2, 3, 4, ... and going on infinitely..
  4. Woodin . Greg . Bodo . Winter . Numbers in Context: Cardinals, Ordinals, and Nominals in American English . Cognitive Science . 48. 6 . 2024 . e13471 . 10.1111/cogs.13471 . free. 38895756 . 11475258 .
  5. says: "The whole fantastic hierarchy of number systems is built up by purely set-theoretic means from a few simple assumptions about natural numbers."
  6. "Numbers make up the foundation of mathematics."

  7. Web site: Weisstein . Eric W. . Natural Number . 11 August 2020 . mathworld.wolfram.com . en.
  8. 2003 . integer . Embedded Systems Dictionary . Taylor & Francis . 28 March 2017 . 138 (integer), 247 (signed integer), & 276 (unsigned integer) . 978-1-57820-120-4 . live . https://web.archive.org/web/20170329150719/https://books.google.com/books?id=zePGx82d_fwC . 29 March 2017 . Barr . Michael . amp . Jack G. . Ganssle . Google Books.
  9. Book: Rice . Harris . https://books.google.com/books?id=2kwH8pZKLLEC&dq=%22counting%20numbers%22&pg=PA393 . The Mathematics Teacher . 1922 . National Council of Teachers of Mathematics . 393 . en . Errors in computations and the rounded number . A counting number is the number given in answer to the question "How many?" In this class of numbers belongs zero and positive integers/.
  10. Web site: Listing of the Mathematical Notations used in the Mathematical Functions Website: Numbers, variables, and functions . 27 July 2020 . functions.wolfram.com.
  11. Book: Peano . Giuseppe . Formulaire des mathematiques . 1901 . Paris, Gauthier-Villars . 39 . fr.
  12. Book: Grimaldi . Ralph P. . Discrete and Combinatorial Mathematics: An applied introduction . Pearson Addison Wesley . 2004 . 978-0-201-72634-3 . 5th.
  13. Book: Stewart . Ian . The Foundations of Mathematics . Tall . David . 12 March 2015 . OUP Oxford . 978-0-19-101648-6 . 160 . en . 30 July 2025.
  14. Book: Fokas . Athanassios . Modern Mathematical Methods For Scientists And Engineers: A Street-smart Introduction . Kaxiras . Efthimios . 12 December 2022 . World Scientific . 978-1-80061-182-5 . 4 . en . 30 July 2025 . Efthimios Kaxiras.
  15. Book: Frege . Gottlob . The foundations of arithmetic: a logico-mathematical enquiry into the concept of number . Frege . Gottlob . 1953. 1975 . Northwestern Univ. Press . 978-0-8101-0605-5 . 2. revised . Evanston Ill . 5.
  16. Book: Tao, Terence . Analysis I . 2016 . Springer Singapore . 978-981-10-1789-6 . Texts and Readings in Mathematics . 37 . Singapore . 10.1007/978-981-10-1789-6 .
  17. Benacerraf . Paul . January 1965 . What Numbers Could not Be . The Philosophical Review . 74 . 1 . 47–73 . 10.2307/2183530 . 2183530 . subscription.
  18. Book: Russell, Bertrand . Introduction to Mathematical Philosophy . 2012-12-18 . English.
  19. Encyclopedia: G.E. . Mints . Peano axioms . Encyclopedia of Mathematics . . live . 8 October 2014. https://web.archive.org/web/20141013163028/http://www.encyclopediaofmath.org/index.php/Peano_axioms . 13 October 2014.
  20. Book: Fletcher . Harold . Howell . Arnold A. . 9 May 2014 . Mathematics with Understanding . Elsevier . 978-1-4832-8079-0 . 116 . en . ...the set of natural numbers is closed under addition... set of natural numbers is closed under multiplication.
  21. Book: Davisson, Schuyler Colfax . College Algebra . 1910 . Macmillian Company . 2 . en . Addition of natural numbers is associative..
  22. Book: Brandon . Bertha (M.) . Brown . Kenneth E. . Gundlach . Bernard H. . Cooke . Ralph J. . 1962 . Laidlaw mathematics series . Laidlaw Bros. . 8 . 25 . en .
  23. Book: Ifrah, Georges . The Universal History of Numbers: From Prehistory to the Invention of the Computer . 2000-10-09 . Wiley . 978-0-471-39340-5 . en.
  24. Book: Chuquet . Nicolas . Nicolas Chuquet . Le Triparty en la science des nombres . 1881 . fr . 1484.
  25. Book: Emerson . William . The method of increments . 1763 . 113.
  26. Web site: Earliest Known Uses of Some of the Words of Mathematics (N) . Maths History . en.
  27. Book: Poincaré . Henri . La Science et l'hypothèse . 1905 . VI . Greenstreet . William John . Science and Hypothesis . On the nature of mathematical reasoning . 1902 . https://en.wikisource.org/wiki/Science_and_Hypothesis/Chapter_1.
  28. Peirce . C. S. . Charles Sanders Peirce . 1881 . On the Logic of Number . American Journal of Mathematics . 4 . 1 . 85–95 . 10.2307/2369151 . 2369151 . 1507856.
  29. Book: Shields, Paul . Studies in the Logic of Charles Sanders Peirce . Indiana University Press . 1997 . 0-253-33020-3 . Houser . Nathan . 43–52 . 3. Peirce's Axiomatization of Arithmetic . Roberts . Don D. . Van Evra . James . https://books.google.com/books?id=pWjOg-zbtMAC&pg=PA43 . registration.
  30. Book: Was sind und was sollen die Zahlen? . 1893 . F. Vieweg . 71–73 . German.
  31. Baratella . Stefano . Ferro . Ruggero . 1993 . A theory of sets with the negation of the axiom of infinity . Mathematical Logic Quarterly . 39 . 3 . 338–352 . 10.1002/malq.19930390138 . 1270381.
  32. Kirby . Laurie . Paris . Jeff . 1982 . Accessible Independence Results for Peano Arithmetic . Bulletin of the London Mathematical Society . Wiley . 14 . 4 . 285–293 . 10.1112/blms/14.4.285 . 0024-6093.
  33. Book: Fontenelle . Bernard de . Eléments de la géométrie de l'infini . 1727 . 3 . fr.
  34. Book: Arithmetices principia: nova methodo . 1889 . Fratres Bocca . 12 . Latin.
  35. Book: Peano . Giuseppe . Formulaire des mathematiques . 1901 . Paris, Gauthier-Villars . 39 . fr.
  36. Book: Fine . Henry Burchard . A College Algebra . 1904 . Ginn . 6 . en.
  37. Book: Advanced Algebra: A Study Guide to be Used with USAFI Course MC 166 Or CC166 . 1958 . United States Armed Forces Institute . 12 . en.
  38. Web site: Natural Number . archive.lib.msu.edu.
  39. Book: ISO 80000-2:2019 Quantities and units Part 2: Mathematics . 24 June 2025 . . Standard number sets and intervals . https://cdn.standards.iteh.ai/samples/64973/329519100abd447ea0d49747258d1094/ISO-80000-2-2019.pdf#page=10.