Natural number in the context of Mathematical induction

A number is a mathematical object used to count, measure, and label. The most basic examples are the natural numbers: 1, 2, 3, 4, 5, and so forth. Individual numbers can be represented in language with number words or by dedicated symbols called numerals; for example, "five" is a number word and "5" is the corresponding numeral. As only a limited list of symbols can be memorized, a numeral system is used to represent any number in an organized way. The most common representation is the Hindu–Arabic numeral system, which can display any non-negative integer using a combination of ten symbols, called numerical digits. Numerals can be used for counting (as with cardinal number of a collection or set), labels (as with telephone numbers), for ordering (as with serial numbers), and for codes (as with ISBNs). In common usage, a numeral is not clearly distinguished from the number that it represents.

In mathematics, the notion of number has been extended over the centuries to include zero (0), negative numbers, rational numbers such as one half ${\displaystyle \left({\tfrac {1}{2}}\right)}$, real numbers such as the square root of 2 ${\displaystyle \left({\sqrt {2}}\right)}$, and π, and complex numbers which extend the real numbers with a square root of −1, and its combinations with real numbers by adding or subtracting its multiples. Calculations with numbers are done with arithmetical operations, the most familiar being addition, subtraction, multiplication, division, and exponentiation. Their study or usage is called arithmetic, a term which may also refer to number theory, the study of the properties of numbers.

In mathematical logic, the Peano axioms (/piˈɑːnoʊ/, [peˈaːno]), also known as the Dedekind–Peano axioms or the Peano postulates, are axioms for the natural numbers presented by the 19th-century Italian mathematician Giuseppe Peano. These axioms have been used nearly unchanged in a number of metamathematical investigations, including research into fundamental questions of whether number theory is consistent and complete.

The axiomatization of arithmetic provided by Peano axioms is commonly called Peano arithmetic.

A prime number (or a prime) is a natural number greater than 1 that is not a product of two smaller natural numbers. A natural number greater than 1 that is not prime is called a composite number. For example, 5 is prime because the only ways of writing it as a product, 1 × 5 or 5 × 1, involve 5 itself. However, 4 is composite because it is a product (2 × 2) in which both numbers are smaller than 4. Primes are central in number theory because of the fundamental theorem of arithmetic: every natural number greater than 1 is either a prime itself or can be factorized as a product of primes that is unique up to their order.

The property of being prime is called primality. A simple but slow method of checking the primality of a given number ⁠${\displaystyle n}$⁠, called trial division, tests whether ⁠${\displaystyle n}$⁠ is a multiple of any integer between 2 and ⁠${\displaystyle {\sqrt {n}}}$⁠. Faster algorithms include the Miller–Rabin primality test, which is fast but has a small chance of error, and the AKS primality test, which always produces the correct answer in polynomial time but is too slow to be practical. Particularly fast methods are available for numbers of special forms, such as Mersenne numbers. As of October 2024 the largest known prime number is a Mersenne prime with 41,024,320 decimal digits.

An integer is the number zero (0), a positive natural number (1, 2, 3, ...), or the negation of a positive natural number (−1, −2, −3, ...). The negations or additive inverses of the positive natural numbers are referred to as negative integers. The set of all integers is often denoted by the boldface Z or blackboard bold ${\displaystyle \mathbb {Z} }$.

The set of natural numbers ${\displaystyle \mathbb {N} }$ is a subset of ${\displaystyle \mathbb {Z} }$, which in turn is a subset of the set of all rational numbers ${\displaystyle \mathbb {Q} }$, itself a subset of the real numbers ⁠${\displaystyle \mathbb {R} }$⁠. Like the set of natural numbers, the set of integers ${\displaystyle \mathbb {Z} }$ 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 the square root of 2 are not.

In number theory, an arithmetic, arithmetical, or number-theoretic function is generally any function whose domain is the set of positive integers and whose range is a subset of the complex numbers. Hardy & Wright include in their definition the requirement that an arithmetical function "expresses some arithmetical property of n". There is a larger class of number-theoretic functions that do not fit this definition, for example, the prime-counting functions. This article provides links to functions of both classes.

An example of an arithmetic function is the divisor function whose value at a positive integer n is equal to the number of divisors of n.

A calendar year begins on the New Year's Day of the given calendar system and ends on the day before the following New Year's Day, and thus consists of a whole number of days.

The Gregorian calendar year, which is in use as civil calendar in most of the world, begins on January 1 and ends on December 31. It has a length of 365 days in an ordinary year but, in order to reconcile the calendar year with the astronomical cycle, it has 366 days in a leap year. With 97 leap years every 400 years, the Gregorian calendar year has an average length of 365.2425 days.

1,000,000,000,000 (one trillion on the short scale; one billion on the long scale; one thousand billion; one million million) is the natural number following 999,999,999,999 and preceding 1,000,000,000,001. It is known as 10 kharab, 1000 arab, or 1 lakh crore in the Indian numbering system.

1,000,000 (one million), or one thousand thousand, is the natural number following 999,999 and preceding 1,000,001. The word is derived from the early Italian millione (milione in modern Italian), from mille, "thousand", plus the augmentative suffix -one.

A binary number is a number expressed in the base-2 numeral system or binary numeral system, a method for representing numbers that uses only two symbols for the natural numbers: typically 0 (zero) and 1 (one). A binary number may also refer to a rational number that has a finite representation in the binary numeral system, that is, the quotient of an integer by a power of two.

The base-2 numeral system is a positional notation with a radix of 2. Each digit is referred to as a bit, or binary digit. Because of its straightforward implementation in digital electronic circuitry using logic gates, the binary system is used by almost all modern computers and computer-based devices, as a preferred system of use, over various other human techniques of communication, because of the simplicity of the language and the noise immunity in physical implementation.

A lattice is an abstract structure studied in the mathematical subdisciplines of order theory and abstract algebra. It consists of a partially ordered set in which every pair of elements has a unique supremum (also called a least upper bound or join) and a unique infimum (also called a greatest lower bound or meet). An example is given by the power set of a set, partially ordered by inclusion, for which the supremum is the union and the infimum is the intersection. Another example is given by the natural numbers, partially ordered by divisibility, for which the supremum is the least common multiple and the infimum is the greatest common divisor.

Lattices can also be characterized as algebraic structures satisfying certain axiomatic identities. Since the two definitions are equivalent, lattice theory draws on both order theory and universal algebra. Semilattices include lattices, which in turn include Heyting and Boolean algebras. These lattice-like structures all admit order-theoretic as well as algebraic descriptions.

A digital image is an image composed of picture elements, also known as pixels, each with finite, discrete quantities of numeric representation for its intensity or gray level that is an output from its two-dimensional functions fed as input by its spatial coordinates denoted with x, y on the x-axis and y-axis, respectively. An image can be vector or raster type. By itself, the term "digital image" usually refers to raster images or bitmapped images (as opposed to vector images).

In mathematics, a sequence is an enumerated collection of objects in which repetitions are allowed and order matters. Like a set, it contains members (also called elements, or terms). The number of elements (possibly infinite) is called the length of the sequence. Unlike a set, the same elements can appear multiple times at different positions in a sequence, and unlike a set, the order does matter. Formally, a sequence can be defined as a function from natural numbers (the positions of elements in the sequence) to the elements at each position. The notion of a sequence can be generalized to an indexed family, defined as a function from an arbitrary index set.

For example, (M, A, R, Y) is a sequence of letters with the letter "M" first and "Y" last. This sequence differs from (A, R, M, Y). Also, the sequence (1, 1, 2, 3, 5, 8), which contains the number 1 at two different positions, is a valid sequence. Sequences can be finite, as in these examples, or infinite, such as the sequence of all even positive integers (2, 4, 6, ...).

Addition, usually denoted with the plus sign +, is one of the four basic operations of arithmetic, the other three being subtraction, multiplication, and division. The addition of two whole numbers results in the total or sum of those values combined. For example, the adjacent image shows two columns of apples, one with three apples and the other with two apples, totaling to five apples. This observation is expressed as "3 + 2 = 5", which is read as "three plus two equals five".

Besides counting items, addition can also be defined and executed without referring to concrete objects, using abstractions called numbers instead, such as integers, real numbers, and complex numbers. Addition belongs to arithmetic, a branch of mathematics. In algebra, another area of mathematics, addition can also be performed on abstract objects such as vectors, matrices, and elements of additive groups.

Georg Ferdinand Ludwig Philipp Cantor (/ˈkæntɔːr/ KAN-tor; German: [ˈɡeːɔʁk ˈfɛʁdinant ˈluːtvɪç ˈfiːlɪp ˈkantoːɐ̯]; 3 March [O.S. 19 February] 1845 – 6 January 1918) was a mathematician who played a pivotal role in the creation of set theory, which has become a fundamental theory in mathematics. Cantor established the importance of one-to-one correspondence between the members of two sets, defined infinite and well-ordered sets, and proved that the real numbers are more numerous than the natural numbers. Cantor's method of proof of this theorem implies the existence of an infinity of infinities. He defined the cardinal and ordinal numbers and their arithmetic. Cantor's work is of great philosophical interest, a fact he was well aware of.

Originally, Cantor's theory of transfinite numbers was regarded as counter-intuitive – even shocking. This caused it to encounter resistance from mathematical contemporaries such as Leopold Kronecker and Henri Poincaré and later from Hermann Weyl and L. E. J. Brouwer, while Ludwig Wittgenstein raised philosophical objections; see Controversy over Cantor's theory. Cantor, a devout Lutheran Christian, believed the theory had been communicated to him by God. Some Christian theologians (particularly neo-Scholastics) saw Cantor's work as a challenge to the uniqueness of the absolute infinity in the nature of God – on one occasion equating the theory of transfinite numbers with pantheism – a proposition that Cantor vigorously rejected. Not all theologians were against Cantor's theory; prominent neo-scholastic philosopher Konstantin Gutberlet [de; it] was in favor of it and Cardinal Johann Baptist Franzelin accepted it as a valid theory (after Cantor made some important clarifications).

Kurt Friedrich Gödel (/ˈɡɜːrdəl/ GUR-dəl; German: [ˈkʊʁt ˈɡøːdl̩] ; April 28, 1906 – January 14, 1978) was a logician, mathematician, and philosopher. Considered along with Aristotle and Gottlob Frege to be one of the most significant logicians in history, Gödel profoundly influenced scientific and philosophical thinking in the 20th century (at a time when Bertrand Russell, Alfred North Whitehead, and David Hilbert were using logic and set theory to investigate the foundations of mathematics), building on earlier work by Frege, Richard Dedekind, and Georg Cantor.

Gödel's discoveries in the foundations of mathematics led to the proof of his completeness theorem in 1929 as part of his dissertation to earn a doctorate at the University of Vienna, and the publication of Gödel's incompleteness theorems two years later, in 1931. The incompleteness theorems address limitations of formal axiomatic systems. In particular, they imply that a formal axiomatic system satisfying certain technical conditions cannot decide the truth value of all statements about the natural numbers, and cannot prove that it is itself consistent. To prove this, Gödel developed a technique now known as Gödel numbering, which codes formal expressions as natural numbers.

In set theory a serial relation is a homogeneous relation expressing the connection of an element of a sequence to the following element. The successor function used by Peano to define natural numbers is the prototype for a serial relation.

Bertrand Russell used serial relations in The Principles of Mathematics (1903) as he explored the foundations of order theory and its applications. The term serial relation was also used by B. A. Bernstein for an article showing that particular common axioms in order theory are nearly incompatible: connectedness, irreflexivity, and transitivity.