pure mathematics
Pure mathematics is the study of mathematical concepts independently of any application outside mathematics. These concepts may originate in real-world concerns, and the results obtained may later turn out to be useful for practical applications ...
devoted primarily to the study of the
integer
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 in ...
prime number
A prime number (or a prime) is a natural number greater than 1 that is not a Product (mathematics), 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 ...
s as well as the properties of
mathematical object
A mathematical object is an abstract concept arising in mathematics. Typically, a mathematical object can be a value that can be assigned to a Glossary of mathematical symbols, symbol, and therefore can be involved in formulas. Commonly encounter ...
s constructed from integers (for example,
rational number
In mathematics, a rational number is a number that can be expressed as the quotient or fraction of two integers, a numerator and a non-zero denominator . For example, is a rational number, as is every integer (for example,
The set of all ...
s), or defined as generalizations of the integers (for example, algebraic integers).
Integers can be considered either in themselves or as solutions to equations ( Diophantine geometry). Questions in number theory can often be understood through the study of analytical objects, such as the Riemann zeta function, that encode properties of the integers, primes or other number-theoretic objects in some fashion (
analytic number theory
In mathematics, analytic number theory is a branch of number theory that uses methods from mathematical analysis to solve problems about the integers. It is often said to have begun with Peter Gustav Lejeune Dirichlet's 1837 introduction of Dir ...
). One may also study
real number
In mathematics, a real number is a number that can be used to measure a continuous one- dimensional quantity such as a duration or temperature. Here, ''continuous'' means that pairs of values can have arbitrarily small differences. Every re ...
s in relation to rational numbers, as for instance how irrational numbers can be approximated by fractions (
Diophantine approximation
In number theory, the study of Diophantine approximation deals with the approximation of real numbers by rational numbers. It is named after Diophantus of Alexandria.
The first problem was to know how well a real number can be approximated ...
).
Number theory is one of the oldest branches of mathematics alongside geometry. One quirk of number theory is that it deals with statements that are simple to understand but are very difficult to solve. Examples of this are
Fermat's Last Theorem
In number theory, Fermat's Last Theorem (sometimes called Fermat's conjecture, especially in older texts) states that no three positive number, positive integers , , and satisfy the equation for any integer value of greater than . The cases ...
, which was proved 358 years after the original formulation, and
Goldbach's conjecture
Goldbach's conjecture is one of the oldest and best-known list of unsolved problems in mathematics, unsolved problems in number theory and all of mathematics. It states that every even and odd numbers, even natural number greater than 2 is the ...
, which remains unsolved since the 18th century. German mathematician
Carl Friedrich Gauss
Johann Carl Friedrich Gauss (; ; ; 30 April 177723 February 1855) was a German mathematician, astronomer, geodesist, and physicist, who contributed to many fields in mathematics and science. He was director of the Göttingen Observatory and ...
(1777–1855) said, "Mathematics is the queen of the sciences—and number theory is the queen of mathematics." It was regarded as the example of pure mathematics with no applications outside mathematics until the 1970s, when it became known that prime numbers would be used as the basis for the creation of
public-key cryptography
Public-key cryptography, or asymmetric cryptography, is the field of cryptographic systems that use pairs of related keys. Each key pair consists of a public key and a corresponding private key. Key pairs are generated with cryptographic alg ...
algorithms.
History
Number theory is the branch of mathematics that studies
integers
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 in ...
and their properties and relations. The integers comprise a set that extends the set of natural numbers to include number and the negation of natural numbers . Number theorists study prime numbers as well as the properties of mathematical objects constructed from integers (for example,
rational numbers
In mathematics, a rational number is a number that can be expressed as the quotient or fraction (mathematics), fraction of two integers, a numerator and a non-zero denominator . For example, is a rational number, as is every integer (for examp ...
), or defined as generalizations of the integers (for example, algebraic integers).
Number theory is closely related to arithmetic and some authors use the terms as synonyms. However, the word "arithmetic" is used today to mean the study of numerical operations and extends to the
real numbers
In mathematics, a real number is a number that can be used to measurement, measure a continuous variable, continuous one-dimensional quantity such as a time, duration or temperature. Here, ''continuous'' means that pairs of values can have arbi ...
. In a more specific sense, number theory is restricted to the study of integers and focuses on their properties and relationships. Traditionally, it is known as higher arithmetic. By the early twentieth century, the term ''number theory'' had been widely adopted.The term 'arithmetic' may have regained some ground, arguably due to French influence. Take, for example, . In 1952, Davenport still had to specify that he meant ''The Higher Arithmetic''. Hardy and Wright wrote in the introduction to '' An Introduction to the Theory of Numbers'' (1938): "We proposed at one time to change he titleto ''An introduction to arithmetic'', a more novel and in some ways a more appropriate title; but it was pointed out that this might lead to misunderstandings about the content of the book." The term number means whole numbers, which refers to either the natural numbers or the integers.Elementary number theory studies aspects of integers that can be investigated using elementary methods such as elementary proofs.
Analytic number theory
In mathematics, analytic number theory is a branch of number theory that uses methods from mathematical analysis to solve problems about the integers. It is often said to have begun with Peter Gustav Lejeune Dirichlet's 1837 introduction of Dir ...
, by contrast, relies on complex numbers and techniques from analysis and calculus.
Algebraic number theory
Algebraic number theory is a branch of number theory that uses the techniques of abstract algebra to study the integers, rational numbers, and their generalizations. Number-theoretic questions are expressed in terms of properties of algebraic ob ...
The earliest historical find of an arithmetical nature is a fragment of a table: Plimpton 322 (
Larsa
Larsa (, read ''Larsamki''), also referred to as Larancha/Laranchon (Gk. Λαραγχων) by Berossus, Berossos and connected with the biblical Arioch, Ellasar, was an important city-state of ancient Sumer, the center of the Cult (religious pra ...
, Mesopotamia, c. 1800 BC), a broken clay tablet, contains a list of " Pythagorean triples", that is, integers such that . The triples are too numerous and too large to have been obtained by brute force. The heading over the first column reads: "The of the diagonal which has been subtracted such that the width..."
The table's layout suggests that it was constructed by means of what amounts, in modern language, to the identity
which is implicit in routine Old Babylonian exercises. If some other method was used, the triples were first constructed and then reordered by , 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
Babylonian astronomy was the study or recording of celestial objects during the early history of Mesopotamia. The numeral system used, sexagesimal, was based on 60, as opposed to ten in the modern decimal system. This system simplified the ca ...
, for example, truly came into its own many centuries later. It has been suggested instead that the table was a source of numerical examples for school problems.. This is controversial. See Plimpton 322. Robson's article is written polemically with a view to "perhaps ..knocking limpton 322off its pedestal" ; at the same time, it settles to the conclusion that
..the question "how was the tablet calculated?" does not have to have the same answer as the question "what problems does the tablet set?" The first can be answered most satisfactorily by reciprocal pairs, as first suggested half a century ago, and the second by some sort of right-triangle problems .
Robson takes issue with the notion that the scribe who produced Plimpton 322 (who had to "work for a living", and would not have belonged to a "leisured middle class") could have been motivated by his own "idle curiosity" in the absence of a "market for new mathematics". Plimpton 322 tablet is the only surviving evidence of what today would be called number theory within Babylonian mathematics, though a kind of Babylonian algebra was much more developed.
Ancient Greece
Although other civilizations probably influenced Greek mathematics at the beginning, all evidence of such borrowings appear relatively late,Iamblichus, ''Life of Pythagoras'',(trans., for example, ) cited in . See also Porphyry, ''Life of Pythagoras'', paragraph 6, in Herodotus (II. 81) and Isocrates (''Busiris'' 28), cited in: . On Thales, see Eudemus ap. Proclus, 65.7, (for example, ) cited in: . Proclus was using a work by Eudemus of Rhodes (now lost), the ''Catalogue of Geometers''. See also introduction, on Proclus's reliability. and it is likely that Greek (the theoretical or philosophical study of numbers) is an indigenous tradition. Aside from a few fragments, most of what is known about Greek mathematics in the 6th to 4th centuries BC (the Archaic and Classical periods) comes through either the reports of contemporary non-mathematicians or references from mathematical works in the early
Hellenistic period
In classical antiquity, the Hellenistic period covers the time in Greek history after Classical Greece, between the death of Alexander the Great in 323 BC and the death of Cleopatra VII in 30 BC, which was followed by the ascendancy of the R ...
. In the case of number theory, this means largely
Plato
Plato ( ; Greek language, Greek: , ; born BC, died 348/347 BC) was an ancient Greek philosopher of the Classical Greece, Classical period who is considered a foundational thinker in Western philosophy and an innovator of the writte ...
,
Aristotle
Aristotle (; 384–322 BC) was an Ancient Greek philosophy, Ancient Greek philosopher and polymath. His writings cover a broad range of subjects spanning the natural sciences, philosophy, linguistics, economics, politics, psychology, a ...
, and
Euclid
Euclid (; ; BC) was an ancient Greek mathematician active as a geometer and logician. Considered the "father of geometry", he is chiefly known for the '' Elements'' treatise, which established the foundations of geometry that largely domina ...
.
Plato had a keen interest in mathematics, and distinguished clearly between and calculation (). Plato reports in his dialogue '' Theaetetus'' that Theodorus had proven that are irrational. Theaetetus, a disciple of Theodorus's, worked on distinguishing different kinds of incommensurables, and was thus arguably a pioneer in the study of number systems. Aristotle further claimed that the philosophy of Plato closely followed the teachings of the Pythagoreans, and Cicero repeats this claim: ("They say Plato learned all things Pythagorean").
Euclid devoted part of his '' Elements'' (Books VII–IX) to topics that belong to elementary number theory, including prime numbers and
divisibility
In mathematics, a divisor of an integer n, also called a factor of n, is an integer m that may be multiplied by some integer to produce n. In this case, one also says that n is a ''Multiple (mathematics), multiple'' of m. An integer n is divis ...
. He gave an algorithm, the Euclidean algorithm, for computing the greatest common divisor of two numbers (Prop. VII.2) and a proof implying the infinitude of primes (Prop. IX.20). There is also older material likely based on Pythagorean teachings (Prop. IX.21–34), such as "odd times even is even" and "if an odd number measures dividesan even number, then it also measures divideshalf of it"., cited in: . This is all that is needed to prove that is irrational. Pythagoreans apparently gave great importance to the odd and the even. The discovery that is irrational is credited to the early Pythagoreans, sometimes assigned to Hippasus, who was expelled or split from the Pythagorean community as a result.Plato, ''Theaetetus'', p. 147 B, (for example, ), cited
in : "Theodorus was writing out for us something about roots, such as the roots of three or five, showing that they are incommensurable by the unit;..." See also Spiral of Theodorus. This forced a distinction between ''
number
A number is a mathematical object used to count, measure, and label. The most basic examples are the natural numbers 1, 2, 3, 4, and so forth. Numbers can be represented in language with number words. More universally, individual numbers can ...
s'' (integers and the rationals—the subjects of arithmetic) and ''lengths'' and ''proportions'' (which may be identified with real numbers, whether rational or not).
The Pythagorean tradition also spoke of so-called
polygonal
In geometry, a polygon () is a plane (mathematics), plane Shape, figure made up of line segments connected to form a closed polygonal chain.
The segments of a closed polygonal chain are called its ''edge (geometry), edges'' or ''sides''. The p ...
early modern period
The early modern period is a Periodization, historical period that is defined either as part of or as immediately preceding the modern period, with divisions based primarily on the history of Europe and the broader concept of modernity. There i ...
(17th to early 19th centuries).
An epigram published by Lessing in 1773 appears to be a letter sent by
Archimedes
Archimedes of Syracuse ( ; ) was an Ancient Greece, Ancient Greek Greek mathematics, mathematician, physicist, engineer, astronomer, and Invention, inventor from the ancient city of Syracuse, Sicily, Syracuse in History of Greek and Hellenis ...
to Eratosthenes. 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 Indian mathematicians. It is not known whether Archimedes himself had a method of solution.
= Late Antiquity
=
Aside from the elementary work of Neopythagoreans such as Nicomachus and Theon of Smyrna, the foremost authority in in Late Antiquity was Diophantus of Alexandria, who probably lived in the 3rd century AD, approximately five hundred years after Euclid. Little is known about his life, but he wrote two works that are extant: ''On Polygonal Numbers'', a short treatise written in the Euclidean manner on the subject, and the '' Arithmetica'', a work on pre-modern algebra (namely, the use of algebra to solve numerical problems). Six out of the thirteen books of Diophantus's ''Arithmetica'' survive in the original Greek and four more survive in an Arabic translation. The ' 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 or . In modern parlance, Diophantine equations are polynomial equations to which rational or integer solutions are sought.
Asia
The
Chinese remainder theorem
In mathematics, the Chinese remainder theorem states that if one knows the remainders of the Euclidean division of an integer ''n'' by several integers, then one can determine uniquely the remainder of the division of ''n'' by the product of thes ...
appears as an exercise in '' Sunzi Suanjing'' (between the third and fifth centuries).The date of the text has been narrowed down to 220–420 AD (Yan Dunjie) or 280–473 AD (Wang Ling) through internal evidence (= taxation systems assumed in the text). See . (There is one important step glossed over in Sunzi's solution:''Sunzi Suanjing'', Ch. 3, Problem 26,
in :
6Now there are an unknown number of things. If we count by threes, there is a remainder 2; if we count by fives, there is a remainder 3; if we count by sevens, there is a remainder 2. Find the number of things. ''Answer'': 23.
''Method'': If we count by threes and there is a remainder 2, put down 140. If we count by fives and there is a remainder 3, put down 63. If we count by sevens and there is a remainder 2, put down 30. Add them to obtain 233 and subtract 210 to get the answer. If we count by threes and there is a remainder 1, put down 70. If we count by fives and there is a remainder 1, put down 21. If we count by sevens and there is a remainder 1, put down 15. When numberexceeds 106, the result is obtained by subtracting 105.
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'' which was translated into English in early nineteenth century by British missionary Alexander Wylie. There is also some numerical mysticism in Chinese mathematics,See, for example, ''Sunzi Suanjing'', Ch. 3, Problem 36, in :
6Now there is a pregnant woman whose age is 29. If the gestation period is 9 months, determine the sex of the unborn child. ''Answer'': Male.
''Method'': Put down 49, add the gestation period and subtract the age. From the remainder take away 1 representing the heaven, 2 the earth, 3 the man, 4 the four seasons, 5 the five phases, 6 the six pitch-pipes, 7 the seven stars f the Dipper 8 the eight winds, and 9 the nine divisions f China under Yu the Great If the remainder is odd,
he sex
He or HE may refer to:
Language
* He (letter), the fifth letter of the Semitic abjads
* He (pronoun), a pronoun in Modern English
* He (kana), one of the Japanese kana (へ in hiragana and ヘ in katakana)
* Ge (Cyrillic), a Cyrillic letter ca ...
is male and if the remainder is even,
he sex
He or HE may refer to:
Language
* He (letter), the fifth letter of the Semitic abjads
* He (pronoun), a pronoun in Modern English
* He (kana), one of the Japanese kana (へ in hiragana and ヘ in katakana)
* Ge (Cyrillic), a Cyrillic letter ca ...
is female.
This is the last problem in Sunzi's otherwise matter-of-fact treatise. but, unlike that of the Pythagoreans, it seems to have led nowhere.
While Greek astronomy probably influenced Indian learning, to the point of introducing
trigonometry
Trigonometry () is a branch of mathematics concerned with relationships between angles and side lengths of triangles. In particular, the trigonometric functions relate the angles of a right triangle with ratios of its side lengths. The fiel ...
, it seems to be the case that Indian mathematics is otherwise an autochthonous tradition;Any early contact between Babylonian and Indian mathematics remains conjectural . in particular, there is no evidence that Euclid's ''Elements'' reached India before the eighteenth century. Āryabhaṭa (476–550 AD) showed that pairs of simultaneous congruences , could be solved by a method he called ''kuṭṭaka'', or ''pulveriser''; this is a procedure close to (a generalization of) the Euclidean algorithm, which was probably discovered independently in India. Āryabhaṭa seems to have had in mind applications to astronomical calculations.
Brahmagupta (628 AD) started the systematic study of indefinite quadratic equations—in particular, the misnamed Pell equation, in which
Archimedes
Archimedes of Syracuse ( ; ) was an Ancient Greece, Ancient Greek Greek mathematics, mathematician, physicist, engineer, astronomer, and Invention, inventor from the ancient city of Syracuse, Sicily, Syracuse in History of Greek and Hellenis ...
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).
Indian mathematics remained largely unknown in Europe until the late eighteenth century; Brahmagupta and Bhāskara's work was translated into English in 1817 by Henry Colebrooke.
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'', which may or may not, and , cited in . 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 – c. 1029) builds on it to some extent. According to Rashed Roshdi, Al-Karajī's contemporary Ibn al-Haytham knew what would later be called Wilson's theorem.
Western Europe in the Middle Ages
Other than a treatise on squares in arithmetic progression by
Fibonacci
Leonardo Bonacci ( – ), commonly known as Fibonacci, was an Italians, Italian mathematician from the Republic of Pisa, considered to be "the most talented Western mathematician of the Middle Ages".
The name he is commonly called, ''Fibonacci ...
—who traveled and studied in north Africa and
Constantinople
Constantinople (#Names of Constantinople, see other names) was a historical city located on the Bosporus that served as the capital of the Roman Empire, Roman, Byzantine Empire, Byzantine, Latin Empire, Latin, and Ottoman Empire, Ottoman empire ...
—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
The Renaissance ( , ) is a Periodization, period of history and a European cultural movement covering the 15th and 16th centuries. It marked the transition from the Middle Ages to modernity and was characterized by an effort to revive and sur ...
, thanks to a renewed study of the works of Greek antiquity. A catalyst was the textual emendation and translation into Latin of Diophantus' ''Arithmetica''.
Early modern number theory
Fermat
Pierre de Fermat
Pierre de Fermat (; ; 17 August 1601 – 12 January 1665) was a French mathematician who is given credit for early developments that led to infinitesimal calculus, including his technique of adequality. In particular, he is recognized for his d ...
(1607–1665) never published his writings but communicated through correspondence instead. Accordingly, his work on number theory is contained almost entirely in letters to mathematicians and in private marginal notes. Although he drew inspiration from classical sources, in his notes and letters Fermat scarcely wrote any proofs—he had no models in the area.
Over his lifetime, Fermat made the following contributions to the field:
* One of Fermat's first interests was
perfect number
In number theory, a perfect number is a positive integer that is equal to the sum of its positive proper divisors, that is, divisors excluding the number itself. For instance, 6 has proper divisors 1, 2 and 3, and 1 + 2 + 3 = 6, so 6 is a perfec ...
s (which appear in Euclid, ''Elements'' IX) and amicable numbers;Perfect and especially amicable numbers are of little or no interest nowadays. The same was not true in earlier times—whether in the West or the Arab-speaking world—due in part to the importance given to them by the Neopythagorean Nicomachus (c. 100 AD), who wrote a very elementary but influential book entitled ''
Introduction to Arithmetic
Nicomachus of Gerasa (; ) was an Ancient Greek Neopythagoreanism, Neopythagorean philosopher from Gerasa, in the Syria (Roman province), Roman province of Syria (now Jerash, Jordan). Like many Pythagoreans, Nicomachus wrote about the mystical pr ...
''. See . 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.
* In 1638, Fermat claimed, without proof, that all whole numbers can be expressed as the sum of four squares or fewer.
* Fermat's little theorem (1640): if ''a'' is not divisible by a prime ''p'', then Here, as usual, given two integers ''a'' and ''b'' and a non-zero integer ''m'', we write (read "''a'' is congruent to ''b'' modulo ''m''") to mean that ''m'' divides ''a'' − ''b'', or, what is the same, ''a'' and ''b'' leave the same residue when divided by ''m''. This notation is actually much later than Fermat's; it first appears in section 1 of
Gauss
Johann Carl Friedrich Gauss (; ; ; 30 April 177723 February 1855) was a German mathematician, astronomer, Geodesy, geodesist, and physicist, who contributed to many fields in mathematics and science. He was director of the Göttingen Observat ...
's '. Fermat's little theorem is a consequence of the
fact
A fact is a truth, true data, datum about one or more aspects of a circumstance. Standard reference works are often used to Fact-checking, check facts. Science, Scientific facts are verified by repeatable careful observation or measurement by ...
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'', that is, given ''a'' not divisible by a prime ''p'', there is an integer ''x'' such that ); 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 . Weil goes on to say that Fermat would have recognised that Bachet's argument is essentially Euclid's algorithm.
* If ''a'' and ''b'' are
coprime
In number theory, two integers and are coprime, relatively prime or mutually prime if the only positive integer that is a divisor of both of them is 1. Consequently, any prime number that divides does not divide , and vice versa. This is equiv ...
, then is not divisible by any prime congruent to −1 modulo 4; and every prime congruent to 1 modulo 4 can be written in the form . 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.
* In 1657, Fermat posed the problem of solving as a challenge to English mathematicians. The problem was solved in a few months by Wallis and Brouncker. 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) that has no non-trivial solutions in the integers. Fermat also mentioned to his correspondents that has no non-trivial solutions, and that this could also be proven by infinite descent. The first known proof is due to Euler (1753; indeed by infinite descent).
* Fermat claimed (
Fermat's Last Theorem
In number theory, Fermat's Last Theorem (sometimes called Fermat's conjecture, especially in older texts) states that no three positive number, positive integers , , and satisfy the equation for any integer value of greater than . The cases ...
) to have shown there are no solutions to for all ; this claim appears in his annotations in the margins of his copy of Diophantus.
Euler
The interest of
Leonhard Euler
Leonhard Euler ( ; ; ; 15 April 170718 September 1783) was a Swiss polymath who was active as a mathematician, physicist, astronomer, logician, geographer, and engineer. He founded the studies of graph theory and topology and made influential ...
(1707–1783) in number theory was first spurred in 1729, when a friend of his, the amateurUp to the second half of the seventeenth century, academic positions were very rare, and most mathematicians and scientists earned their living in some other way . (There were already some recognisable features of professional ''practice'', viz., seeking correspondents, visiting foreign colleagues, building private libraries . Matters started to shift in the late seventeenth century ; scientific academies were founded in England (the
Royal Society
The Royal Society, formally The Royal Society of London for Improving Natural Knowledge, is a learned society and the United Kingdom's national academy of sciences. The society fulfils a number of roles: promoting science and its benefits, re ...
Russia
Russia, or the Russian Federation, is a country spanning Eastern Europe and North Asia. It is the list of countries and dependencies by area, largest country in the world, and extends across Time in Russia, eleven time zones, sharing Borders ...
(1724). Euler was offered a position at this last one in 1726; he accepted, arriving in St. Petersburg in 1727 ( and
).
In this context, the term ''amateur'' usually applied to Goldbach is well-defined and makes some sense: he has been described as a man of letters who earned a living as a spy ; cited in ). Notice, however, that Goldbach published some works on mathematics and sometimes held academic positions.Goldbach, pointed him towards some of Fermat's work on the subject. This has been called the "rebirth" of modern number theory, after Fermat's relative lack of success in getting his contemporaries' attention for the subject. Euler's work on number theory includes the following:
* ''Proofs for Fermat's statements.'' This includes Fermat's little theorem (generalised by Euler to non-prime moduli); the fact that if and only if ; initial work towards a proof that every integer is the sum of four squares (the first complete proof is by
Joseph-Louis Lagrange
Joseph-Louis Lagrange (born Giuseppe Luigi LagrangiaPell's equation'', first misnamed by Euler.. Euler was generous in giving credit to others , not always correctly. He wrote on the link between continued fractions and Pell's equation.
* ''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
Complex analysis, traditionally known as the theory of functions of a complex variable, is the branch of mathematical analysis that investigates functions of complex numbers. It is helpful in many branches of mathematics, including algebraic ...
, 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.
* ''Quadratic forms''. Following Fermat's lead, Euler did further research on the question of which primes can be expressed in the form , some of it prefiguring
quadratic reciprocity
In number theory, the law of quadratic reciprocity is a theorem about modular arithmetic that gives conditions for the solvability of quadratic equations modulo prime numbers. Due to its subtlety, it has many formulations, but the most standard st ...
.
* ''Diophantine equations''. Euler worked on some Diophantine equations of genus 0 and 1. 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. He did notice there was a connection between Diophantine problems and
elliptic integral
In integral calculus, an elliptic integral is one of a number of related functions defined as the value of certain integrals, which were first studied by Giulio Fagnano and Leonhard Euler (). Their name originates from their originally arising i ...
s, whose study he had himself initiated.
Lagrange, Legendre, and Gauss
Joseph-Louis Lagrange
Joseph-Louis Lagrange (born Giuseppe Luigi Lagrangiafour-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 form
In mathematics, a quadratic form is a polynomial with terms all of degree two (" form" is another name for a homogeneous polynomial). For example,
4x^2 + 2xy - 3y^2
is a quadratic form in the variables and . The coefficients usually belong t ...
s in full generality (as opposed to ), including 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
In mathematics, the prime number theorem (PNT) describes the asymptotic analysis, asymptotic distribution of the prime numbers among the positive integers. It formalizes the intuitive idea that primes become less common as they become larger by p ...
Carl Friedrich Gauss
Johann Carl Friedrich Gauss (; ; ; 30 April 177723 February 1855) was a German mathematician, astronomer, geodesist, and physicist, who contributed to many fields in mathematics and science. He was director of the Göttingen Observatory and ...
(1777–1855) worked in a wide variety of fields in both mathematics and physics including number theory, analysis, differential geometry, geodesy, magnetism, astronomy and optics. The '' Disquisitiones Arithmeticae'' (1801), which he wrote three years earlier when he was 21, had an immense influence in the area of number theory and set its agenda for much of the 19th century. Gauss proved in this work the law of
quadratic reciprocity
In number theory, the law of quadratic reciprocity is a theorem about modular arithmetic that gives conditions for the solvability of quadratic equations modulo prime numbers. Due to its subtlety, it has many formulations, but the most standard st ...
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. 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.
In this way, Gauss arguably made forays towards
Évariste Galois
Évariste Galois (; ; 25 October 1811 – 31 May 1832) was a French mathematician and political activist. While still in his teens, he was able to determine a necessary and sufficient condition for a polynomial to be solvable by Nth root, ...
's work and the area
algebraic number theory
Algebraic number theory is a branch of number theory that uses the techniques of abstract algebra to study the integers, rational numbers, and their generalizations. Number-theoretic questions are expressed in terms of properties of algebraic ob ...
.
Maturity and division into subfields
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.
* The development of much of modern mathematics necessary for basic modern number theory:
complex analysis
Complex analysis, traditionally known as the theory of functions of a complex variable, is the branch of mathematical analysis that investigates functions of complex numbers. It is helpful in many branches of mathematics, including algebraic ...
,
group theory
In abstract algebra, group theory studies the algebraic structures known as group (mathematics), groups.
The concept of a group is central to abstract algebra: other well-known algebraic structures, such as ring (mathematics), rings, field ( ...
,
Galois theory
In mathematics, Galois theory, originally introduced by Évariste Galois, provides a connection between field (mathematics), field theory and group theory. This connection, the fundamental theorem of Galois theory, allows reducing certain problems ...
—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
In mathematics, more specifically algebra, abstract algebra or modern algebra is the study of algebraic structures, which are set (mathematics), sets with specific operation (mathematics), operations acting on their elements. Algebraic structur ...
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), whose proof introduced L-functions and involved some asymptotic analysis and a limiting process on a real variable. The first use of analytic ideas in number theory actually goes back to Euler (1730s), 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
Georg Friedrich Bernhard Riemann (; ; 17September 182620July 1866) was a German mathematician who made profound contributions to analysis, number theory, and differential geometry. In the field of real analysis, he is mostly known for the f ...
(1859) on the zeta function is the canonical starting point; 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 form
In mathematics, a modular form is a holomorphic function on the complex upper half-plane, \mathcal, that roughly satisfies a functional equation with respect to the group action of the modular group and a growth condition. The theory of modul ...
s).
The
American Mathematical Society
The American Mathematical Society (AMS) is an association of professional mathematicians dedicated to the interests of mathematical research and scholarship, and serves the national and international community through its publications, meetings, ...
awards the '' Cole Prize in Number Theory''. Moreover, number theory is one of the three mathematical subdisciplines rewarded by the '' Fermat Prize''.
Main subdivisions
Elementary number theory
Elementary number theory deals with the topics in number theory by means of basic methods in arithmetic. Its primary subjects of study are
divisibility
In mathematics, a divisor of an integer n, also called a factor of n, is an integer m that may be multiplied by some integer to produce n. In this case, one also says that n is a ''Multiple (mathematics), multiple'' of m. An integer n is divis ...
modular arithmetic
In mathematics, modular arithmetic is a system of arithmetic operations for integers, other than the usual ones from elementary arithmetic, where numbers "wrap around" when reaching a certain value, called the modulus. The modern approach to mo ...
addition
Addition (usually signified by the Plus and minus signs#Plus sign, plus symbol, +) is one of the four basic Operation (mathematics), operations of arithmetic, the other three being subtraction, multiplication, and Division (mathematics), divis ...
multiplication
Multiplication is one of the four elementary mathematical operations of arithmetic, with the other ones being addition, subtraction, and division (mathematics), division. The result of a multiplication operation is called a ''Product (mathem ...
exponentiation
In mathematics, exponentiation, denoted , is an operation (mathematics), operation involving two numbers: the ''base'', , and the ''exponent'' or ''power'', . When is a positive integer, exponentiation corresponds to repeated multiplication ...
, extraction of
roots
A root is the part of a plant, generally underground, that anchors the plant body, and absorbs and stores water and nutrients.
Root or roots may also refer to:
Art, entertainment, and media
* ''The Root'' (magazine), an online magazine focusin ...
, and
logarithm
In mathematics, the logarithm of a number is the exponent by which another fixed value, the base, must be raised to produce that number. For example, the logarithm of to base is , because is to the rd power: . More generally, if , the ...
s. Multiplication, for instance, is an operation that combines two numbers, referred to as factors, to form a single number, termed the product, such as .
Divisibility is a property between two nonzero integers related to division. An integer is said to be divisible by a nonzero integer if is a multiple of ; that is, if there exists an integer such that . An equivalent formulation is that divides and is denoted by a vertical bar, which in this case is . Conversely, if this were not the case, then would not be divided evenly by , resulting in a remainder. Euclid's division lemma asserts that and can generally be written as , where the remainder accounts for the leftover quantity. Elementary number theory studies divisibility rules in order to quickly identify if a given integer is divisible by a fixed divisor. For instance, it is known that any integer is divisible by 3 if its decimal
digit sum
In mathematics, the digit sum of a natural number in a given radix, number base is the sum of all its numerical digit, digits. For example, the digit sum of the decimal number 9045 would be 9 + 0 + 4 + 5 = 18.
Definition
Let n be a natural number. ...
is divisible by 3.Richmond & Richmond (2009), Section 3.4 (Divisibility Tests), p. 102–108/ref>
A common divisor of several nonzero integers is an integer that divides all of them. The greatest common divisor (gcd) is the largest of such divisors. Two integers are said to be coprime or relatively prime to one another if their greatest common divisor, and simultaneously their only divisor, is 1. The Euclidean algorithm computes the greatest common divisor of two integers by means of repeatedly applying the division lemma and shifting the divisor and remainder after every step. The algorithm can be extended to solve a special case of linear Diophantine equations . A Diophantine equation is an equation with several unknowns and integer coefficients. Another kind of Diophantine equation is described in the Pythagorean theorem, , whose solutions are called Pythagorean triples if they are all integers.
Elementary number theory studies the divisibility properties of integers such as parity (even and odd numbers), prime numbers, and perfect numbers. Important number-theoric functions include the divisor-counting function, the divisor summatory function and its modifications, and
Euler's totient function
In number theory, Euler's totient function counts the positive integers up to a given integer that are relatively prime to . It is written using the Greek letter phi as \varphi(n) or \phi(n), and may also be called Euler's phi function. In ot ...
. A
prime number
A prime number (or a prime) is a natural number greater than 1 that is not a Product (mathematics), 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 ...
is an integer greater than 1 whose only positive divisors are 1 and the prime itself. A positive integer greater than 1 that is not prime is called a composite number.
Euclid's theorem
Euclid's theorem is a fundamental statement in number theory that asserts that there are Infinite set, infinitely many prime number, prime numbers. It was first proven by Euclid in his work ''Euclid's Elements, Elements''. There are several proof ...
demonstrates that there are infinitely many prime numbers that comprise the set . The sieve of Eratosthenes was devised as an efficient algorithm for identifying all primes up to a given natural number by eliminating all composite numbers.
Factorization is a method of expressing a number as a product. Specifically in number theory,
integer factorization
In mathematics, integer factorization is the decomposition of a positive integer into a product of integers. Every positive integer greater than 1 is either the product of two or more integer factors greater than 1, in which case it is a comp ...
is the decomposition of an integer into a product of integers. The process of repeatedly applying this procedure until all factors are prime is known as
prime factorization
In mathematics, integer factorization is the decomposition of a positive integer into a product of integers. Every positive integer greater than 1 is either the product of two or more integer factors greater than 1, in which case it is a comp ...
. A fundamental property of primes is shown in Euclid's lemma. It is a consequence of the lemma that if a prime divides a product of integers, then that prime divides at least one of the factors in the product. The unique factorization theorem is the fundamental theorem of arithmetic that relates to prime factorization. The theorem states that every integer greater than 1 can be factorised into a product of prime numbers and that this factorisation is unique up to the order of the factors. For example, is expressed uniquely as or simply .
Modular arithmetic
In mathematics, modular arithmetic is a system of arithmetic operations for integers, other than the usual ones from elementary arithmetic, where numbers "wrap around" when reaching a certain value, called the modulus. The modern approach to mo ...
works with finite sets of integers and introduces the concepts of congruence and residue classes. A congruence of two integers modulo (a positive integer called the modulus) is an equivalence relation whereby is true. Performing Euclidean division on both and , and on and , yields the same remainder. This written as . In a manner analogous to the 12-hour clock, the sum of 4 and 9 is equal to 13, yet congruent to 1. A residue class modulo is a set that contains all integers congruent to a specified modulo . For example, contains all multiples of 6 incremented by 1. Modular arithmetic provides a range of formulas for rapidly solving congruences of very large powers. An influential theorem is Fermat's little theorem, which states that if a prime is coprime to some integer , then is true. Euler's theorem extends this to assert that every integer satisfies the congruencewhere Euler's totient function counts all positive integers up to that are coprime to . Modular arithmetic also provides formulas that are used to solve congruences with unknowns in a similar vein to equation solving in algebra, such as the
Chinese remainder theorem
In mathematics, the Chinese remainder theorem states that if one knows the remainders of the Euclidean division of an integer ''n'' by several integers, then one can determine uniquely the remainder of the division of ''n'' by the product of thes ...
.
Analytic number theory
Analytic number theory, in contrast to elementary number theory, relies on complex numbers and techniques from analysis and calculus. 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; or
* in terms of its concerns, as the study within number theory of estimates on the size and density of certain numbers (e.g., primes), as opposed to identities.
It studies the distribution of primes, behavior of number-theoric functions, and irrational numbers.
Number theory has the reputation of being a field many of whose results can be stated to the layperson. At the same time, many of 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. The following are examples of problems in analytic number theory: the
prime number theorem
In mathematics, the prime number theorem (PNT) describes the asymptotic analysis, asymptotic distribution of the prime numbers among the positive integers. It formalizes the intuitive idea that primes become less common as they become larger by p ...
modular form
In mathematics, a modular form is a holomorphic function on the complex upper half-plane, \mathcal, that roughly satisfies a functional equation with respect to the group action of the modular group and a growth condition. The theory of modul ...
s (and, more generally, automorphic forms) also occupies an increasingly central place in the toolbox of analytic number theory.
Analysis
Analysis (: analyses) is the process of breaking a complex topic or substance into smaller parts in order to gain a better understanding of it. The technique has been applied in the study of mathematics and logic since before Aristotle (38 ...
is the branch of mathematics that studies the limit, defined as the value to which a sequence or function tends as the argument (or index) approaches a specific value. For example, the limit of the sequence 0.9, 0.99, 0.999, ... is 1. In the context of functions, the limit of as approaches infinity is 0. The complex numbers extend the real numbers with the imaginary unit defined as the solution to . Every complex number can be expressed as , where is called the real part and is called the imaginary part.
The distribution of primes, described by the function that counts all primes up to a given real number, is unpredictable and is a major subject of study in number theory. Elementary formulas for a partial sequence of primes, including Euler's prime-generating polynomials have been developed. However, these cease to function as the primes become too large. The prime number theorem in analytic number theory provides a formalisation of the notion that prime numbers appear less commonly as their numerical value increases. One distribution states, informally, that the function approximates . Another distribution involves an offset logarithmic integral which converges to more quickly.
The zeta function has been demonstrated to be connected to the distribution of primes. It is defined as the seriesthat converges if is greater than 1. Euler demonstrated a link involving the infinite product over all prime numbers, expressed as the identity Riemann extended the definition to a complex variable and conjectured that all nontrivial cases () where the function returns a zero are those in which the real part of is equal to . He established a connection between the nontrivial zeroes and the prime-counting function. In what is now recognised as the unsolved Riemann hypothesis, a solution to it would imply direct consequences for understanding the distribution of primes.
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 number
A prime number (or a prime) is a natural number greater than 1 that is not a Product (mathematics), 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 ...
s 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. This is an example of a general procedure in analytic number theory: deriving information about the distribution of a
sequence
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 cal ...
(here, prime ideals or prime numbers) from the analytic behavior of an appropriately constructed complex-valued function.See, for example, , p. 1.
Elementary number theory works with '' elementary proofs'', a term that excludes the use of complex numbers but may include basic analysis. For example, the
prime number theorem
In mathematics, the prime number theorem (PNT) describes the asymptotic analysis, asymptotic distribution of the prime numbers among the positive integers. It formalizes the intuitive idea that primes become less common as they become larger by p ...
was first proven using complex analysis in 1896, but an elementary proof was found only in 1949 by Erdős and Selberg. The term is somewhat ambiguous. For example, proofs based on complex Tauberian theorems, such as Wiener–Ikehara, are often seen as quite enlightening but not elementary despite using Fourier analysis, not complex analysis. Here as elsewhere, an ''elementary'' proof may be longer and more difficult for most readers than a more advanced proof.
Some subjects generally considered to be part of analytic number theory (e.g., sieve theory) are better covered by the second rather than the first definition.Sieve theory figures as one of the main subareas of analytic number theory in many standard treatments; see, for instance, or Small sieves, for instance, use little analysis and yet still belong to analytic number theory.This is the case for some combinatorial sieves such as the Brun sieve, rather than for large sieves. The study of the latter now includes ideas from harmonic and
functional analysis
Functional analysis is a branch of mathematical analysis, the core of which is formed by the study of vector spaces endowed with some kind of limit-related structure (for example, Inner product space#Definition, inner product, Norm (mathematics ...
.
Algebraic number theory
An ''algebraic number'' is any
complex number
In mathematics, a complex number is an element of a number system that extends the real numbers with a specific element denoted , called the imaginary unit and satisfying the equation i^= -1; every complex number can be expressed in the for ...
that is a solution to some polynomial equation with rational coefficients; for example, every solution of 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.
It could be argued that the simplest kind of number fields, namely 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 , where
and are rational numbers and
is a fixed rational number whose square root is not rational.)
For that matter, the eleventh-century
chakravala method
The ''chakravala'' method () is a cyclic algorithm to solve indeterminate quadratic equations, including Pell's equation. It is commonly attributed to Bhāskara II, (c. 1114 – 1185 CE)Hoiberg & Ramchandani – Students' Britannica India: Bhask ...
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 factorization in algebraic number fields. (For example, in the field generated by the rationals
and , the number can be factorised both as and
; all of , , and
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, that is, generalizations of
quadratic reciprocity
In number theory, the law of quadratic reciprocity is a theorem about modular arithmetic that gives conditions for the solvability of quadratic equations modulo prime numbers. Due to its subtlety, it has many formulations, but the most standard st ...
.
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 groupThe Galois group of an extension ''L/K'' consists of the operations ( isomorphisms) that send elements of L to other elements of L while leaving all elements of K fixed.
Thus, for instance, ''Gal(C/R)'' consists of two elements: the identity element
(taking every element ''x'' + ''iy'' of ''C'' to itself) and complex conjugation
(the map taking each element ''x'' + ''iy'' to ''x'' − ''iy'').
The Galois group of an extension tells us many of its crucial properties. The study of Galois groups started with
Évariste Galois
Évariste Galois (; ; 25 October 1811 – 31 May 1832) was a French mathematician and political activist. While still in his teens, he was able to determine a necessary and sufficient condition for a polynomial to be solvable by Nth root, ...
; in modern language, the main outcome of his work is that an equation ''f''(''x'') = 0 can be solved by radicals
(that is, ''x'' can be expressed in terms of the four basic operations together
with square roots, cubic roots, etc.) if and only if the extension of the rationals by the roots of the equation ''f''(''x'') = 0 has a Galois group that is solvable
in the sense of group theory. ("Solvable", in the sense of group theory, is a simple property that can be checked easily for finite groups.) 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 nineteenth 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
In mathematics, the Langlands program is a set of conjectures about connections between number theory, the theory of automorphic forms, and geometry. It was proposed by . It seeks to relate the structure of Galois groups in algebraic number t ...
, 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
The central problem of Diophantine geometry is to determine when a Diophantine equation has integer or rational 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 -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.
Consider, for instance, the Pythagorean equation . One would like to know its rational solutions, namely such that ''x'' and ''y'' are both rational. This is the same as asking for all integer solutions
to ; any solution to the latter equation gives us a solution , to the former. It is also the
same as asking for all points with rational coordinates on the curve described by (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 , where is a polynomial in two variables) depends crucially on the
genus
Genus (; : genera ) is a taxonomic rank above species and below family (taxonomy), family as used in the biological classification of extant taxon, living and fossil organisms as well as Virus classification#ICTV classification, viruses. In bino ...
of the curve.The ''genus'' can be defined as follows: allow the variables in to be complex numbers; then defines a 2-dimensional surface in (projective) 4-dimensional space (since two complex variables can be decomposed into four real variables; that is, four dimensions). The number of doughnut-like holes in the surface is called the ''genus'' of the curve of equation . 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 , 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 (with ) a good approximation to if , where is large. This question is of special interest if is an algebraic number. If cannot be approximated well, then some equations do not have integer or rational solutions. Moreover, several concepts (especially that of
height
Height is measure of vertical distance, either vertical extent (how "tall" something or someone is) or vertical position (how "high" a point is). For an example of vertical extent, "This basketball player is 7 foot 1 inches in height." For an e ...
) 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 is a contemporary term for the same domain covered by Diophantine geometry, particularly when one wishes to emphasize the connections to modern algebraic geometry (for example, in Faltings's theorem) rather than to techniques in Diophantine approximations.
Other subfields
Probabilistic number theory starts with questions such as the following: Take an integer 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 have on average? What is the probability that it will have many more or many fewer divisors or prime divisors than the average?
Combinatorics in number theory starts with questions like the following: Does a fairly "thick" infinite set contain many elements in arithmetic progression: ,
? Should it be possible to write large integers as sums of elements of ?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.
Applications
For a long time, number theory in general, and the study of prime numbers in particular, was seen as the canonical example of pure mathematics, with no applications outside of mathematics other than the use of prime numbered gear teeth to distribute wear evenly. In particular, number theorists such as British mathematician
G. H. Hardy
Godfrey Harold Hardy (7 February 1877 – 1 December 1947) was an English mathematician, known for his achievements in number theory and mathematical analysis. In biology, he is known for the Hardy–Weinberg principle, a basic principle of pop ...
prided themselves on doing work that had absolutely no military significance. 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.
This vision of the purity of number theory was shattered in the 1970s, when it was publicly announced that prime numbers could be used as the basis for the creation of
public-key cryptography
Public-key cryptography, or asymmetric cryptography, is the field of cryptographic systems that use pairs of related keys. Each key pair consists of a public key and a corresponding private key. Key pairs are generated with cryptographic alg ...
algorithms. Schemes such as RSA are based on the difficulty of factoring large composite numbers into their prime factors. These applications have led to significant study of
algorithms
In mathematics and computer science, an algorithm () is a finite sequence of mathematically rigorous instructions, typically used to solve a class of specific problems or to perform a computation. Algorithms are used as specifications for per ...
for computing with prime numbers, and in particular of primality testing, methods for determining whether a given number is prime. Prime numbers are also used in computing for checksums, hash tables, and pseudorandom number generators.
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".
Elementary number theory is taught in
discrete mathematics
Discrete mathematics is the study of mathematical structures that can be considered "discrete" (in a way analogous to discrete variables, having a bijection with the set of natural numbers) rather than "continuous" (analogously to continuous f ...
courses for
computer scientist
A computer scientist is a scientist who specializes in the academic study of computer science.
Computer scientists typically work on the theoretical side of computation. Although computer scientists can also focus their work and research on ...
s. It also has applications to the continuous in
numerical analysis
Numerical analysis is the study of algorithms that use numerical approximation (as opposed to symbolic computation, symbolic manipulations) for the problems of mathematical analysis (as distinguished from discrete mathematics). It is the study of ...
.
Number theory has now several modern applications spanning diverse areas such as:
*
Computer science
Computer science is the study of computation, information, and automation. Computer science spans Theoretical computer science, theoretical disciplines (such as algorithms, theory of computation, and information theory) to Applied science, ...
: The
fast Fourier transform
A fast Fourier transform (FFT) is an algorithm that computes the discrete Fourier transform (DFT) of a sequence, or its inverse (IDFT). A Fourier transform converts a signal from its original domain (often time or space) to a representation in ...
(FFT) algorithm, which is used to efficiently compute the discrete Fourier transform, has important applications in signal processing and data analysis.
*
Physics
Physics is the scientific study of matter, its Elementary particle, fundamental constituents, its motion and behavior through space and time, and the related entities of energy and force. "Physical science is that department of knowledge whi ...
: The Riemann hypothesis has connections to the distribution of prime numbers and has been studied for its potential implications in physics.
* Error correction codes: The theory of finite fields and algebraic geometry have been used to construct efficient error-correcting codes.
* Communications: The design of cellular telephone networks requires knowledge of the theory of
modular form
In mathematics, a modular form is a holomorphic function on the complex upper half-plane, \mathcal, that roughly satisfies a functional equation with respect to the group action of the modular group and a growth condition. The theory of modul ...
s, which is a part of analytic number theory.
* Study of musical scales: the concept of "
equal temperament
An equal temperament is a musical temperament or Musical tuning#Tuning systems, tuning system that approximates Just intonation, just intervals by dividing an octave (or other interval) into steps such that the ratio of the frequency, frequencie ...
", which is the basis for most modern Western music, involves dividing the
octave
In music, an octave (: eighth) or perfect octave (sometimes called the diapason) is an interval between two notes, one having twice the frequency of vibration of the other. The octave relationship is a natural phenomenon that has been referr ...
into 12 equal parts. This has been studied using number theory and in particular the properties of the 12th root of 2.
Finite field
In mathematics, a finite field or Galois field (so-named in honor of Évariste Galois) is a field (mathematics), field that contains a finite number of Element (mathematics), elements. As with any field, a finite field is a Set (mathematics), s ...
*
*
*
* (Subscription needed)
*
* 1968 edition at archive.org
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
* Volume 1Volume 2Volume 3Volume 4 (1912) * For other editions, see Iamblichus#List of editions and translations
* This Google books preview of ''Elements of algebra'' lacks Truesdell's intro, which is reprinted (slightly abridged) in the following book:
*
*
*
*
*
*
Further reading
Two of the most popular introductions to the subject are:
*
*
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:
*
*
Popular choices for a second textbook include:
*
*