Mathematics.

numbers

Natural Numbers

Foundations15 minDifficulty1 out of 10

Overview

The natural numbers are the numbers used for counting (1, 2, 3, ...) and, in most modern conventions, ordering, including 0 as the starting point in set theory and computer science. They are the most basic objects in mathematics — every other number system (integers, rationals, reals, complex numbers) is built by extending the natural numbers to solve equations the natural numbers alone cannot solve.

Intuition

Think of natural numbers as the answer to 'how many?' If you have a pile of apples, the natural number you get by counting them tells you the size of the pile. Nothing in that process requires negative amounts, fractions, or anything strange — just one-at-a-time counting, which is why natural numbers feel so obvious even though pinning down exactly what a 'number' is took mathematicians thousands of years.

Formal Definition

Definition

The standard axiomatic definition comes from Peano arithmetic: the natural numbers are the smallest set containing 0 (or 1, depending on convention) that is closed under a 'successor' operation.

N={0,1,2,3,}\mathbb{N} = \{0, 1, 2, 3, \dots\}

The set of natural numbers (set-theoretic / computer science convention, includes 0)

S(n)=n+1S(n) = n + 1

The successor function: every natural number has a unique next number

Notation

NotationMeaning
N\mathbb{N}The set of all natural numbers
N0\mathbb{N}_0Natural numbers including 0 (used when ℕ alone means positive integers only)
N+\mathbb{N}^+Positive natural numbers (excludes 0)

Properties

Well-ordering

EverynonemptysubsetofNhasaleastelement.Every non-empty subset of ℕ has a least element.

Example: The least element of {4, 7, 2, 9} is 2.

Closure under addition

a,bN, a+bN\forall a, b \in \mathbb{N},\ a + b \in \mathbb{N}

Closure under multiplication

a,bN, abN\forall a, b \in \mathbb{N},\ a \cdot b \in \mathbb{N}

Not closed under subtraction

35N3 - 5 \notin \mathbb{N}

Example: This is exactly why the integers ℤ were invented.

Applications

Array indices, loop counters, and recursion depth are all natural numbers — the discrete, countable structure of ℕ maps directly onto discrete computation.

Common Mistakes

Common Mistake

Believing 0 is not a natural number in every context.

Convention varies by field: set theory and CS include 0 in ℕ; some number theory texts start at 1. Always check which convention a source uses.

Historical Background

Counting is older than writing. Tally marks on the Lebombo bone (Africa, c. 35,000 BCE) and the Ishango bone (c. 20,000 BCE) are among the earliest evidence of humans recording counts. Formal axiomatic treatment came far later: Giuseppe Peano published his axioms for the natural numbers in 1889, giving the intuitive idea of 'counting' a precise logical foundation.

  1. c. 20,000 BCE

    Ishango bone tally marks — earliest known counting artifact

  2. c. 300 BCE

    Euclid's Elements treats number theory using natural numbers

    Euclid

  3. 1889

    Peano publishes axioms formalizing the natural numbers

    Giuseppe Peano

Summary

  • Natural numbers ℕ = {0, 1, 2, 3, ...} are the counting numbers.
  • Formalized by Peano's axioms (1889): start at 0, every number has a unique successor.
  • Closed under addition and multiplication, but not subtraction or division.
  • Every non-empty subset of ℕ has a smallest element (well-ordering principle).
  • Foundation for integers, rationals, reals — each built by extending ℕ to solve equations ℕ alone cannot.

References

  1. BookPeano, G. (1889). Arithmetices principia, nova methodo exposita.