number theory: Definition from Answers.com

The study of the properties and relations of the integers. There are many sets of positive integers of particular interest, such as the primes and the perfect numbers. Number theory, of ancient and continuing interest for its intrinsic beauty, also plays a crucial role in computer science, particularly in the area of cryptography.

Elementary number theory

This part of number theory does not rely on advanced mathematics, such as complex analysis and ring theory. The basic notion of elementary number theory is divisibility. An integer d is a divisor of n, written d | n, if there is an integer t such that n = dt. A prime number is a positive integer that has exactly two positive divisors, 1 and itself. The ten smallest primes are 2, 3, 5, 7, 11, 13, 17, 19, 23, and 29. Euclid (around 300 B.C.) proved that there are infinitely many primes by showing that if the only primes were 2, 3, 5, … p, a prime not in this list could be found by taking a prime factor of the number shown in Eq. (1).
1. $N = 2\cdot 3\cdot 5\cdots p + 1$
Primes are the building blocks of the positive integers. The fundamental theorem of arithmetic, established by K. F. Gauss in 1801, states that every positive integer can be written as the product of prime factors in exactly one way when the order of the primes is disregarded.

A perfect number is a positive integer equal to the sum of its positive divisors other than itself. L. Euler showed that 2ⁿ⁻¹(2ⁿ − 1) is perfect if and only if 2ⁿ − 1 is prime. If 2ⁿ − 1 is prime, then n itself must be prime. Primes of the form 2^p − 1 are known as Mersenne primes after M. Mersenne, who studied them in the seventeenth century. As of 15 May 2004, there were 41 known Mersenne primes, the largest being 2^24,036,583−1, a number with 7,235,733 decimal digits.

If a − b is divisible by m, then a is called congruent to b modulo m, and this relation is written a ≡ b (mod m). This relation between integers is an equivalence relation and defines equivalence classes of numbers congruent to each other, called residue classes. Congruences to the same modulus can be added, subtracted, and multiplied in the same manner as equations. However, when both sides of a congruence are divided by the same integer d, the modulus m must be divided by gcd(d, m). There are m residue classes modulo m. The number of classes containing only numbers coprime to m is denoted by φ(m), where φ(m) is called the Euler phi function.

In the third century B.C., Eratosthenes showed how all primes up to an integer n can be found when only the primes p up to n are known. It is sufficient to delete from the list of integers, starting with 2, the multiples of all primes up to n. The remaining integers are all the primes not exceeding n.

Single equations or systems of equations in more unknowns than equations, with restrictions on solutions such as that they must all be integral, are called diophantine equations, after Diophantus who studied such equations in ancient times. A wide range of diophantine equations have been studied. For example, the diophantine equation (2)
2. $x^2 + y^2 = z^2$
has infinitely many solutions in integers. These solutions are known as pythagorean triples, since they correspond to the lengths of the sides of right triangles where these sides have integral lengths. All solutions of this equation are given by x = t(u² − v²), y = 2tuv, and z(u² + v²), where t, u, and v are positive integers.

Perhaps the most notorious diophantine equation is Eq. (3).
3. $x^n + y^n = z^n$
Fermat's last theorem states that this equation has no solutions in integers when n is an integer greater than 2 where xyz ≠ 0. Establishing Fermat's last theorem was the quest of many mathematicians over 200 years. In the 1980s, connections were made between the solutions of this equations and points on certain elliptic curves. Using the theory of elliptic curves, A. Wiles completed a proof of Fermat's last theorem based on these connections in 1995.

Algebraic number theory

Attempts to prove Fermat's last theorem led to the development of algebraic number theory, a part of number theory based on techniques from such areas as group theory, ring theory, and field theory. Gauss extended the concepts of number theory to the ring R[i] of complex numbers of the form a + bi, where a and b are integers. Ordinary primes p ≡ 3 (mod 4) are also prime in R[i], but 2 = −i(1 + i)² is not prime, nor are primes p ≡ 1 (mod 4) since such primes split as p = (a + bi)(a − bi). More generally, an algebraic number field R(θ) of degree n is generated by the root θ of a polynomial equation f(x) = 0 of degree n with rational coefficients. A number α in this field is called an algebraic integer if it satisfies an algebraic equation with integer coefficients with initial coefficient 1. The algebraic integers in an algebraic number field form an integral domain. But, prime factorization may not be unique; for example, in R[−5], 21 = 3 · 7 = (1 + 2 − 5) · (1 − 2 − 5) where each of the four factors in the two products is prime. To restore unique factorization, the concept of ideals is needed, as shown by E. E. Kummer and J. W. R. Dedekind. See also Ring theory.

Analytic number theory

There are many important results in number theory that can be established by using methods from analysis. For example, analytic methods developed by G. F. B. Riemann in 1859 were used by J. Hadamard and C. J. de la Vallée Poussin in 1896 to prove the famous prime number theorem. This theorem, first conjectured by Gauss about 1793, states that π(x), the number of primes not exceeding x, behaves as shown in Eq. (4).These methods of Riemann are based on ζ(s), the function defined by Eq. (5),
4. $\lim_{x\rightarrow\infty} {\pi (x)\over (x/{\rm log}\, x)} = 1$

5. $\zeta (s) = \sum^{\infty}_{n=1} {1\over n^s}$
where s = σ + it is a complex variable; the series in this equation is convergent for σ>1. Via an analytic continuation, this function can be defined in the whole complex plane. It is a meromorphic function with only a simple pole of residue 1 at s = 1. It can be shown that ζ(s) has no zeros for σ = 1; this result and the existence of a pole at s = 1 suffice to prove the prime number theorem. Riemann's work contains the still unproved so-called Riemann hypothesis: all zeros of ζ(s) have a real part not exceeding ½.

Diophantine approximation

A real number x is called rational if there are integers p and q such that x = p/q; otherwise x is called irrational. The number b^1/m is irrational if b is an integer which is not the mth power of an integer (for example, 2 is irrational). A real number x is called algebraic if it is the root of a monic polynomial with integer coefficients; otherwise x is called transcendental. The numbers e and π are transcendental. That π is transcendental implies that it is impossible to square the circle. See also Circle; e (mathematics).

The part of number theory called diophantine approximation is devoted to approximating numbers of a particular kind by numbers from a particular set, such as approximating irrational numbers by rational numbers with small denominators. A basic result is that, given an irrational number x, there exist infinitely many fractions h/k that satisfy the inequality (6),
6. $\left| x - {h\over k}\right| <{1\over ck^{2}}$
where c is any positive number not exceeding 5 . However, when c is greater than 5, there are irrational numbers x for whichthere are only finitely many such h/k.

In 1851, J. Liouville showed that transcendental numbers exist; he did so by demonstrating that the number x given by Eq. (7) has the property that, given any positive real number m, there is a rational number h/k that satisfies Eq. (8).
7. $x = \sum_{j = 1}^\infty 10^{-j!}$

8. $\left| x - {h\over k}\right| < {1\over k^{m}}$
.See also Algebra; Numbering systems; Zero.

Number theory is the branch of pure mathematics concerned with the properties of numbers in general, and integers in particular, as well as the wider classes of problems that arise from their study.

Number theory may be subdivided into several fields, according to the methods used and the type of questions investigated. (See the list of number theory topics.)

The terms "arithmetic" or "the higher arithmetic" as nouns are also used to refer to number theory. These are somewhat older terms, which are no longer as popular as they once were. However the word "arithmetic" is popularly used as an adjective rather than the more cumbersome phrase "number-theoretic", and also "arithmetic of" rather than "number theory of". e.g. (arithmetic geometry, arithmetic functions, arithmetic of elliptic curves).

When arranging the natural numbers in a spiral and emphasizing the prime numbers, an intriguing and not fully explained pattern is observed, called the Ulam spiral.

Fields

Elementary number theory

In elementary number theory, integers are studied without use of techniques from other mathematical fields. Questions of divisibility, use of the Euclidean algorithm to compute greatest common divisors, integer factorizations into prime numbers, investigation of perfect numbers and congruences belong here. Several important discoveries of this field are Fermat's little theorem, Euler's theorem, the Chinese remainder theorem and the law of quadratic reciprocity. The properties of multiplicative functions such as the Möbius function and Euler's φ function, integer sequences, factorials, and Fibonacci numbers all also fall into this area.

Many questions in number theory can be stated in elementary number theoretic terms, but they may require very deep consideration and new approaches outside the realm of elementary number theory to solve. Examples include:

Goldbach's conjecture concerning the expression of even numbers as sums of two primes.
Mihăilescu's theorem (formerly Catalan's conjecture) regarding successive integer powers.
The twin prime conjecture about the infinitude of prime pairs.
The Collatz conjecture concerning a simple iteration.
Fermat's Last Theorem (stated in 1637, but not proven until 1994) concerning the impossibility of finding nonzero integers x, y, z such that $x n + y n = z n$ for some integer n greater than 2.

The theory of Diophantine equations has even been shown to be undecidable (see Hilbert's tenth problem).

Analytic number theory

Analytic number theory employs the machinery of calculus and complex analysis to tackle questions about integers. The prime number theorem (PNT) and the related Riemann hypothesis are examples. Waring's problem (representing a given integer as a sum of squares, cubes etc.), the twin prime conjecture (finding infinitely many prime pairs with difference 2) and Goldbach's conjecture (writing even integers as sums of two primes) are being attacked with analytical methods as well. Proofs of the transcendence of mathematical constants, such as π or e, are also classified as analytical number theory. While statements about transcendental numbers may seem to be removed from the study of integers, they really study the possible values of polynomials with integer coefficients evaluated at, say, e; they are also closely linked to the field of Diophantine approximation, where one investigates "how well" a given real number may be approximated by a rational one.

Algebraic number theory

In algebraic number theory, the concept of a number is expanded to the algebraic numbers which are roots of polynomials with rational coefficients. These domains contain elements analogous to the integers, the so-called algebraic integers. In this setting, the familiar features of the integers (e.g. unique factorization) need not hold. The virtue of the machinery employed—Galois theory, group cohomology, class field theory, group representations and L-functions—is that it allows one to recover that order partly for this new class of numbers.

Many number theoretic questions are best attacked by studying them modulo p for all primes p (see finite fields). This is called localization and it leads to the construction of the p-adic numbers; this field of study is called local analysis and it arises from algebraic number theory.

Geometry of numbers

The geometry of numbers incorporates some basic geometric concepts, such as lattices, into number-theoretic questions. It starts with Minkowski's theorem about lattice points in convex sets, and leads to basic proofs of the finiteness of the class number and Dirichlet's unit theorem, two fundamental theorems in algebraic number theory.

Combinatorial number theory

Combinatorial number theory deals with number theoretic problems which involve combinatorial ideas in their formulations or solutions. Paul Erdős is the main founder of this branch of number theory. Typical topics include covering system, zero-sum problems, various restricted sumsets, and arithmetic progressions in a set of integers. Algebraic or analytic methods are powerful in this field. See also arithmetic combinatorics.

Computational number theory

Computational number theory studies algorithms relevant in number theory. Fast algorithms for prime testing and integer factorization have important applications in cryptography.

Arithmetic algebraic geometry

See arithmetic geometry.

Arithmetic topology

Arithmetic topology developed from a series of analogies between number fields and 3-manifolds; primes and knots pointed out by Barry Mazur and by Yuri Manin in the 1960s.

Arithmetic dynamics

Arithmetic dynamics is a field that emerged in the 1990s that amalgamates two areas of mathematics, dynamical systems and number theory. Classically, discrete dynamics refers to the study of the iteration of self-maps of the complex plane or real line. Arithmetic dynamics is the study of the number-theoretic properties of integer, rational, $p$ -adic, and/or algebraic points under repeated application of a polynomial or rational function.

Modular forms

Modular forms are (complex) analytic functions on the upper half-plane satisfying a certain kind of functional equation and growth condition. The theory of modular forms therefore belongs to complex analysis but the main importance of the theory has traditionally been in its connections with number theory. Modular forms appear in other areas, such as algebraic topology and string theory.

History

Greek number theory

Number theory was a favorite study among the Greek mathematicians of the late Hellenistic period (3rd century AD) in Alexandria, Egypt, who were aware of the Diophantine equation concept in numerous special cases. The first Greek mathematician to study these equations was Diophantus.

Diophantus also looked for a method of finding integer solutions to linear indeterminate equations, equations that lack sufficient information to produce a single discrete set of answers. The equation $x + y = 5$ is such an equation. Diophantus discovered that many indeterminate equations can be reduced to a form where a certain category of answers is known even though a specific answer is not.

Classical Indian number theory

Diophantine equations were extensively studied by mathematicians in medieval India, who were the first to systematically investigate methods for the determination of integral solutions of Diophantine equations. Aryabhata (499) gave the first explicit description of the general integral solution of the linear Diophantine equation $a y + b x = c$ , which occurs in his text Aryabhatiya. This kuttaka algorithm is considered to be one of the most significant contributions of Aryabhata in pure mathematics, which found solutions to Diophantine equations by means of continued fractions. The technique was applied by Aryabhata to give integral solutions of simultaneous linear Diophantine equations, a problem with important applications in astronomy. He also found the general solution to the indeterminate linear equation using this method.

Brahmagupta in 628 handled more difficult Diophantine equations. He used the chakravala method to solve quadratic Diophantine equations, including forms of Pell's equation, such as $61 x 2 + 1 = y 2$ . His Brahma Sphuta Siddhanta was translated into Arabic in 773 and was subsequently translated into Latin in 1126. The equation $61 x 2 + 1 = y 2$ was later posed as a problem in 1657 by the French mathematician Pierre de Fermat. The general solution to this particular form of Pell's equation was found over 70 years later by Leonhard Euler, while the general solution to Pell's equation was found over 100 years later by Joseph Louis Lagrange in 1767. Meanwhile, many centuries ago, the general solution to Pell's equation was recorded by Bhaskara II in 1150, using a modified version of Brahmagupta's chakravala method, which he also used to find the general solution to other indeterminate quadratic equations and quadratic Diophantine equations. Bhaskara's chakravala method for finding the general solution to Pell's equation was much simpler than the method used by Lagrange over 600 years later. Bhaskara also found solutions to other indeterminate quadratic, cubic, quartic, and higher-order polynomial equations. Narayana Pandit further improved on the chakravala method and found more general solutions to other indeterminate quadratic and higher-order polynomial equations.

Islamic number theory

From the 9th century, Islamic mathematics had a keen interest in number theory. The first of these mathematicians was Thabit ibn Qurra, who discovered an algorithm which allowed pairs of amicable numbers to be found, that is two numbers such that each is the sum of the proper divisors of the other. In the 10th century, Ibn Tahir al-Baghdadi looked at a slight variant of Thabit ibn Qurra's method.

In the 10th century, al-Haitham seems to have been the first to attempt to classify all even perfect numbers (numbers equal to the sum of their proper divisors) as those of the form $2 k - 1 (2 k - 1)$ where $2 k - 1$ is prime. Al-Haytham is also the first person to state Wilson's theorem, namely that if p is prime then $1 + (p - 1)!$ is divisible by $p$ . It is unclear whether he knew how to prove this result. It is called Wilson's theorem because of a comment made by Edward Waring in 1770 that John Wilson had noticed the result. There is no evidence that Wilson knew how to prove it and most certainly Waring did not. Lagrange gave the first proof in 1771.

Amicable numbers played a large role in Islamic mathematics. In the 13th century, Persian mathematician Al-Farisi gave a new proof of Thabit ibn Qurra's theorem, introducing important new ideas concerning factorisation and combinatorial methods. He also gave the pair of amicable numbers 17296, 18416 which have been attributed to Euler, but we know that these were known earlier than al-Farisi, perhaps even by Thabit ibn Qurra himself. In the 17th century, Muhammad Baqir Yazdi gave the pair of amicable numbers 9,363,584 and 9,437,056 still many years before Euler's contribution.

Early European number theory

Number theory began in Europe in the 16th and 17th centuries, with Vieta, Bachet de Meziriac, and especially Fermat, whose infinite descent method was the first general proof of diophantine questions. Fermat's Last Theorem was posed as a problem in 1637, a proof of which wasn't found until 1994. Fermat also posed the equation $61 x 2 + 1 = y 2$ as a problem in 1657.

In the eighteenth century, Euler and Lagrange made important contributions to number theory. Euler did some work on analytic number theory, and found a general solution to the equation $61 x 2 + 1 = y 2$ . Lagrange found a solution to the more general Pell's equation. Euler and Lagrange solved these Pell equations by means of continued fractions, though this was more difficult than the Indian chakravala method.

Beginnings of modern number theory

Around the beginning of the nineteenth century books of Legendre (1798), and Gauss put together the first systematic theories in Europe. Gauss's Disquisitiones Arithmeticae (1801) may be said to begin the modern theory of numbers.

The formulation of the theory of congruences starts with Gauss's Disquisitiones. He introduced the notation

$a \equiv b \pmod c,$

and explored most of the field. Chebyshev published in 1847 a work in Russian on the subject, and in France Serret popularised it.

Besides summarizing previous work, Legendre stated the law of quadratic reciprocity. This law, discovered by induction and enunciated by Euler, was first proved by Legendre in his Théorie des Nombres (1798) for special cases. Independently of Euler and Legendre, Gauss discovered the law about 1795, and was the first to give a general proof. The following have also contributed to the subject: Cauchy; Dirichlet whose Vorlesungen über Zahlentheorie is a classic; Jacobi, who introduced the Jacobi symbol; Liouville, Zeller, Eisenstein, Kummer, and Kronecker. The theory extends to include cubic and quartic reciprocity, (Gauss, Jacobi who first proved the law of cubic reciprocity, and Kummer).

To Gauss is also due the representation of numbers by binary quadratic forms.

Prime number theory

A recurring and productive theme in number theory is the study of the distribution of prime numbers. Carl Friedrich Gauss conjectured an asymptotic rule for such behaviour (the prime number theorem) as a teenager.

Dirichlet (1837) proved that every eligible arithmetic progression contains infinitely many prime numbers. Chebyshev (1850) gave useful bounds for the number of primes between two given limits. Riemann introduced complex analysis into the theory of the Riemann zeta function. This led to a relation between the zeros of the zeta function and the distribution of primes, eventually leading to a proof of prime number theorem independently by Hadamard and de la Vallée Poussin in 1896. However, an elementary proof was given later by Paul Erdős and Atle Selberg in 1949. Here elementary means that it does not use techniques of complex analysis; however, the proof is still very ingenious and difficult. The Riemann hypothesis, which would give much more accurate information, is still an open question.

Nineteenth-century developments

Cauchy, Poinsot (1845), and notably Hermite have added to the subject. In the theory of ternary forms, Eisenstein has been a leader, and to him and H. J. S. Smith is also due a noteworthy advance in the theory of forms in general. Smith gave a complete classification of ternary quadratic forms, and extended Gauss's researches concerning real quadratic forms to complex forms. The investigations concerning the representation of numbers by the sum of 4, 5, 6, 7, 8 squares were advanced by Eisenstein and the theory was completed by Smith.

Dirichlet was the first to lecture upon the subject in a German university. Among his contributions is the proof of Fermat's Last Theorem:

$x^n+y^n \neq z^n, (x,y,z \neq 0, n > 2)$

for the cases n = 5 and n = 14 (Euler and Legendre had already proved the cases n = 3 and n = 4 and therefore by implication, all multiples of 3 and 4). Among the later French writers are Borel; Poincaré, whose memoirs are numerous and valuable; Tannery, and Stieltjes. Among the leading contributors in Germany were Leopold Kronecker, Ernst Kummer, Ernst Christian Julius Schering, Paul Bachmann, and Dedekind. In Austria Stolz's Vorlesungen über allgemeine Arithmetik (1885-86), and in England Mathews' Theory of Numbers (Part I, 1892) were scholarly general works. Genocchi, Sylvester, and J. W. L. Glaisher have also added to the theory.

Late nineteenth- and early twentieth-century developments

It was the time of major advancements in number theory due to the work of Axel Thue on diophantine equations, of David Hilbert in algebraic number theory (he also proved the Waring's prime number conjecture), and to the creation of geometric number theory by Hermann Minkowski, but also thanks to Adolf Hurwitz, Georgy F. Voronoy, Waclaw Sierpinski, Derrick Norman Lehmer and several others.

Twentieth-century developments

Major figures in twentieth-century number theory include Hermann Weyl, Nikolai Chebotaryov, Emil Artin, Erich Hecke, Helmut Hasse, Alexander Gelfond, Yuri Linnik, Paul Erdős, Gerd Faltings, G. H. Hardy, Edmund Landau, Louis Mordell, John Edensor Littlewood, Ivan Niven, Srinivasa Ramanujan, André Weil, Ivan Vinogradov, Atle Selberg, Carl Ludwig Siegel, Igor Shafarevich, John Tate, Robert Langlands, Goro Shimura, Kenkichi Iwasawa, Jean-Pierre Serre, Pierre Deligne, Enrico Bombieri, Alan Baker, Peter Swinnerton-Dyer, Bryan Birch, Vladimir Drinfeld, Laurent Lafforgue, Andrew Wiles, and Richard Taylor.

Milestones in twentieth-century number theory include the proof of Fermat's Last Theorem by Andrew Wiles in 1994 and the proof of the related Taniyama–Shimura conjecture in 1999.

Applied number theory

The book "Number theory for computing"^[1] says that number theory has been applied to: "physics, chemistry, biology, computing, engineering, coding and cryptography, random number generation, acoustics, communications, graphic design and even music and business." It also says that Shiing-Shen Chern "considers number theory as a branch of applied mathematics because of its strong applicability in other fields."

Residue number system

A residue number system (RNS) represents a large integer using a set of smaller integers, so that computation may be performed more efficiently. It relies on the Chinese remainder theorem of modular arithmetic for its operation. RNS have applications in the field of digital computer arithmetic. By decomposing in this a large integer into a set of smaller integers, a large calculation can be performed as a series of smaller calculations that can be performed independently and in parallel. Because of this, it is particularly popular in hardware implementations.

Integer programming

The LLL algorithm is used in integer linear programming.

Quotations

"Mathematics is the queen of the sciences and number theory is the queen of mathematics." — Gauss^[2]
"God invented the integers; all else is the work of man." — Kronecker^[3]
"Number is the within of all things." — Attributed to Pythagoras^[4]

Notes

^ Number theory for computing
^ Quoted in Gauss zum Gedächtniss (1856) by Wolfgang Sartorius von Waltershausen
^ "Die ganzen Zahlen hat der liebe Gott gemacht, alles andere ist Menschenwerk" Heinrich Weber: Leopold Kronecker. Jahresberichte D.M.V 2 (1893) 5-31
^ L.A. Michael: The Principles of Existence & Beyond (Dec 2007) ISBN 1847991998, ISBN 978-1847991997

References & further reading

The Wikibook Discrete mathematics has a page on the topic of

Number theory

Apostol, Tom M. (1976), Introduction to analytic number theory, Undergraduate Texts in Mathematics, New York-Heidelberg: Springer-Verlag, MR 0434929, ISBN 978-0-387-90163-3
Dedekind, Richard (1963). Essays on the Theory of Numbers. Cambridge University Press. ISBN 0-486-21010-3.
Davenport, Harold (1999). The Higher Arithmetic: An Introduction to the Theory of Numbers (7th ed.). Cambridge University Press. ISBN 0-521-63446-6.
Guy, Richard K. (1981). Unsolved Problems in Number Theory. Springer-Verlag. ISBN 0-387-90593-6.
Hardy, G. H. and Wright, E. M. (1980). An Introduction to the Theory of Numbers (5th ed.). Oxford University Press. ISBN 0-19-853171-0.
Niven, Ivan, Zuckerman, Herbert S. and Montgomery, Hugh L. (1991). An Introduction to the Theory of Numbers (5th ed.). Wiley Text Books. ISBN 0-471-62546-9.
Ore, Oystein (1948). Number Theory and Its History. Dover Publications, Inc.. ISBN 0-486-65620-9.
Smith, David. History of Modern Mathematics (1906) (adapted public domain text)
Dutta, Amartya Kumar (2002). 'Diophantine equations: The Kuttaka', Resonance - Journal of Science Education.
O'Connor, John J. and Robertson, Edmund F. (2004). 'Arabic/Islamic mathematics', MacTutor History of Mathematics archive.
O'Connor, John J. and Robertson, Edmund F. (2004). 'Index of Ancient Indian mathematics', MacTutor History of Mathematics archive.
O'Connor, John J. and Robertson, Edmund F. (2004). 'Numbers and Number Theory Index', MacTutor History of Mathematics archive.
Important publications in number theory

External links

Number theory portal

Number Theory Web
A Computational Introduction to Number Theory and Algebra by Victor Shoup

v • d • e Major fields of mathematics

Logic · Set theory · Category theory · Algebra (elementary – linear – abstract) · Number theory · Analysis/Calculus · Geometry · Topology · Dynamical systems · Combinatorics · Game theory · Information theory · Numerical analysis · Optimization · Computation · Probability · Statistics · Trigonometry

Category · Mathematics portal · Outline · Topics

v • d • e Major topics in Number theory

Algebraic number theory • Analytic number theory • Geometric number theory • Computational number theory • Transcendental number theory • Combinatorial number theory • Arithmetic geometry • Arithmetic topology • Arithmetic dynamics

Numbers • Natural numbers • Prime numbers • Rational numbers • Irrational numbers • Algebraic numbers • Transcendental numbers • p-adic numbers • Arithmetic • Modular arithmetic • Arithmetic functions

Quadratic forms • Modular forms • L-functions • Diophantine equations • Diophantine approximation • Continued fractions

List of recreational number theory topics • List of number theory topics

This entry is from Wikipedia, the leading user-contributed encyclopedia. It may not have been reviewed by professional editors (see full disclaimer)

Donate to Wikimedia

		Sci-Tech Dictionary. McGraw-Hill Dictionary of Scientific and Technical Terms. Copyright © 2003, 1994, 1989, 1984, 1978, 1976, 1974 by McGraw-Hill Companies, Inc. All rights reserved. Read more
		Britannica Concise Encyclopedia. Britannica Concise Encyclopedia. © 1994-2009 Encyclopædia Britannica, Inc. All rights reserved. Read more
		Sci-Tech Encyclopedia. McGraw-Hill Encyclopedia of Science and Technology. Copyright © 2005 by The McGraw-Hill Companies, Inc. All rights reserved. Read more
		Columbia Encyclopedia. The Columbia Electronic Encyclopedia, Sixth Edition Copyright © 2003, Columbia University Press. Licensed from Columbia University Press. All rights reserved. www.cc.columbia.edu/cu/cup/. Read more
		Wikipedia. This article is licensed under the Creative Commons Attribution/Share-Alike License. It uses material from the Wikipedia article "Number theory". Read more

	Fermat, Pierre de (French mathematician)
	Weil, André (French mathematician)
	geometric number theory (mathematics)

	Who was best known for her work on number theory and theory of elasticity? Read answer...
	Number theory is the queen of mathematics? Read answer...
	What is euclid's theory about prime numbers? Read answer...

	What is number and number theory?
	What are some examples of number theory?
	What is the use of number theory in cryptography?