 number theory

Math.the study of integers and their relation to one another. Also called theory of numbers.[191015]
* * *
Branch of mathematics concerned with properties of and relations among integers.It is a popular subject among amateur mathematicians and students because of the wealth of seemingly simple problems that can be posed. Answers are much harder to come up with. It has been said that any unsolved mathematical problem of any interest more than a century old belongs to number theory. One of the best examples, recently solved, is Fermat's last theorem.* * *
Introductionbranch of mathematics concerned with properties of the positive integers (1, 2, 3, …). Sometimes called “higher arithmetic,” it is among the oldest and most natural of mathematical pursuits.Number theory has always fascinated amateurs as well as professional mathematicians. In contrast to other branches of mathematics, many of the problems and theorems of number theory can be understood by laypersons, although solutions to the problems and proofs of the theorems often require a sophisticated mathematical background.Until the mid20th century, number theory was considered the purest branch of mathematics, with no direct applications to the real world. The advent of digital computers (computer) and digital communications revealed that number theory could provide unexpected answers to realworld problems. At the same time, improvements in computer technology enabled number theorists to make remarkable advances in factoring large numbers, determining primes, testing conjectures, and solving numerical problems once considered out of reach.Modern number theory is a broad subject that is classified into subheadings such as elementary number theory, algebraic number theory, analytic number theory, geometric number theory, and probabilistic number theory. These categories reflect the methods used to address problems concerning the integers.From prehistory through Classical GreeceThe ability to count dates back to prehistoric times. This is evident from archaeological artifacts, such as a 10,000yearold bone from the Congo region of Africa with tally marks scratched upon it—signs of an unknown ancestor counting something. Very near the dawn of civilization, people had grasped the idea of “multiplicity” and thereby had taken the first steps toward a study of numbers.It is certain that an understanding of numbers existed in ancient Mesopotamia, Egypt, China, and India, for tablets, papyri, and temple carvings from these early cultures have survived. A Babylonian (Babylon) tablet known as Plimpton 322 (c. 1700 BC) is a case in point. In modern notation, it displays number triples x, y, and z with the property that x^{2} + y^{2} = z^{2}. One such triple is 2,291, 2,700, and 3,541, where 2,291^{2} + 2,700^{2} = 3,541^{2}. This certainly reveals a degree of number theoretic sophistication in ancient Babylon.Despite such isolated results, a general theory of numbers was nonexistent. For this—as with so much of theoretical mathematics—one must look to the Classical Greeks (ancient Greek civilization), whose groundbreaking achievements displayed an odd fusion of the mystical tendencies of the Pythagoreans (Pythagoreanism) and the severe logic of Euclid's Elements (c. 300 BC).According to tradition, Pythagoras (c. 580–500 BC) worked in southern Italy amid devoted followers. His philosophy enshrined number as the unifying concept necessary for understanding everything from planetary motion to musical harmony. Given this viewpoint, it is not surprising that the Pythagoreans attributed quasirational properties to certain numbers.For instance, they attached significance to perfect numbers (perfect number)—i.e., those that equal the sum of their proper divisors. Examples are 6 (whose proper divisors 1, 2, and 3 sum to 6) and 28 (1 + 2 + 4 + 7 + 14). The Greek philosopher Nicomachus of Gerasa (flourished c. AD 100), writing centuries after Pythagoras but clearly in his philosophical debt, stated that perfect numbers represented “virtues, wealth, moderation, propriety, and beauty.” (Some modern writers label such nonsense numerical theology.)In a similar vein, the Greeks called a pair of integers amicable (“friendly”) if each was the sum of the proper divisors of the other. They knew only a single amicable pair: 220 and 284. One can easily check that the sum of the proper divisors of 284 is 1 + 2 + 4 + 71 + 142 = 220 and the sum of the proper divisors of 220 is 1 + 2 + 4 + 5 + 10 + 11 + 20 + 22 + 44 + 55 + 110 = 284. For those prone to number mysticism, such a phenomenon must have seemed like magic.By contrast, Euclid presented number theory without the flourishes. He began Book VII of his Elements by defining a number as “a multitude composed of units.” The plural here excluded 1; for Euclid, 2 was the smallest “number.” He later defined a prime as a number “measured by a unit alone” (i.e., whose only proper divisor is 1), a composite as a number that is not prime, and a perfect number as one that equals the sum of its “parts” (i.e., its proper divisors).From there, Euclid proved a sequence of theorems that marks the beginning of number theory as a mathematical (as opposed to a numerological) enterprise. Four Euclidean propositions deserve special mention.The first, Proposition 2 of Book VII, is a procedure for finding the greatest common divisor of two whole numbers. This fundamental result is now called the Euclidean algorithm in his honour.Second, Euclid gave a version of what is known as the unique factorization theorem or the fundamental theorem of arithmetic. This says that any whole number can be factored into the product of primes in one and only one way. For example, 1,960 = 2 × 2 × 2 × 5 × 7 × 7 is a decomposition into prime factors, and no other such decomposition exists. Euclid's discussion of unique factorization is not satisfactory by modern standards, but its essence can be found in Proposition 32 of Book VII and Proposition 14 of Book IX.Third, Euclid showed that no finite collection of primes contains them all. His argument, Proposition 20 of Book IX, remains one of the most elegant proofs in all of mathematics. Beginning with any finite collection of primes—say, a, b, c, …, n—Euclid considered the number formed by adding one to their product: N = (abc⋯n) + 1. He then examined the two alternatives:(1) If N is prime, then it is a new prime not among a, b, c, …, n because it is larger than all of these. For example, if the original primes were 2, 3, and 7, then N = (2 × 3 × 7) + 1 = 43 is a larger prime. (2) Alternately, if N is composite, it must have a prime factor which, as Euclid demonstrated, cannot be one of the originals. To illustrate, begin with primes 2, 7, and 11, so that N = (2 × 7 × 11) + 1 = 155. This is composite, but its prime factors 5 and 31 do not appear among the originals. Either way, a finite set of primes can always be augmented. It follows, by this beautiful piece of logic, that the collection of primes is infinite.Fourth, Euclid ended Book IX with a blockbuster: if the series 1 + 2 + 4 + 8 + … + 2^{k} sums to a prime, then the number N = 2^{k}(1 + 2 + 4 + … + 2^{k}) must be perfect. For example, 1 + 2 + 4 = 7, a prime, so 4(1 + 2 + 4) = 28 is perfect. Euclid's “recipe” for perfect numbers (perfect number) was a most impressive achievement for its day.Diophantus (Diophantus of Alexandria)Of later Greek mathematicians, especially noteworthy is Diophantus of Alexandria (flourished c. 250), author of Arithmetica. This book features a host of problems, the most significant of which have come to be called Diophantine equations (Diophantine equation). These are equations whose solutions must be whole numbers. For example, Diophantus asked for two numbers, one a square and the other a cube, such that the sum of their squares is itself a square. In modern symbols, he sought integers x, y, and z such that (x^{2})^{2} + (y^{3})^{2} = z^{2}. It is easy to find real numbers satisfying this relationship (e.g., x = √2, y = 1, and z = √5), but the requirement that solutions be integers makes the problem more difficult. (One answer is x = 6, y = 3, and z = 45.) Diophantus's work strongly influenced later mathematics.Number theory in the EastThe millennium following the decline of Rome saw no significant European advances, but Chinese and Indian scholars were making their own contributions to the theory of numbers. Motivated by questions of astronomy and the calendar, the Chinese (China) mathematician Sun Zi (Sun Tzu; flourished c. AD 250) tackled multiple Diophantine equations. As one example, he asked for a whole number that when divided by 3 leaves a remainder of 2, when divided by 5 leaves a remainder of 3, and when divided by 7 leaves a remainder of 2 (his answer: 23). Almost a thousand years later, Qin Jiushao (1202–61) gave a general procedure, now known as the Chinese remainder theorem, for solving problems of this sort.Meanwhile, Indian (India) mathematicians were hard at work. In the 7th century Brahmagupta took up what is now (erroneously) called the Pell equation. He posed the challenge to find a perfect square that, when multiplied by 92 and increased by 1, yields another perfect square. That is, he sought whole numbers x and y such that 92x^{2} + 1 = y^{2}—a Diophantine equation with quadratic terms. Brahmagupta suggested that anyone who could solve this problem within a year earned the right to be called a mathematician. His solution was x = 120 and y = 1,151.In addition, Indian scholars developed the socalled HinduArabic numerals—the base10 notation subsequently adopted by the world's mathematical and civil communities (see numerals and numeral systems). Although more number representation than number theory, these numerals have prevailed due to their simplicity and ease of use. The Indians employed this system—including the zero—as early as AD 800.At about this time, the Islamic world (Islāmic world) became a mathematical powerhouse. Situated on trade routes between East and West, Islamic scholars absorbed the works of other civilizations and augmented these with homegrown achievements. For example, Thabit ibn Qurrah (Thābit ibn Qurra) (active in Baghdad in the 9th century) returned to the Greek problem of amicable numbers and discovered a second pair: 17,296 and 18,416.Modern number theoryAs mathematics filtered from the Islamic world to Renaissance Europe, number theory received little serious attention. The period from 1400 to 1650 saw important advances in geometry, algebra, and probability, not to mention the discovery of both logarithms (logarithm) and analytic geometry. But number theory was regarded as a minor subject, largely of recreational interest.Pierre de Fermat (Fermat, Pierre de)Credit for changing this perception goes to Pierre de Fermat (Fermat, Pierre de) (1601–65), a French magistrate with time on his hands and a passion for numbers. Although he published little, Fermat posed the questions and identified the issues that have shaped number theory ever since. Here are a few examples:● In 1640 he stated what is known as Fermat's little theorem—namely, that if p is prime and a is any whole number, then p divides evenly into a^{p} − a. Thus, if p = 7 and a = 12, the farfromobvious conclusion is that 7 is a divisor of 12^{7} − 12 = 35,831,796. This theorem is one of the great tools of modern number theory.● Fermat investigated the two types of odd primes (prime): those that are one more than a multiple of 4 and those that are one less. These are designated as the 4k + 1 primes and the 4k − 1 primes, respectively. Among the former are 5 = 4 × 1 + 1 and 97 = 4 × 24 + 1; among the latter are 3 = 4 × 1 − 1 and 79 = 4 × 20 − 1. Fermat asserted that any prime of the form 4k + 1 can be written as the sum of two squares in one and only one way, whereas a prime of the form 4k − 1 cannot be written as the sum of two squares in any manner whatever. Thus, 5 = 2^{2} + 1^{2} and 97 = 9^{2} + 4^{2}, and these have no alternative decompositions into sums of squares. On the other hand, 3 and 79 cannot be so decomposed. This dichotomy among primes ranks as one of the landmarks of number theory.● In 1638 Fermat asserted that every whole number can be expressed as the sum of four or fewer squares. He claimed to have a proof but did not share it.● Fermat stated that there cannot be a right triangle with sides of integer length whose area is a perfect square. This amounts to saying that there do not exist integers x, y, z, and w such that x^{2} + y^{2} = z^{2} (the Pythagorean relationship) and that w^{2} = ^{1}/_{2}(base) (height) = xy/2.Uncharacteristically, Fermat provided a proof of this last result. He used a technique called infinite descent that was ideal for demonstrating impossibility. The logical strategy assumes that there are whole numbers satisfying the condition in question and then generates smaller whole numbers satisfying it as well. Reapplying the argument over and over, Fermat produced an endless sequence of decreasing whole numbers. But this is impossible, for any set of positive integers must contain a smallest member. By this contradiction, Fermat concluded that no such numbers can exist in the first place.Two other assertions of Fermat should be mentioned. One was that any number of the form 2^{2n} + 1 must be prime. He was correct if n = 0, 1, 2, 3, and 4, for the formula yields primes 2^{20} + 1 = 3, 2^{21} + 1 = 5, 2^{22} + 1 = 17, 2^{23} + 1 = 257, and 2^{24} + 1 = 65,537. These are now called Fermat primes (Fermat prime). Unfortunately for his reputation, the next such number 2^{25} + 1 = 2^{32} + 1 = 4,294,967,297 is not a prime (more about that later). Even Fermat was not invincible.The second assertion is one of the most famous statements from the history of mathematics. While reading Diophantus's Arithmetica, Fermat wrote in the book's margin: “To divide a cube into two cubes, a fourth power, or in general any power whatever into two powers of the same denomination above the second is impossible.” He added that “I have assuredly found an admirable proof of this, but the margin is too narrow to contain it.”In symbols, he was claiming that if n > 2, there are no whole numbers x, y, z such that x^{n} + y^{n} = z^{n}, a statement that came to be known as Fermat's last theorem. For three and a half centuries, it defeated all who attacked it, earning a reputation as the most famous unsolved problem in mathematics.Despite Fermat's genius, number theory still was relatively neglected. His reluctance to supply proofs was partly to blame, but perhaps more detrimental was the appearance of the calculus in the last decades of the 17th century. Calculus is the most useful mathematical tool of all, and scholars eagerly applied its ideas to a range of realworld problems. By contrast, number theory seemed too “pure,” too divorced from the concerns of physicists, astronomers, and engineers.Number theory in the 18th centuryCredit for bringing number theory into the mainstream, for finally realizing Fermat's dream, is due to the 18th century's dominant mathematical figure, the Swiss Leonhard Euler (Euler, Leonhard) (1707–83). Euler was the most prolific mathematician ever—and one of the most influential—and when he turned his attention to number theory, the subject could no longer be ignored.Initially, Euler shared the widespread indifference of his colleagues, but he was in correspondence with Christian Goldbach (Goldbach, Christian) (1690–1764), a number theory enthusiast acquainted with Fermat's work. Like an insistent salesman, Goldbach tried to interest Euler in the theory of numbers, and eventually his insistence paid off.It was a letter of December 1, 1729, in which Goldbach asked Euler, “Is Fermat's observation known to you, that all numbers 2^{2n} + 1 are primes?” This caught Euler's attention. Indeed, he showed that Fermat's assertion was wrong by splitting the number 2^{25} + 1 into the product of 641 and 6,700,417.Through the next five decades, Euler published over a thousand pages of research on number theory, much of it furnishing proofs of Fermat's assertions. In 1736 he proved Fermat's little theorem (cited above). By midcentury he had established Fermat's theorem that primes of the form 4k + 1 can be uniquely expressed as the sum of two squares. He later took up the matter of perfect numbers, demonstrating that any even perfect number must assume the form discovered by Euclid 20 centuries earlier (see above). And when he turned his attention to amicable numbers—of which, by this time, only three pairs were known—Euler vastly increased the world's supply by finding 58 new ones!Of course, even Euler could not solve every problem. He gave proofs, or nearproofs, of Fermat's last theorem for exponents n = 3 and n = 4 but despaired of finding a general solution. And he was completely stumped by Goldbach's assertion that any even number greater than 2 can be written as the sum of two primes. Euler endorsed the result—today known as the Goldbach conjecture—but acknowledged his inability to prove it.Euler gave number theory a mathematical legitimacy, and thereafter progress was rapid. In 1770, for instance, JosephLouis Lagrange (Lagrange, JosephLouis, comte de l'Empire) (1736–1813) proved Fermat's assertion that every whole number can be written as the sum of four or fewer squares. Soon thereafter, he established a beautiful result known as Wilson's theorem: p is prime if and only if p divides evenly into[(p−1) × (p−2) × ⋯ × 3 × 2 × 1] + 1.Number theory in the 19th centuryDisquisitiones ArithmeticaeOf immense significance was the 1801 publication of Disquisitiones Arithmeticae by Carl Friedrich Gauss (Gauss, Carl Friedrich) (1777–1855). This became, in a sense, the holy writ of number theory. In it Gauss organized and summarized much of the work of his predecessors before moving boldly to the frontier of research. Observing that the problem of resolving composite numbers into prime factors is “one of the most important and useful in arithmetic,” Gauss provided the first modern proof of the unique factorization (fundamental theorem of arithmetic) theorem. He also gave the first proof of the law of quadratic reciprocity, a deep result previously glimpsed by Euler. To expedite his work, Gauss introduced the idea of congruence among numbers—i.e., he defined a and b to be congruent modulo m (written a ≡ b mod m) if m divides evenly into the difference a − b. For instance, 39 ≡ 4 mod 7. This innovation, when combined with results like Fermat's little theorem, has become an indispensable fixture of number theory.From classical to analytic number theoryInspired by Gauss, other 19thcentury mathematicians took up the challenge. Sophie Germain (Germain, Sophie) (1776–1831), who once stated, “I have never ceased thinking about the theory of numbers,” made important contributions to Fermat's last theorem, and AdrienMarie Legendre (Legendre, AdrienMarie) (1752–1833) and Peter Gustav Lejeune Dirichlet (Dirichlet, Peter Gustav Lejeune) (1805–59) confirmed the theorem for n = 5—i.e., they showed that the sum of two fifth powers cannot be a fifth power. In 1847 Ernst Kummer (Kummer, Ernst Eduard) (1810–93) went further, demonstrating that Fermat's last theorem was true for a large class of exponents; unfortunately, he could not rule out the possibility that it was false for a large class of exponents, so the problem remained unresolved.The same Dirichlet (who reportedly kept a copy of Gauss's Disquisitiones Arithmeticae by his bedside for evening reading) made a profound contribution by proving that, if a and b have no common factor, then the arithmetic progression a, a + b, a + 2b, a + 3b, … must contain infinitely many primes. Among other things, this established that there are infinitely many 4k + 1 primes and infinitely many 4k − 1 primes as well. But what made this theorem so exceptional was Dirichlet's method of proof: he employed the techniques of calculus to establish a result in number theory. This surprising but ingenious strategy marked the beginning of a new branch of the subject: analytic number theory.One of the supreme achievements of 19thcentury mathematics was the prime number theorem, and it is worth a brief digression. To begin, designate the number of primes less than or equal to n by π(n). Thus π(10) = 4 because 2, 3, 5, and 7 are the four primes not exceeding 10. Similarly π(25) = 9 and π(100) = 25. Next, consider the proportion of numbers less than or equal to n that are prime—i.e., π(n)/n. Clearly π(10)/10 = 0.40, meaning that 40 percent of the numbers not exceeding 10 are prime. Other proportions are shown in the table—>.A pattern is anything but clear, but the prime number theorem identifies one, at least approximately, and thereby provides a rule for the distribution of primes among the whole numbers. The theorem says that, for large n, the proportion π(n)/n is roughly 1/log n, where log n is the natural logarithm of n. This link between primes and logs is nothing short of extraordinary.One of the first to perceive this was the young Gauss, whose examination of log tables and prime numbers suggested it to his fertile mind. Following Dirichlet's exploitation of analytic techniques in number theory, Bernhard Riemann (Riemann, Bernhard) (1826–66) and Pafnuty Chebyshev (Chebyshev, Pafnuty Lvovich) (1821–94) made substantial progress before the prime number theorem was proved in 1896 by Jacques Hadamard (Hadamard, JacquesSalomon) (1865–1963) and Charles Jean de la ValléePoussin (1866–1962). This brought the 19th century to a triumphant close.Number theory in the 20th centuryThe next century saw an explosion in number theoretic research. Along with classical and analytic number theory, scholars now explored specialized subfields such as algebraic number theory, geometric number theory, and combinatorial number theory. The concepts became more abstract and the techniques more sophisticated. Unquestionably, the subject had grown beyond Fermat's wildest dreams.One of the great contributors from early in the 20th century was the incandescent genius Srinivasa Ramanujan (Ramanujan, Srinivasa) (1887–1920). Ramanujan, whose formal training was as limited as his life was short, burst upon the mathematical scene with a series of brilliant discoveries. Analytic number theory was among his specialties, and his publications carried titles such as “Highly composite numbers” and “Proof that almost all numbers n are composed of about log(log n) prime factors.”A legendary figure in 20thcentury number theory was Paul Erdös (Erdös, Paul) (1913–96), a Hungarian genius known for his deep insights, his vast circle of collaborators, and his personal eccentricities. At age 18, Erdös published a muchsimplified proof of a theorem of Chebyshev stating that, if n ≥ 2, then there must be a prime between n and 2n. This was the first in a string of number theoretic results that would span most of the century. In the process, Erdös—who also worked in combinatorics, graph theory, and dimension theory—published over 1,500 papers with more than 500 collaborators from around the world. He achieved this astonishing output while living more or less out of a suitcase, traveling constantly from one university to another in pursuit of new mathematics. It was not uncommon for him to arrive, unannounced, with the declaration that “My brain is open” and then to plunge into the latest problem with gusto.Two later developments deserve mention. One was the invention of the electronic computer, whose speed has been advantageously applied to number theoretic questions. As an example, Euler once speculated that at least four fourth powers must be added together for the sum to be a fourth power. But in 1988, using a combination of mathematical insight and computer muscle, the American Noam Elkies discovered that 2,682,440^{4} + 15,365,639^{4} + 18,796,760^{4} = 20,615,673^{4}—a stupendous counterexample that destroyed Euler's conjecture. (The number on the right contains 30 digits, so there is little wonder that Euler missed it.)Second, number theory acquired an applied flavour, for it became instrumental in designing encryption schemes widely used in government and business. These rely upon the factorization of gigantic numbers into primes—a factorization that the code's user knows and the potential codebreaker does not. This application runs counter to the longheld perception of number theory as beautiful but essentially useless. (See cryptology: Cryptography (cryptology).)Twentiethcentury number theory reached a muchpublicized climax in 1995, when Fermat's last theorem was proved by the Englishman Andrew Wiles (Wiles, Andrew John), with timely assistance from his British colleague Richard Taylor. Wiles succeeded where so many had failed with a 130page proof of incredible complexity, one that certainly would not fit into any margin.Unsolved problemsThis triumph notwithstanding, number theory remains the source of many unsolved problems, some of the most perplexing of which sound innocent enough. For example:● Do any odd perfect numbers exist?● Are there infinitely many primes of the form n^{2} + 1 (i.e., one more than a perfect square)?● Are there infinitely many pairs of twin primes (i.e., primes that differ by 2, like 5 and 7 or 41 and 43)?● Is Goldbach's conjecture true? (Euler failed to prove it; so has everyone since.)Although there has been no lack of effort, these questions remain open. Perhaps, like Fermat's last theorem, they will eventually be resolved. Or perhaps they will remain as challenges into the indefinite future. In order to spur research efforts across a wide range of mathematical disciplines, the privately funded Clay Mathematics Institute of Cambridge, Massachusetts, named seven “Millennium Prize Problems” in 2000, each with a milliondollar award for a correct solution. In any case, these mysteries justify Eric Temple Bell (Bell, Eric Temple)'s characterization of number theory as “the last great uncivilized continent of mathematics.”The theory of numbers, then, is a vast and challenging subject as old as mathematics and as fresh as today's news. Its problems retain their fascination because of an apparent (often deceptive) simplicity and an irresistible beauty. With such a rich and colorful history, number theory surely deserves to be called, in the famous words of Gauss, “the queen of mathematics.”William DunhamAdditional ReadingØystein Ore, Number Theory and Its History (1948; reprinted with supplement, 1988), is a popular introduction to this fascinating subject and a timeless classic. More demanding mathematically is a book by a major figure in 20thcentury mathematics, André Weil, Number Theory: An Approach through History from Hammurapi to Legendre (1984), which gives special attention to the work of Fermat and Euler. A dated but immense treatise is Leonard Eugene Dickson, History of the Theory of Numbers, 3 vol. (1919–23, reprinted 1999), which, though lacking material on 20thcentury mathematics, provides a minutely detailed account of the development of number theory to that point. Morris Kline, Mathematical Thought from Ancient to Modern Times (1972, reissued in 3 vol., 1990), is an encyclopaedic survey of the history of mathematics—including many sections on the history of number theory. Two books by William Dunham, Journey Through Genius: The Great Theorems of Mathematics (1990) and The Mathematical Universe: An Alphabetical Journey Through the Great Proofs, Problems, and Personalities (1994), contain historically oriented chapters on number theory that are accessible to a wide audience. William Dunham, Euler: The Master of Us All (1999), recounts Euler's work with perfect numbers and his tentative explorations into analytic number theory.There are many number theory textbooks. One that adopts a historical viewpoint is David M. Burton, Elementary Number Theory, 4th ed. (1998). Gareth A. Jones and J. Mary Jones, Elementary Number Theory (1998), contains exercises with solutions and thus is suitable for selfinstruction. On a somewhat higher level is Ivan Niven, Herbert S. Zuckerman, and Hugh L. Montgomery, An Introduction to the Theory of Numbers, 5th ed. (1991). M.R. Schroeder, Number Theory in Science and Communication: With Applications in Cryptography, Physics, Digital Information, Computing, and SelfSimilarity, 3rd ed. (1997, reprinted with corrections, 1999), introduces nonmathematicians to applications of the subject.Recreational aspects of number theory are presented in Albert H. Beiler, Recreations in the Theory of Numbers: The Queen of Mathematics Entertains, 2nd ed. (1966), and John H. Conway and Richard K. Guy, The Book of Numbers (1996, reprinted with corrections, 1998). Simon Singh, Fermat's Enigma: The Epic Quest to Solve the World's Greatest Mathematical Problem (1997), presents the historical development of modern number theory through the story of the solution of Fermat's last theorem. Richard Friedberg, An Adventurer's Guide to Number Theory (1968, reissued 1994), addresses topics of historical significance in a readerfriendly fashion.William Dunham* * *
Universalium. 2010.
Look at other dictionaries:
Number theory — A Lehmer sieve an analog computer once used for finding primes and solving simple diophantine equations. Number theory is a branch of pure mathematics devoted primarily to the study of the integers. Number theorists study prime numbers (the… … Wikipedia
number theory — noun The branch of pure mathematics concerned with the properties of integers. Factorization has driven many great discoveries in number theory. See Also: arithmetic, mathematics, natural number, number, prime number, theory … Wiktionary
number theory — noun Date: 1864 the study of the properties of integers • number theoretic adjective • number theorist noun … New Collegiate Dictionary
number theory — branch of mathematics which deals with the natural numbers; numerology … English contemporary dictionary
number theory — num′ber the ory n. math. the study of integers and their relation to one another • Etymology: 1910–15 … From formal English to slang
number theory — /ˈnʌmbə θɪəri/ (say numbuh thearree) noun the study of numbers (integers) and of the relations which hold between them … Australian English dictionary
number theory — noun : the study of the properties of integers … Useful english dictionary
Number Theory, An approach through history from Hammurapi to Legendre — is a classic book on the history of number theory, written by André Weil.[1] The book reviews over three millennia of research on numbers but the key focus is on 19th and 20th century mathematicians. See also List of important publications in… … Wikipedia
Number Theory Foundation — The Number Theory Foundation (NTF) is a non profit organization based in the United States which supports research and conferences in the field of number theory. The NTF funds the Selfridge prize which is awarded at the ANTS conferences. External … Wikipedia
Number Theory Library — NTL Developer(s) Victor Shoup and others Stable release 5.5.2 / August 14, 2009 Written in C++ Operating system Cross platform … Wikipedia