Number theory

Number theory is a branch of mathematics devoted primarily to the study of the integers. Any attempt to conduct such a study naturally leads to an examination of the properties of that which integers are made out of (namely, prime numbers) as well as the properties of objects made out of integers (such as rational numbers) or defined as generalisations of the integers (such as, for example, algebraic integers).

Integers can be considered either as such or as solutions to equations (diophantine geometry). Some of the main questions are those of distribution: questions, say, on patterns or their absence (in the primes or other sequences) or, more generally, questions on size, number and growth. Such matters are often best understood through the study of analytical objects (e.g., the Riemann zeta function) that encode them in some fashion (analytical number theory). One may also study real numbers in relation to rational numbers, e.g., as approximated by the latter (diophantine approximation).

The older term for number theory is arithmetic; it was superseded by "number theory" in the nineteenth century, though the adjective arithmetical is still fully current. By 1921, T. L. Heath had to explain: "By arithmetic Plato meant, not arithmetic in our sense, but the science which considers numbers in themselves, in other words, what we mean by the Theory of Numbers." The general public now uses arithmetic to mean elementary calculations, whereas mathematicians use arithmetic as this article shall, viz., as an older synonym for number theory. (The use of the term arithmetic for number theory has regained some ground since Heath's time, arguably in part due to French influence. In particular, arithmetic is preferred as an adjective to number-theoretic. Moreover, "the arithmetic of" is used, whereas "the number theory of" is not; thus, for example, the arithmetic of elliptic curves.)

Origins

The dawn of arithmetic

The first historical find of an arithmetical nature is a fragment of a table: the broken clay tablet Plimpton 322 (Larsa, Mesopotamia, ca. 1800 BCE) contains a list of "Pythagorean triples", i.e., integers $\scriptstyle (a,b,c)$ such that $\scriptstyle 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 substracted such that the width..."

The Plimpton 322 tablet.

The table's outlay suggests that it was constructed by means of what amounts, in modern language, to the identity

$\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. If some other method was used, the triples were first constructed and then reordered by $c/a$, presumably for actual use as a "table", i.e., with a view to applications.

We do not know what these applications may have been, or whether there could have been any; Babylonian astronomy, for example, truly flowered only later. It has been suggested instead that the table was a source of numerical examples for school problems.

While Babylonian number theory - or what survives of Babylonian mathematics that can be called thus - consists of this single, striking fragment, Babylonian algebra (in the secondary-school sense of "algebra") was exceptionally well developed. Late Neoplatonic sources state that Pythagoras learned mathematics from the Babylonians. (Much earlier sources state that Thales and Pythagoras travelled and studied in Egypt.)

Euclid IX 21--34 is very probably Pythagorean; it is very simple material ("odd times even is odd", "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 $\scriptstyle {\sqrt {2}}$ is irrational. (Pythagoraean mystics gave great importance to the odd and the even.) The discovery that $\scriptstyle {\sqrt {2}}$ is irrational is credited to the early Pythagoreans (pre-Theodorus). 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. It is only here that we can start to speak of a clear, conscious division between numbers (integers and the rationals - the subjects of arithmetic) and lengths (real numbers, whether rational or not).

The Pythagorean tradition spoke also of so-called polygonal or figured numbers. While square numbers, cubic numbers, etc., are seen now as more natural than triangular numbers, square 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 century).

We know of no clearly arithmetical material in ancient Egyptian or Vedic sources, though there is some algebra in both. The Chinese remainder theorem appears as an exercise in Sun Zi's Suan Ching (also known as Sun Tzu's Mathematical Classic; 3rd, 4th or 5th century CE.). (There is one important step glossed over in Sun Zi's solution: it is the problem that was later solved by Āryabhaṭa's kuṭṭaka - see below.)

There is also some numerical mysticism in Chinese mathematics, but, unlike that of the Pythagoreans, it seems to have led nowhere. Like the Pythagoreans' perfect numbers, magic squares have passed from superstition into recreation.

Classical Greece and the early Hellenistic period

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. In the case of number theory, this means, large and by, Plato and Euclid, respectively.

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 we know that Theodorus had proven that $\scriptstyle {\sqrt {3}},{\sqrt {5}},\dots ,{\sqrt {17}}$ are irrational. Theaetetus was, like Plato, a disciple of Theodorus's; he worked on distinguishing different kind of inconmensurables, and was thus arguably a pioneer in the study of number systems. (Book X of Euclid 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 thereto; in particular, he gave the first known proof of the infinitude of primes ...

Archimedes and the cattle problem...

Diophantus

Very little is known about Diophantus of Alexandria; he probably lived in the third century CE, that is, about five hundred years after Euclid. Six out of the thirteen books of Diophantus's Arithmetica survive in the original Greek; four more books 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 $\scriptstyle f(x,y)=z^{2}$ or $\scriptstyle f(x,y,z)=w^{2}$. Thus, nowadays, we speak of Diophantine equations when we speak of polynomial equations to which rational or integer solutions must be found.

One may say that Diophantus was studying rational points -- i.e., points whose coordinates are rational -- on curves and varieties; however, unlike the Greeks of the Classical period, who did what we would now call basic algebra in geometrical terms, Diophantus did what we would now call basic algebraic geometry in purely algebraic terms. In modern language, what Diophantus does is to find rational parametrisations of many varieties; in other words, he shows how to obtain infinitely many rational numbers satisfying a system of equations by giving a procedure that can be made into an algebraic expression (say, $\scriptstyle x=g_{1}(r,s)$, $\scriptstyle y=g_{2}(r,s)$, $\scriptstyle z=g_{3}(r,s)$, where $\scriptstyle g_{1}$, $\scriptstyle g_{2}$ and $\scriptstyle g_{3}$ are polynomials or quotients of polynomials; this would be what is sought for if such $\scriptstyle x,y,z$ satisfied a given equation $\scriptstyle f(x,y)=z^{2}$ (say) for all values of r and s).

Diophantus also studies the equations of some non-rational curves, for which no rational parametrisation is possible. He manages to find some rational points on these curves -- elliptic curves, as it happens, in what seems to be their first known occurrence -- by means of what amounts to a tangent construction: translated into coordinate geometry (which did not exist in Diophantus's time), his method would be visualised as drawing a tangent to a curve at a known rational point, and then finding the other point of intersection of the tangent with the curve; that other point is a new rational point. (Diophantus also resorts to what could be called a special case of a secant construction.)

While Diophantus is concerned largely with rational solutions, he assumes some results on integer numbers; in particular, he seems to assume that every integer is the sum of four squares, though he never states as much explicitly.

The Indian school: Āryabhaṭa, Brahmagupta, Bhāskara

Āryabhaṭa (476–550 CE) showed that pairs of simultaneous congruences $\scriptstyle n\equiv a_{1}{\text{ mod }}m_{1}$, $\scriptstyle n\equiv a_{2}{\text{ mod }}m_{2}$ could be solved by a method he called kuṭṭaka, or pulveriser; this is a procedure close to (a generalisation of) the Euclidean algorithm. He seems to have had in mind applications to astronomical calculations.

Brahmagupta (628 CE) started the systematic study of indefinite quadratic equations -- in particular, the misnamed Pell equation, in which Archimedes may have first been interested. Later Sanskrit authors would follow, using Brahmagupta's technical terminology. A general method (the chakravala) for solving Pell's equation was finally found by Jayadeva (cited in the eleventh century; his work is otherwise lost) and Bhāskara II (twelfth century).

Arithmetic in the Islamic golden age

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, generally presumed to be Brahmagupta's Brāhmasphuţasiddhānta), thus giving rise to the rich tradition of Islamic mathematics. 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. Al-Karajī's contemporary Ibn al-Haytham knew what would later be called Wilson's theorem, which, arguably, was thus the first clearly non-trivial result on congruences to prime moduli ever known.

Other than a treatise on squares in arithmetic progression by Fibonacci - who lived and studied in north Africa and Constantinople during his formative years, ca. 1175-1200 - no number theory to speak of was done in western Europe while it went through the Middle Ages. Matters started to change in Europe in the late Rennaissance, thanks to a renewed study of the works of Greek antiquity. A key catalyst was the textual emendation and translation into Latin of Diophantus's Arithmetica (Bachet, 1621).

Early modern number theory

Fermat

Pierre de Fermat (1601 - 1665) never published his writings; in particular, his work on number theory is contained entirely in letters to mathematicians and in private marginal notes. He wrote down nearly no proofs in number theory; he had no models in the area. He did make repeated use of mathematical induction, introducing the method of infinite descent.

One of Fermat's first interests was perfect numbers (which appear in Euclid, Elements IX) and amicable numbers; this 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. He had already studied Bachet's edition of Diophantus carefully; by 1643, his interests had shifted largely to diophantine problems and sums of squares (also treated by Diophantus).

Fermat's achievements in arithmetic include:

• Fermat's little theorem (1640), stating that, if a is not divisible by a prime p, then $\scriptstyle a^{p-1}\equiv 1{\text{ mod }}p.$

This is a consequence of the fact that the order of an element of a group divides the order of the group. The modern proof would have been within Fermat's means (and was indeed given later by Euler), even though the modern concept of a group came long after Fermat or Euler. (It helps to know that inverses exist modulo p (i.e., given a not divisible by a prime p, there is an integer x such that $\scriptstyle xa\equiv 1{\text{ mod }}p$); this fact (which, in modern language, makes the residues mod p into a group, and which was already known to Āryabhaṭa; see above) was familiar to Fermat thanks to its rediscovery by Bachet.

(to be continued)

Number theory as it is now

Analytic number theory

Analytic number theory is generally held to denote the study of problems in number theory by analytic means, i.e., by the tools of calculus. Some would emphasize the use of complex analysis: the study of the Riemann zeta function and other L-functions can be seen as the epitome of analytic number theory. At the same time, the subfield is often held to cover studies of elementary problems by elementary means, e.g., the study of the divisors of a number without the use of analysis, or the application of sieve methods. A problem in number theory can be said to be analytic simply if it involves statements on quantity or distribution, or if the ordering of the objects studied (e.g., the primes) is crucial. Several different senses of the word analytic are thus conflated in the designation analytic number theory as it is commonly used.

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).

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 (generalisations of prime numbers living 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 generalisations of the Riemann zeta function, an all-important analytic object that controls the distribution of prime numbers.

Algebraic number theory

Algebraic number theory studies number theory using algebraic techniques drawn from group theory and field theory. A principal topic of study is that of the algebraic numbers, which are generalisations of the rational numbers. (Briefly, an algebraic number is any complex number that is a solution to some polynomial equation $\scriptstyle f(x)=0$ with rational coefficients; for example, every solution $x$ of $\scriptstyle 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.

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 $\scriptstyle a+b{\sqrt {d}}$, where $a$ and $b$ are rational numbers and $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 as we know it were set in the late nineteenth century, when ideal numbers, the theory of ideals and valuation theory were developed; 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 $\scriptstyle {\sqrt {-5}}$, the number $6$ can be factorised both as $\scriptstyle 6=2\cdot 3$ and $\scriptstyle 6=(1+{\sqrt {-5}})(1-{\sqrt {-5}})$; all of $2$, $3$, $\scriptstyle 1+{\sqrt {-5}}$ and $\scriptstyle 1-{\sqrt {-5}}$ are irreducible, and thus, in a naïve sense, analogous to primes among the integers.) A failure of awareness of this lack had led to an early erroneous "proof" of Fermat's Last Theorem by G. Lamé; the realisation that this proof was erroneous made others study the consequences of this lack, and ways in which it could be alleviated.

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 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.

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.

Diophantine geometry

Consider an equation or system of equations. Does it have rational or integer solutions, and if so, how many? This is the central question of Diophantine geometry.

We may think of this question in the following graphic way. 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. We are asking whether there are any rational points (points all of whose coordinates are rationals) or integer points (points all of whose coordinates are integers) on the curve or surface. If there are any such points on the curve or surface, we may ask how many there are and how they are distributed. Most importantly: are there finitely or infinitely many rational points on a given curve (or surface)? What about integer points?

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

The rephrasing of questions on equations in terms of points on curves turns out to be 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 $f(x,y)=0$, where $f$ is a polynomial in two variables - turns out to depend crucially on the genus of the curve. The genus can be defined as follows: allow the variables in $f(x,y)=0$ to be complex numbers; then $f(x,y)=0$ defines a 2-dimensional surface in 4-dimensional surface; count the number of (doughnut) holes in the surface; call this number the genus of $f(x,y)=0$. Other geometrical notions turn out to be just as crucial.

There is also the closely linked area of diophantine approximations: given a number $x$, how well can it be approximated by rationals? (We are looking for approximations that are good relative to the amount of space that it takes to write the rational: call $a/q$ (with $gcd(a,q)=1$) a good approximation to $x$ if $\scriptstyle |x-a/q|<{\frac {1}{q^{c}}}$, where $c$ is large.) This question is of special interest if $x$ is an algebraic number. If $x$ cannot be well approximated, then some equations do not have integer or rational solutions. Moreover, several concepts (especially that of height) turn out to be crucial both in diophantine geometry and in the study of diophantine approximations.

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 combinatorics

Let $A$ be a set of integers. Consider the set $A+A$ consisting of all sums of two elements of $A$. Is $A+A$ much larger than A? Barely larger? If $A+A$ is barely larger than $A$, must $A$ have plenty of arithmetic structure - e.g., does it look like an arithmetic progression?

If we begin from a fairly "thick" infinite set $A$ (say, the primes), does it contain many elements in arithmetic progression: $a$, $a+b$, $a+2b$, $a+3b$, ... , $a+10b$, say? Should it be possible to write large integers as sums of elements of $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 $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 make the strengthening of links with ergodic theory likely. The term additive combinatorics is also used; however, the sets $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 $A+A$ and $A$·$A$ may be compared.

Probabilistic number theory

Take a number 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. Very well; ask further: how many prime divisors will it have, on average? How many divisors will it have altogether, and with what likelihood? What is the probability that it 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 $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.

Computations in number theory

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.

There are two main questions: "can we compute this?" and "can we compute it rapidly?". Anybody can test whether a number is prime or, if it is not, split it into prime factors; doing so rapidly is another matter. We now know fast algorithms for testing primality, but, in spite of much work, no truly fast algorithm for factoring.

The difficulty of a computation can be useful: modern protocols for encrypting messages depend on functions that are known to all, but whose inverses (a) are known only to a chosen few, and (b) 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 factorised. 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.

On a different note - some things may not be computable at all; in fact, this can be proven. For instance, Turing showed in 1936 that there is no algorithm for deciding in finite time whether a given algorithm ends in finite time. In 1970, it was proven that there is no algorithm for solving any and all Diophantine equations. There are thus some problems in number theory that will never be solved. We even know the shape of some of them, viz., Diophantine equations in nine variables; we simply do not know, and cannot know, which coefficients give us equations for which the following two statements are both true: there are no solutions, and we shall never know that there are no solutions.

Problems solved and unsolved

The beginnings

What are the integers x, y, z such that $\scriptstyle x^{2}+y^{2}=z^{2}$?

A scribe from Larsa (1800 BCE) almost certainly had a full solution. The late source Proclus credits Pythagoras with the partial solution $\scriptstyle (x,(x^{2}-1)/2,(x^{2}+1)/2)$, where $x$ ranges on the odd integers. He also credits Plato with a closely related rule. A general solution makes its first fully explicit appearance in Euclid's Elements (Book X, Lemma 1).

Are there incommensurable line segments? (In our language: are there irrational numbers?)

Yes (early Pythagoreans, before Plato's day). The question belongs to the history of number systems at least as much as it belongs here. The proof in Euclid's Elements is purely arithmetical; nothing besides the "theory of the odd and the even" (likely early Pythagorean) is needed.

Are there infinitely many prime numbers?

Yes (Euclid).

Given two integers, find the largest integer that divides them both.

Euclid's algorithm does the job. It also provides the basis for the standard method for finding integer solutions to linear equations in two variables. Such equations, however, were not addressed by Euclid; the first algorithm found for solving them was Āryabhaṭa's kuṭṭaka (see below).

Diophantus

India

Fermat

Euler

Questions directing current research

References

External links

• Number Theory Web
• The Mathematical Atlas - 11: Number theory