Number theory

 

The earliest historical find of an arithmetical nature is a fragment of a table: the broken clay tablet Plimpton 322 (Larsa, Mesopotamia, ca. 1800 BC) contains a list of "Pythagorean triples", that is, integers ${\displaystyle (a,b,c)}$  such that ${\displaystyle a^{2}+b^{2}=c^{2}}$ . The triples are too many and too large to have been obtained by brute force. The heading over the first column reads: "The takiltum of the diagonal which has been subtracted such that the width..."^[2]

The table's layout suggests^[3] that it was constructed by means of what amounts, in modern language, to the identity

${\displaystyle \left({\frac {1}{2}}\left(x-{\frac {1}{x}}\right)\right)^{2}+1=\left({\frac {1}{2}}\left(x+{\frac {1}{x}}\right)\right)^{2},}$ 

which is implicit in routine Old Babylonian exercises.^[4] If some other method was used,^[5] the triples were first constructed and then reordered by ${\displaystyle c/a}$ , presumably for actual use as a "table", for example, with a view to applications.

It is not known what these applications may have been, or whether there could have been any; Babylonian astronomy, for example, truly came into its own only later. It has been suggested instead that the table was a source of numerical examples for school problems.^{[6][note 3]}

While evidence of Babylonian number theory is only survived by the Plimpton 322 tablet, some authors assert that Babylonian algebra was exceptionally well developed and included the foundations of modern elementary algebra.^[7] Late Neoplatonic sources^[8] state that Pythagoras learned mathematics from the Babylonians. Much earlier sources^[9] state that Thales and Pythagoras traveled and studied in Egypt.

In book nine of Euclid's Elements, propositions 21–34 are very probably influenced by Pythagorean teachings;^[10] it is very simple material ("odd times even is even", "if an odd number measures [= divides] an even number, then it also measures [= divides] half of it"), but it is all that is needed to prove that ${\displaystyle {\sqrt {2}}}$  is irrational.^[11] Pythagorean mystics gave great importance to the odd and the even.^[12] The discovery that ${\displaystyle {\sqrt {2}}}$  is irrational is credited to the early Pythagoreans (pre-Theodorus).^[13] By revealing (in modern terms) that numbers could be irrational, this discovery seems to have provoked the first foundational crisis in mathematical history; its proof or its divulgation are sometimes credited to Hippasus, who was expelled or split from the Pythagorean sect.^[14] This forced a distinction between numbers (integers and the rationals—the subjects of arithmetic), on the one hand, and lengths and proportions (which may be identified with real numbers, whether rational or not), on the other hand.

The Pythagorean tradition spoke also of so-called polygonal or figurate numbers.^[15] While square numbers, cubic numbers, etc., are seen now as more natural than triangular numbers, pentagonal numbers, etc., the study of the sums of triangular and pentagonal numbers would prove fruitful in the early modern period (17th to early 19th centuries).

The Chinese remainder theorem appears as an exercise^[16] in Sunzi Suanjing (3rd, 4th or 5th century CE).^[17] (There is one important step glossed over in Sunzi's solution:^{[note 4]} it is the problem that was later solved by Āryabhaṭa's Kuṭṭaka – see below.) The result was later generalized with a complete solution called Da-yan-shu (大衍術) in Qin Jiushao's 1247 Mathematical Treatise in Nine Sections ^[18] which was translated into English in early 19th century by British missionary Alexander Wylie.^[19]

There is also some numerical mysticism in Chinese mathematics,^{[note 5]} but, unlike that of the Pythagoreans, it seems to have led nowhere.

Aside from a few fragments, the mathematics of Classical Greece is known to us either through the reports of contemporary non-mathematicians or through mathematical works from the early Hellenistic period.^[20] In the case of number theory, this means, by and large, Plato and Euclid, respectively.

While Asian mathematics influenced Greek and Hellenistic learning, it seems to be the case that Greek mathematics is also an indigenous tradition.

Eusebius, PE X, chapter 4 mentions of Pythagoras:

"In fact the said Pythagoras, while busily studying the wisdom of each nation, visited Babylon, and Egypt, and all Persia, being instructed by the Magi and the priests: and in addition to these he is related to have studied under the Brahmans (these are Indian philosophers); and from some he gathered astrology, from others geometry, and arithmetic and music from others, and different things from different nations, and only from the wise men of Greece did he get nothing, wedded as they were to a poverty and dearth of wisdom: so on the contrary he himself became the author of instruction to the Greeks in the learning which he had procured from abroad."^[21]

Aristotle claimed that the philosophy of Plato closely followed the teachings of the Pythagoreans,^[22] and Cicero repeats this claim: Platonem ferunt didicisse Pythagorea omnia ("They say Plato learned all things Pythagorean").^[23]

Plato had a keen interest in mathematics, and distinguished clearly between arithmetic and calculation. (By arithmetic he meant, in part, theorising on number, rather than what arithmetic or number theory have come to mean.) It is through one of Plato's dialogues—namely, Theaetetus—that it is known that Theodorus had proven that ${\displaystyle {\sqrt {3}},{\sqrt {5}},\dots ,{\sqrt {17}}}$  are irrational. Theaetetus was, like Plato, a disciple of Theodorus's; he worked on distinguishing different kinds of incommensurables, and was thus arguably a pioneer in the study of number systems. (Book X of Euclid's Elements is described by Pappus as being largely based on Theaetetus's work.)

Euclid devoted part of his Elements to prime numbers and divisibility, topics that belong unambiguously to number theory and are basic to it (Books VII to IX of Euclid's Elements). In particular, he gave an algorithm for computing the greatest common divisor of two numbers (the Euclidean algorithm; Elements, Prop. VII.2) and the first known proof of the infinitude of primes (Elements, Prop. IX.20).

In 1773, Lessing published an epigram he had found in a manuscript during his work as a librarian; it claimed to be a letter sent by Archimedes to Eratosthenes.^[24][25] The epigram proposed what has become known as Archimedes's cattle problem; its solution (absent from the manuscript) requires solving an indeterminate quadratic equation (which reduces to what would later be misnamed Pell's equation). As far as it is known, such equations were first successfully treated by the Indian school. It is not known whether Archimedes himself had a method of solution.

 

Very little is known about Diophantus of Alexandria; he probably lived in the third century AD, that is, about five hundred years after Euclid. Six out of the thirteen books of Diophantus's Arithmetica survive in the original Greek and four more survive in an Arabic translation. The Arithmetica is a collection of worked-out problems where the task is invariably to find rational solutions to a system of polynomial equations, usually of the form ${\displaystyle f(x,y)=z^{2}}$  or ${\displaystyle f(x,y,z)=w^{2}}$ . Thus, nowadays, a Diophantine equations a polynomial equations to which rational or integer solutions are sought.

While Greek astronomy probably influenced Indian learning, to the point of introducing trigonometry,^[26] it seems to be the case that Indian mathematics is otherwise an indigenous tradition;^[27] in particular, there is no evidence that Euclid's Elements reached India before the 18th century.^[28]

Āryabhaṭa (476–550 AD) showed that pairs of simultaneous congruences ${\displaystyle n\equiv a_{1}{\bmod {m}}_{1}}$ , ${\displaystyle n\equiv a_{2}{\bmod {m}}_{2}}$  could be solved by a method he called kuṭṭaka, or pulveriser;^[29] this is a procedure close to (a generalisation of) the Euclidean algorithm, which was probably discovered independently in India.^[30] Āryabhaṭa seems to have had in mind applications to astronomical calculations.^[26]

Brahmagupta (628 AD) started the systematic study of indefinite quadratic equations—in particular, the misnamed Pell equation, in which Archimedes may have first been interested, and which did not start to be solved in the West until the time of Fermat and Euler. Later Sanskrit authors would follow, using Brahmagupta's technical terminology. A general procedure (the chakravala, or "cyclic method") for solving Pell's equation was finally found by Jayadeva (cited in the eleventh century; his work is otherwise lost); the earliest surviving exposition appears in Bhāskara II's Bīja-gaṇita (twelfth century).^[31]

Indian mathematics remained largely unknown in Europe until the late eighteenth century;^[32] Brahmagupta and Bhāskara's work was translated into English in 1817 by Henry Colebrooke.^[33]

 

In the early ninth century, the caliph Al-Ma'mun ordered translations of many Greek mathematical works and at least one Sanskrit work (the Sindhind, which may^[34] or may not^[35] be Brahmagupta's Brāhmasphuṭasiddhānta). Diophantus's main work, the Arithmetica, was translated into Arabic by Qusta ibn Luqa (820–912). Part of the treatise al-Fakhri (by al-Karajī, 953 – ca. 1029) builds on it to some extent. According to Rashed Roshdi, Al-Karajī's contemporary Ibn al-Haytham knew^[36] what would later be called Wilson's theorem.

Other than a treatise on squares in arithmetic progression by Fibonacci—who traveled and studied in north Africa and Constantinople—no number theory to speak of was done in western Europe during the Middle Ages. Matters started to change in Europe in the late Renaissance, thanks to a renewed study of the works of Greek antiquity. A catalyst was the textual emendation and translation into Latin of Diophantus' Arithmetica.^[37]

 

Pierre de Fermat (1607–1665) never published his writings; in particular, his work on number theory is contained almost entirely in letters to mathematicians and in private marginal notes.^[38] In his notes and letters, he scarcely wrote any proofs—he had no models in the area.^[39]

Over his lifetime, Fermat made the following contributions to the field:

• One of Fermat's first interests was perfect numbers (which appear in Euclid, Elements IX) and amicable numbers;^{[note 6]} these topics led him to work on integer divisors, which were from the beginning among the subjects of the correspondence (1636 onwards) that put him in touch with the mathematical community of the day.^[40]
• In 1638, Fermat claimed, without proof, that all whole numbers can be expressed as the sum of four squares or fewer.^[41]
• Fermat's little theorem (1640):^[42] if a is not divisible by a prime p, then ${\displaystyle a^{p-1}\equiv 1{\bmod {p}}.}$ ^{[note 7]}
• If a and b are coprime, then ${\displaystyle a^{2}+b^{2}}$  is not divisible by any prime congruent to −1 modulo 4;^[43] and every prime congruent to 1 modulo 4 can be written in the form ${\displaystyle a^{2}+b^{2}}$ .^[44] These two statements also date from 1640; in 1659, Fermat stated to Huygens that he had proven the latter statement by the method of infinite descent.^[45]
• In 1657, Fermat posed the problem of solving ${\displaystyle x^{2}-Ny^{2}=1}$  as a challenge to English mathematicians. The problem was solved in a few months by Wallis and Brouncker.^[46] Fermat considered their solution valid, but pointed out they had provided an algorithm without a proof (as had Jayadeva and Bhaskara, though Fermat was not aware of this). He stated that a proof could be found by infinite descent.
• Fermat stated and proved (by infinite descent) in the appendix to Observations on Diophantus (Obs. XLV)^[47] that ${\displaystyle x^{4}+y^{4}=z^{4}}$  has no non-trivial solutions in the integers. Fermat also mentioned to his correspondents that ${\displaystyle x^{3}+y^{3}=z^{3}}$  has no non-trivial solutions, and that this could also be proven by infinite descent.^[48] The first known proof is due to Euler (1753; indeed by infinite descent).^[49]
• Fermat claimed (Fermat's Last Theorem) to have shown there are no solutions to ${\displaystyle x^{n}+y^{n}=z^{n}}$  for all ${\displaystyle n\geq 3}$ ; this claim appears in his annotations in the margins of his copy of Diophantus.

 

The interest of Leonhard Euler (1707–1783) in number theory was first spurred in 1729, when a friend of his, the amateur^{[note 8]} Goldbach, pointed him towards some of Fermat's work on the subject.^[50][51] This has been called the "rebirth" of modern number theory,^[52] after Fermat's relative lack of success in getting his contemporaries' attention for the subject.^[53] Euler's work on number theory includes the following:^[54]

• Proofs for Fermat's statements. This includes Fermat's little theorem (generalised by Euler to non-prime moduli); the fact that ${\displaystyle p=x^{2}+y^{2}}$  if and only if ${\displaystyle p\equiv 1{\bmod {4}}}$ ; initial work towards a proof that every integer is the sum of four squares (the first complete proof is by Joseph-Louis Lagrange (1770), soon improved by Euler himself^[55]); the lack of non-zero integer solutions to ${\displaystyle x^{4}+y^{4}=z^{2}}$  (implying the case n=4 of Fermat's last theorem, the case n=3 of which Euler also proved by a related method).
• Pell's equation, first misnamed by Euler.^[56] He wrote on the link between continued fractions and Pell's equation.^[57]
• First steps towards analytic number theory. In his work of sums of four squares, partitions, pentagonal numbers, and the distribution of prime numbers, Euler pioneered the use of what can be seen as analysis (in particular, infinite series) in number theory. Since he lived before the development of complex analysis, most of his work is restricted to the formal manipulation of power series. He did, however, do some very notable (though not fully rigorous) early work on what would later be called the Riemann zeta function.^[58]
• Quadratic forms. Following Fermat's lead, Euler did further research on the question of which primes can be expressed in the form ${\displaystyle x^{2}+Ny^{2}}$ , some of it prefiguring quadratic reciprocity.^[59][60][61]
• Diophantine equations. Euler worked on some Diophantine equations of genus 0 and 1.^[62][63] In particular, he studied Diophantus's work; he tried to systematise it, but the time was not yet ripe for such an endeavour—algebraic geometry was still in its infancy.^[64] He did notice there was a connection between Diophantine problems and elliptic integrals,^[64] whose study he had himself initiated.

 

 

Joseph-Louis Lagrange (1736–1813) was the first to give full proofs of some of Fermat's and Euler's work and observations—for instance, the four-square theorem and the basic theory of the misnamed "Pell's equation" (for which an algorithmic solution was found by Fermat and his contemporaries, and also by Jayadeva and Bhaskara II before them.) He also studied quadratic forms in full generality (as opposed to ${\displaystyle mX^{2}+nY^{2}}$ )—defining their equivalence relation, showing how to put them in reduced form, etc.

Adrien-Marie Legendre (1752–1833) was the first to state the law of quadratic reciprocity. He also conjectured what amounts to the prime number theorem and Dirichlet's theorem on arithmetic progressions. He gave a full treatment of the equation ${\displaystyle ax^{2}+by^{2}+cz^{2}=0}$ ^[66] and worked on quadratic forms along the lines later developed fully by Gauss.^[67] In his old age, he was the first to prove Fermat's Last Theorem for ${\displaystyle n=5}$  (completing work by Peter Gustav Lejeune Dirichlet, and crediting both him and Sophie Germain).^[68]

 

In his Disquisitiones Arithmeticae (1798), Carl Friedrich Gauss (1777–1855) proved the law of quadratic reciprocity and developed the theory of quadratic forms (in particular, defining their composition). He also introduced some basic notation (congruences) and devoted a section to computational matters, including primality tests.^[69] The last section of the Disquisitiones established a link between roots of unity and number theory:

The theory of the division of the circle...which is treated in sec. 7 does not belong by itself to arithmetic, but its principles can only be drawn from higher arithmetic.^[70]

In this way, Gauss arguably made a first foray towards both Évariste Galois's work and algebraic number theory.

 

 

Starting early in the nineteenth century, the following developments gradually took place:

• The rise to self-consciousness of number theory (or higher arithmetic) as a field of study.^[71]
• The development of much of modern mathematics necessary for basic modern number theory: complex analysis, group theory, Galois theory—accompanied by greater rigor in analysis and abstraction in algebra.
• The rough subdivision of number theory into its modern subfields—in particular, analytic and algebraic number theory.

Algebraic number theory may be said to start with the study of reciprocity and cyclotomy, but truly came into its own with the development of abstract algebra and early ideal theory and valuation theory; see below. A conventional starting point for analytic number theory is Dirichlet's theorem on arithmetic progressions (1837),^[72][73] whose proof introduced L-functions and involved some asymptotic analysis and a limiting process on a real variable.^[74] The first use of analytic ideas in number theory actually goes back to Euler (1730s),^[75][76] who used formal power series and non-rigorous (or implicit) limiting arguments. The use of complex analysis in number theory comes later: the work of Bernhard Riemann (1859) on the zeta function is the canonical starting point;^[77] Jacobi's four-square theorem (1839), which predates it, belongs to an initially different strand that has by now taken a leading role in analytic number theory (modular forms).^[78]

The history of each subfield is briefly addressed in its own section below; see the main article of each subfield for fuller treatments. Many of the most interesting questions in each area remain open and are being actively worked on.

The term elementary generally denotes a method that does not use complex analysis. For example, the prime number theorem was first proven using complex analysis in 1896, but an elementary proof was found only in 1949 by Erdős and Selberg.^[79] The term is somewhat ambiguous: for example, proofs based on complex Tauberian theorems (for example, Wiener–Ikehara) are often seen as quite enlightening but not elementary, in spite of using Fourier analysis, rather than complex analysis as such. Here as elsewhere, an elementary proof may be longer and more difficult for most readers than a non-elementary one.

 

Number theory has the reputation of being a field many of whose results can be stated to the layperson. At the same time, the proofs of these results are not particularly accessible, in part because the range of tools they use is, if anything, unusually broad within mathematics.^[80]

 

 

Analytic number theory may be defined

• in terms of its tools, as the study of the integers by means of tools from real and complex analysis;^[72] or
• in terms of its concerns, as the study within number theory of estimates on size and density, as opposed to identities.^[81]

Some subjects generally considered to be part of analytic number theory, for example, sieve theory,^{[note 9]} are better covered by the second rather than the first definition: some of sieve theory, for instance, uses little analysis,^{[note 10]} yet it does belong to analytic number theory.

The following are examples of problems in analytic number theory: the prime number theorem, the Goldbach conjecture (or the twin prime conjecture, or the Hardy–Littlewood conjectures), the Waring problem and the Riemann hypothesis. Some of the most important tools of analytic number theory are the circle method, sieve methods and L-functions (or, rather, the study of their properties). The theory of modular forms (and, more generally, automorphic forms) also occupies an increasingly central place in the toolbox of analytic number theory.^[82]

One may ask analytic questions about algebraic numbers, and use analytic means to answer such questions; it is thus that algebraic and analytic number theory intersect. For example, one may define prime ideals (generalizations of prime numbers in the field of algebraic numbers) and ask how many prime ideals there are up to a certain size. This question can be answered by means of an examination of Dedekind zeta functions, which are generalizations of the Riemann zeta function, a key analytic object at the roots of the subject.^[83] This is an example of a general procedure in analytic number theory: deriving information about the distribution of a sequence (here, prime ideals or prime numbers) from the analytic behavior of an appropriately constructed complex-valued function.^[84]

An algebraic number is any complex number that is a solution to some polynomial equation ${\displaystyle f(x)=0}$  with rational coefficients; for example, every solution ${\displaystyle x}$  of ${\displaystyle x^{5}+(11/2)x^{3}-7x^{2}+9=0}$  (say) is an algebraic number. Fields of algebraic numbers are also called algebraic number fields, or shortly number fields. Algebraic number theory studies algebraic number fields.^[85] Thus, analytic and algebraic number theory can and do overlap: the former is defined by its methods, the latter by its objects of study.

It could be argued that the simplest kind of number fields (viz., quadratic fields) were already studied by Gauss, as the discussion of quadratic forms in Disquisitiones arithmeticae can be restated in terms of ideals and norms in quadratic fields. (A quadratic field consists of all numbers of the form ${\displaystyle a+b{\sqrt {d}}}$ , where ${\displaystyle a}$  and ${\displaystyle b}$  are rational numbers and ${\displaystyle d}$  is a fixed rational number whose square root is not rational.) For that matter, the 11th-century chakravala method amounts—in modern terms—to an algorithm for finding the units of a real quadratic number field. However, neither Bhāskara nor Gauss knew of number fields as such.

The grounds of the subject were set in the late nineteenth century, when ideal numbers, the theory of ideals and valuation theory were introduced; these are three complementary ways of dealing with the lack of unique factorisation in algebraic number fields. (For example, in the field generated by the rationals and ${\displaystyle {\sqrt {-5}}}$ , the number ${\displaystyle 6}$  can be factorised both as ${\displaystyle 6=2\cdot 3}$  and ${\displaystyle 6=(1+{\sqrt {-5}})(1-{\sqrt {-5}})}$ ; all of ${\displaystyle 2}$ , ${\displaystyle 3}$ , ${\displaystyle 1+{\sqrt {-5}}}$  and ${\displaystyle 1-{\sqrt {-5}}}$  are irreducible, and thus, in a naïve sense, analogous to primes among the integers.) The initial impetus for the development of ideal numbers (by Kummer) seems to have come from the study of higher reciprocity laws,^[86] that is, generalisations of quadratic reciprocity.

Number fields are often studied as extensions of smaller number fields: a field L is said to be an extension of a field K if L contains K. (For example, the complex numbers C are an extension of the reals R, and the reals R are an extension of the rationals Q.) Classifying the possible extensions of a given number field is a difficult and partially open problem. Abelian extensions—that is, extensions L of K such that the Galois group^{[note 11]} Gal(L/K) of L over K is an abelian group—are relatively well understood. Their classification was the object of the programme of class field theory, which was initiated in the late 19th century (partly by Kronecker and Eisenstein) and carried out largely in 1900–1950.

An example of an active area of research in algebraic number theory is Iwasawa theory. The Langlands program, one of the main current large-scale research plans in mathematics, is sometimes described as an attempt to generalise class field theory to non-abelian extensions of number fields.

The central problem of Diophantine geometry is to determine when a Diophantine equation has solutions, and if it does, how many. The approach taken is to think of the solutions of an equation as a geometric object.

For example, an equation in two variables defines a curve in the plane. More generally, an equation or system of equations in two or more variables defines a curve, a surface, or some other such object in n-dimensional space. In Diophantine geometry, one asks whether there are any rational points (points all of whose coordinates are rationals) or integral points (points all of whose coordinates are integers) on the curve or surface. If there are any such points, the next step is to ask how many there are and how they are distributed. A basic question in this direction is whether there are finitely or infinitely many rational points on a given curve or surface.

An example here may be helpful. Consider the Pythagorean equation ${\displaystyle x^{2}+y^{2}=1,}$  one would like to know its rational solutions; that is, its solutions ${\displaystyle (x,y)}$  such that x and y are both rational. This is the same as asking for all integer solutions to ${\displaystyle a^{2}+b^{2}=c^{2}}$ ; any solution to the latter equation gives us a solution ${\displaystyle x=a/c}$ , ${\displaystyle y=b/c}$  to the former. It is also the same as asking for all points with rational coordinates on the curve described by ${\displaystyle x^{2}+y^{2}=1}$  (a circle of radius 1 centered on the origin).

 

The rephrasing of questions on equations in terms of points on curves is felicitous. The finiteness or not of the number of rational or integer points on an algebraic curve (that is, rational or integer solutions to an equation ${\displaystyle f(x,y)=0}$ , where ${\displaystyle f}$  is a polynomial in two variables) depends crucially on the genus of the curve.^{[note 12]} A major achievement of this approach is Wiles's proof of Fermat's Last Theorem, for which other geometrical notions are just as crucial.

There is also the closely linked area of Diophantine approximations: given a number ${\displaystyle x}$ , determine how well it can be approximated by rational numbers. One seeks approximations that are good relative to the amount of space required to write the rational number: call ${\displaystyle a/q}$  (with ${\displaystyle \gcd(a,q)=1}$ ) a good approximation to ${\displaystyle x}$  if ${\displaystyle |x-a/q|<{\frac {1}{q^{c}}}}$ , where ${\displaystyle c}$  is large. This question is of special interest if ${\displaystyle x}$  is an algebraic number. If ${\displaystyle x}$  cannot be approximated well, then some equations do not have integer or rational solutions. Moreover, several concepts (especially that of height) are critical both in Diophantine geometry and in the study of Diophantine approximations. This question is also of special interest in transcendental number theory: if a number can be approximated better than any algebraic number, then it is a transcendental number. It is by this argument that π and e have been shown to be transcendental.

Diophantine geometry should not be confused with the geometry of numbers, which is a collection of graphical methods for answering certain questions in algebraic number theory. Arithmetic geometry, however, is a contemporary term for much the same domain as that covered by the term Diophantine geometry. The term arithmetic geometry is arguably used most often when one wishes to emphasize the connections to modern algebraic geometry (for example, in Faltings's theorem) rather than to techniques in Diophantine approximations.

The areas below date from no earlier than the mid-twentieth century, even if they are based on older material. For example, as explained below, algorithms in number theory have a long history, arguably predating the formal concept of proof. However, the modern study of computability began only in the 1930s and 1940s, while computational complexity theory emerged in the 1970s.

Probabilistic number theory starts with questions such as the following ones: Take an integer n at random between one and a million. How likely is it to be prime? (this is just another way of asking how many primes there are between one and a million). How many prime divisors will n have on average? What is the probability that it will have many more or many fewer divisors or prime divisors than the average?

Much of probabilistic number theory can be seen as an important special case of the study of variables that are almost, but not quite, mutually independent. For example, the event that a random integer between one and a million be divisible by two and the event that it be divisible by three are almost independent, but not quite.

It is sometimes said that probabilistic combinatorics uses the fact that whatever happens with probability greater than ${\displaystyle 0}$  must happen sometimes; one may say with equal justice that many applications of probabilistic number theory hinge on the fact that whatever is unusual must be rare. If certain algebraic objects (say, rational or integer solutions to certain equations) can be shown to be in the tail of certain sensibly defined distributions, it follows that there must be few of them; this is a very concrete non-probabilistic statement following from a probabilistic one.

At times, a non-rigorous, probabilistic approach leads to a number of heuristic algorithms and open problems, notably Cramér's conjecture.

Arithmetic combinatorics starts with questions like the following ones: Does a fairly "thick" infinite set ${\displaystyle A}$  contain many elements in arithmetic progression: ${\displaystyle a}$ , ${\displaystyle a+b,a+2b,a+3b,\ldots ,a+10b}$ , say? Should it be possible to write large integers as sums of elements of ${\displaystyle A}$ ?

These questions are characteristic of arithmetic combinatorics. This is a presently coalescing field; it subsumes additive number theory (which concerns itself with certain very specific sets ${\displaystyle A}$  of arithmetic significance, such as the primes or the squares) and, arguably, some of the geometry of numbers, together with some rapidly developing new material. Its focus on issues of growth and distribution accounts in part for its developing links with ergodic theory, finite group theory, model theory, and other fields. The term additive combinatorics is also used; however, the sets ${\displaystyle A}$  being studied need not be sets of integers, but rather subsets of non-commutative groups, for which the multiplication symbol, not the addition symbol, is traditionally used; they can also be subsets of rings, in which case the growth of ${\displaystyle A+A}$  and ${\displaystyle A}$ ·${\displaystyle A}$  may be compared.

 

While the word algorithm goes back only to certain readers of al-Khwārizmī, careful descriptions of methods of solution are older than proofs: such methods (that is, algorithms) are as old as any recognisable mathematics—ancient Egyptian, Babylonian, Vedic, Chinese—whereas proofs appeared only with the Greeks of the classical period.

An early case is that of what is now called the Euclidean algorithm. In its basic form (namely, as an algorithm for computing the greatest common divisor) it appears as Proposition 2 of Book VII in Elements, together with a proof of correctness. However, in the form that is often used in number theory (namely, as an algorithm for finding integer solutions to an equation ${\displaystyle ax+by=c}$ , or, what is the same, for finding the quantities whose existence is assured by the Chinese remainder theorem) it first appears in the works of Āryabhaṭa (5th–6th century CE) as an algorithm called kuṭṭaka ("pulveriser"), without a proof of correctness.

There are two main questions: "Can this be computed?" and "Can it be computed rapidly?" Anyone can test whether a number is prime or, if it is not, split it into prime factors; doing so rapidly is another matter. Fast algorithms for testing primality are now known, but, in spite of much work (both theoretical and practical), no truly fast algorithm for factoring.

The difficulty of a computation can be useful: modern protocols for encrypting messages (for example, RSA) depend on functions that are known to all, but whose inverses are known only to a chosen few, and would take one too long a time to figure out on one's own. For example, these functions can be such that their inverses can be computed only if certain large integers are factorized. While many difficult computational problems outside number theory are known, most working encryption protocols nowadays are based on the difficulty of a few number-theoretical problems.

Some things may not be computable at all; in fact, this can be proven in some instances. For instance, in 1970, it was proven, as a solution to Hilbert's tenth problem, that there is no Turing machine which can solve all Diophantine equations.^[87] In particular, this means that, given a computably enumerable set of axioms, there are Diophantine equations for which there is no proof, starting from the axioms, of whether the set of equations has or does not have integer solutions. (i.e., Diophantine equations for which there are no integer solutions, since, given a Diophantine equation with at least one solution, the solution itself provides a proof of the fact that a solution exists. It cannot be proven that a particular Diophantine equation is of this kind, since this would imply that it has no solutions.)

The number-theorist Leonard Dickson (1874–1954) said "Thank God that number theory is unsullied by any application". Such a view is no longer applicable to number theory.^[88] In 1974, Donald Knuth said "virtually every theorem in elementary number theory arises in a natural, motivated way in connection with the problem of making computers do high-speed numerical calculations".^[89] Elementary number theory is taught in discrete mathematics courses for computer scientists. It also has applications to the continuous in numerical analysis.^[90]

Number theory has now several modern applications spanning diverse areas such as:

• Cryptography: Public-key encryption schemes such as RSA are based on the difficulty of factoring large composite numbers into their prime factors.^[91]
• Computer science: The fast Fourier transform (FFT) algorithm, which is used to efficiently compute the discrete Fourier transform, has important applications in signal processing and data analysis.^[92]
• Physics: The Riemann hypothesis has connections to the distribution of prime numbers and has been studied for its potential implications in physics.^[93]
• Error correction codes: The theory of finite fields and algebraic geometry have been used to construct efficient error-correcting codes.^[94]
• Communications: The design of cellular telephone networks requires knowledge of the theory of modular forms, which is a part of analytic number theory.^[95]
• Study of musical scales: the concept of "equal temperament", which is the basis for most modern Western music, involves dividing the octave into 12 equal parts.^[96] This has been studied using number theory and in particular the properties of the 12th root of 2.

The American Mathematical Society awards the Cole Prize in Number Theory. Moreover, number theory is one of the three mathematical subdisciplines rewarded by the Fermat Prize.

• Algebraic function field
• Finite field
• p-adic number
• List of number theoretic algorithms

• This article incorporates material from the Citizendium article "Number theory", which is licensed under the Creative Commons Attribution-ShareAlike 3.0 Unported License but not under the GFDL.

Two of the most popular introductions to the subject are:

• G.H. Hardy; E.M. Wright (2008) [1938]. An introduction to the theory of numbers (rev. by D.R. Heath-Brown and J.H. Silverman, 6th ed.). Oxford University Press. ISBN 978-0-19-921986-5. Retrieved 2016-03-02.
• Vinogradov, I.M. (2003) [1954]. Elements of Number Theory (reprint of the 1954 ed.). Mineola, NY: Dover Publications.

Hardy and Wright's book is a comprehensive classic, though its clarity sometimes suffers due to the authors' insistence on elementary methods (Apostol 1981). Vinogradov's main attraction consists in its set of problems, which quickly lead to Vinogradov's own research interests; the text itself is very basic and close to minimal. Other popular first introductions are:

• Ivan M. Niven; Herbert S. Zuckerman; Hugh L. Montgomery (2008) [1960]. An introduction to the theory of numbers (reprint of the 5th 1991 ed.). John Wiley & Sons. ISBN 978-81-265-1811-1. Retrieved 2016-02-28.
• Kenneth H. Rosen (2010). Elementary Number Theory (6th ed.). Pearson Education. ISBN 978-0-321-71775-7. Retrieved 2016-02-28.

Popular choices for a second textbook include:

• Borevich, A. I.; Shafarevich, Igor R. (1966). Number theory. Pure and Applied Mathematics. Vol. 20. Boston, MA: Academic Press. ISBN 978-0-12-117850-5. MR 0195803.
• Serre, Jean-Pierre (1996) [1973]. A course in arithmetic. Graduate Texts in Mathematics. Vol. 7. Springer. ISBN 978-0-387-90040-7.

 

Wikimedia Commons has media related to Number theory.

 

Wikiquote has quotations related to Number theory.

• Number Theory entry in the Encyclopedia of Mathematics
• Number Theory Web