Natural number in the context of "Functional equation"

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.