Number Theory

Number theory is the study of the integers—the whole numbers—and the questions that arise from them: which numbers divide which, how primes are distributed, which equations have whole-number solutions, and why.

13 frameworks, from 250 to today · Number Theory · Mathematics

still a working view ended · each leads to its entry below

Overview

Number theory is the study of the integers—the whole numbers—and the questions that arise from them: which numbers divide which, how primes are distributed, which equations have whole-number solutions, and why1. Its questions are often simple to state and extraordinarily hard to answer1. Fermat's Last Theorem, the claim that no positive whole numbers satisfy \(x^n + y^n = z^n\) for \(n > 2\), was written in a book margin around 1637 and proved only in 19942. That gap between easy statement and deep proof is characteristic of the field, and it has repeatedly forced mathematicians to build whole new branches of mathematics to settle questions about counting.

Beginnings: Babylon, Greece, and the Indian and Chinese Traditions

The oldest number theory is practical and computational. Babylonian scribes around 1800 BCE produced tables of reciprocals and solved problems equivalent to quadratic equations, and a clay tablet known as Plimpton 322 lists numbers satisfying what we would now call the Pythagorean relation. These are algorithmic achievements: recipes for finding numbers, not proofs about them.

The Greeks introduced proof. Euclid's Elements (c. 300 BCE) contains what we now call the Euclidean algorithm for finding greatest common divisors, and a proof that there are infinitely many primes134. Diophantus of Alexandria, writing in the third century CE, composed the Arithmetica, a collection of problems on finding rational solutions to equations; his name survives in "Diophantine equations," equations solved in whole or rational numbers15.

Indian and Chinese traditions developed their own powerful techniques. Indian mathematicians of the classical period solved linear congruences—equations of the form \(ax \equiv b \pmod{m}\), meaning \(ax - b\) is divisible by \(m\)—using methods that amount to the extended Euclidean algorithm; the Kuttaka method for such problems appears in the work of Aryabhata (c. 499 CE) and later authors. Chinese mathematicians of the third to fifth centuries solved systems of simultaneous congruences, the problem of finding a number with prescribed remainders on division by several moduli; the result is now called the Chinese remainder theorem16. These traditions were algorithmic and practical, aimed at calendar reckoning and astronomical calculation as much as at pure curiosity.

Fermat, Euler, and the Birth of Modern Questions

The early modern turning point came when European mathematicians, reading Diophantus and translating classical texts, began posing general questions1. Pierre de Fermat (1607–1665) is the pivotal figure1. His "little theorem"—that if \(p\) is prime and \(a\) is not divisible by \(p\), then \(a^{p-1} \equiv 1 \pmod{p}\)—gave a fundamental tool for working with congruences1. His correspondence and marginal notes launched a century of problems, including the Last Theorem and the claim that every number is a sum of four squares1.

Leonhard Euler (1707–1783) turned these scattered problems into a discipline1. He proved Fermat's little theorem, extended it to composite moduli with his totient function \(\varphi(n)\) (the count of numbers below \(n\) coprime to \(n\)), and proved the four-square theorem in 1770. Crucially, Euler connected number theory to analysis: in 1737 he showed that the sum of \(1/n^s\) over all integers diverges as \(s \to 1\), and by factoring the series he obtained the identity now called the Euler product, which expresses that sum as a product over primes. This was the first bridge between the discrete world of primes and the continuous world of functions, and it founded analytic number theory.

Gauss and the Systematic Study of Congruences

Carl Friedrich Gauss (1777–1855) gave the field its modern shape1. His Disquisitiones Arithmeticae (1801), written when he was in his early twenties, introduced the notation \(a \equiv b \pmod{m}\) and treated congruences as objects of study in their own right. Gauss proved the law of quadratic reciprocity, a relation governing when one prime is a square modulo another; it had been conjectured by Euler and Legendre, and Gauss gave the first complete proof17. He also developed the theory of binary quadratic forms—expressions like \(ax^2 + bxy + cy^2\)—and their classification, a subject that would later feed into algebraic number theory.

Gauss's work established a style: define an algebraic structure (the integers modulo \(m\)), prove structural theorems about it, and use them to settle concrete questions. This is the ancestor of what is now called elementary and algorithmic number theory—the study of divisibility, congruences, and factorization using methods close to arithmetic itself.

Algebraic Numbers and the Failure of Unique Factorization

The next great turning point came from a failed proof. In the 1840s, Gabriel Lamé and others thought they had proved Fermat's Last Theorem by factoring \(x^n + y^n\) into complex numbers built from roots of unity. Ernst Kummer (1810–1893) found the flaw: in these enlarged number systems, factorization into primes can fail to be unique. In the ordinary integers, every number factors into primes in exactly one way; in the ring of numbers \(a + b\sqrt{-5}\), for instance, \(6 = 2 \cdot 3 = (1 + \sqrt{-5})(1 - \sqrt{-5})\), two genuinely different factorizations1.

Kummer's response was to invent "ideal numbers," later formalized by Richard Dedekind (1831–1916) as ideals—subsets of a ring closed under addition and under multiplication by ring elements—which restore unique factorization at the level of ideals even when it fails for elements. This founded algebraic number theory: the study of integers by enlarging them to number fields (systems obtained by adjoining roots of polynomials to the rationals) and studying how primes behave there. Dedekind's ideals, and the class group that measures how badly unique factorization fails, became the basic vocabulary of the subject8.

Complex Analysis and the Distribution of Primes

Meanwhile analytic number theory matured. Peter Gustav Lejeune Dirichlet (1805–1859) proved in 1837 that every arithmetic progression \(a, a+q, a+2q, \ldots\) with \(a\) and \(q\) coprime contains infinitely many primes—a result that required him to introduce what are now called Dirichlet characters and Dirichlet \(L\)-functions, complex functions built from the progression19. This was the first serious use of complex analysis to answer a question about primes.

Bernhard Riemann (1826–1866) made the decisive move in an 1859 paper. He extended Euler's series to a function of a complex variable, the Riemann zeta function \(\zeta(s) = \sum n^{-s}\), showed it has an analytic continuation to the whole plane, and connected its zeros to the distribution of primes. His famous conjecture that all nontrivial zeros lie on the line with real part \(1/2\)—the Riemann Hypothesis—remains unproved and is the most famous open problem in mathematics110. The prime number theorem, proved independently by Jacques Hadamard and Charles de la Vallée Poussin in 1896, confirmed the leading term of Riemann's prediction: the number of primes below \(x\) is asymptotic to \(x / \log x\).

Class Field Theory: Describing Abelian Extensions

In the late nineteenth and early twentieth centuries, algebraic number theorists asked how primes split in number fields and how field extensions relate to the arithmetic of the base field. David Hilbert, in his 1897 Zahlbericht, surveyed the subject and conjectured a comprehensive answer for abelian extensions—extensions whose Galois group (the group of symmetries of the extension fixing the base field) is commutative. This program, class field theory, was proved in the 1920s and 1930s by Teiji Takagi, Emil Artin, Helmut Hasse, and others11. Artin's reciprocity law (1927) gave a precise correspondence between abelian extensions and certain subgroups of the ideal class group, generalizing Gauss's quadratic reciprocity to arbitrary number fields. Class field theory is one of the great achievements of twentieth-century mathematics: it completely describes the abelian part of the arithmetic of a number field.

Local Methods and \(p\)-adic Numbers

A parallel development gave number theorists a powerful local tool. Kurt Hensel (1861–1941) introduced \(p\)-adic numbers around 1900: systems in which closeness is measured by divisibility by a fixed prime \(p\), so that two numbers are "close" if their difference is divisible by a high power of \(p\). These complete the rationals in a new way, alongside the real numbers. The Hasse–Minkowski theorem (Hasse, 1920s) showed that a quadratic form has a rational solution if and only if it has solutions over the reals and over every \(p\)-adic field—a "local-global principle." This local approach, studying a problem one prime at a time and then assembling the results, became central to arithmetic geometry and remains so.

The Twentieth Century: Geometry, Modular Forms, and the Langlands Program

The twentieth century saw number theory absorb geometry and representation theory. Arithmetic geometry studies Diophantine equations through geometric objects—curves and varieties—defined over number fields. André Weil's conjectures (1949) predicted deep connections between the number of points on varieties over finite fields and topological invariants; they were proved by Bernard Dwork, Alexander Grothendieck, and Pierre Deligne, with Deligne completing the hardest part in 1974. The theory of elliptic curves—curves of the form \(y^2 = x^3 + ax + b\)—became a central testing ground, connecting Diophantine questions to complex analysis and modular forms12.

Modular forms are highly symmetric complex functions; the Taniyama–Shimura conjecture (formulated in the 1950s) claimed that every elliptic curve over the rationals is associated with a modular form13. Andrew Wiles, with Richard Taylor, proved enough of this in 1994 to establish Fermat's Last Theorem, because a counterexample would produce an elliptic curve with no modular form. The proof drew on decades of work in algebraic number theory, Galois representations, and deformation theory.

The Langlands program, proposed by Robert Langlands in the late 1960s, generalized class field theory to non-abelian extensions and to automorphic representations—a framework unifying modular forms and their higher-dimensional analogues. It conjectures deep correspondences between Galois representations and automorphic forms, and it remains the organizing vision of much current research, with major cases proved by Laurent Lafforgue (2002) and Ngô Bảo Châu (2010, Fields Medal for the fundamental lemma).

Additive and Transcendental Questions

Two other strands deserve mention. Additive number theory studies sums of numbers: Waring's problem (1770), whether every integer is a sum of a bounded number of \(k\)-th powers, was attacked by David Hilbert in 1909 and by Hardy and Littlewood's circle method in the 1920s, which also produced Vinogradov's theorem (1937) on sums of three primes. Transcendental number theory asks which numbers are roots of no polynomial with integer coefficients; Liouville showed such numbers exist in 1844, Hermite proved \(e\) transcendental in 1873, Lindemann proved \(\pi\) transcendental in 1882, and the Gelfond–Schneider theorem (1934) settled Hilbert's seventh problem. These results use analysis and algebra together and remain an active area.

The Computational Turn and the Present

From the mid-twentieth century, computers transformed number theory. The Euclidean algorithm, modular exponentiation, and primality testing became practical at scale; the RSA cryptosystem (Rivest, Shamir, Adleman, 1977) turned the difficulty of factoring large numbers into a security technology. Algorithms for factoring, for computing class groups, and for arithmetic on elliptic curves are now a major industry, and computational number theory is a recognized branch in its own right.

Today the field is organized around several interlocking approaches. Analytic number theory uses complex analysis, the circle method, and sieve methods to study primes and additive problems1. Algebraic number theory studies number fields, class groups, and Galois representations. Arithmetic geometry treats Diophantine equations through varieties and cohomology. The Langlands program provides a unifying conjectural framework connecting automorphic forms, Galois representations, and \(L\)-functions14. Computational methods test conjectures and drive applications. Open questions remain abundant: the Riemann Hypothesis, the Birch and Swinnerton-Dyer conjecture on elliptic curves, the abc conjecture, and the full Langlands correspondence are among the deepest unsolved problems, and each descends directly from the turning points above—from Euler's product, Kummer's ideals, Riemann's zeta function, and Langlands's vision.

References

  1. Number theory (introduction, Definition, History, Elementary number theory, Algebraic number theory, Analytic number theory), Wikipedia
  2. Fermat's Last Theorem, Wikipedia
  3. Prime number (History), Wikipedia
  4. Euclidean algorithm, Wikipedia
  5. Diophantine equation, Wikipedia
  6. Chinese remainder theorem, Wikipedia
  7. Quadratic reciprocity, Wikipedia
  8. Ideal class group, Wikipedia
  9. Analytic number theory, Wikipedia
  10. Riemann hypothesis, Wikipedia
  11. Class field theory (introduction, History), Wikipedia
  12. Elliptic curve, Wikipedia
  13. Modularity theorem (introduction, History), Wikipedia
  14. Langlands program, Wikipedia

The frameworks of Number Theory

Each framework is a way of working the field has used: when it held, and the question it answers.

  1. 250-Present

    Diophantine equations

    Which equations have whole-number solutions?

    Fly to its tower in Nousfarer

  2. 1770-Present

    Additive number theory

    How do integers break into sums of simpler pieces?

    Fly to its tower in Nousfarer

  3. 1801-Present
  4. 1837-Present

    Analytic number theory

    How are the primes distributed?

    About Analytic number theory
    Analytic number theory is the branch of number theory that uses the tools of mathematical analysis—limits, series, integrals, and especially complex functions—to investigate the properties of integers. Its central insight is that many deep questions about whole numbers, particularly the distribution of primes, can be answered by studying carefully constructed functions of a complex variable. This approach emerged in the 19th century as a powerful alternative to the elementary methods that had dominated number theory since Gauss, and it remains one of the most active and successful frameworks in the field.
    The core curriculum of analytic number theory begins with two fundamental objects: the Riemann zeta function ζ(s)\zeta(s) and Dirichlet L-functions. The zeta function, defined for complex ss with ℜ(s)>1\Re(s) > 1 by the series ∑n=1∞n−s\sum_{n=1}^\infty n^{-s}, encodes information about the primes through its Euler product. Dirichlet L-functions generalize the zeta function to arithmetic progressions, replacing the constant term 11 with a multiplicative character. These functions are the primary tools for studying the distribution of prime numbers. The two landmark results of the framework are Dirichlet's theorem on arithmetic progressions (1837), which uses L-functions to prove that any arithmetic progression a+nqa + nq with gcd⁡(a,q)=1\gcd(a,q)=1 contains infinitely many primes, and the Prime Number Theorem (1896), which states that the number of primes up to xx is asymptotically x/log⁡xx/\log x. Both results rely on the analytic properties of these functions, particularly their zero-free regions—regions of the complex plane where the functions do not vanish. The explicit formulas of Riemann and von Mangoldt connect the zeros of the zeta function to the distribution of primes, making the Riemann Hypothesis (that all nontrivial zeros lie on the line ℜ(s)=1/2\Re(s) = 1/2) the central unsolved problem of the field.
    Beyond multiplicative number theory—the study of primes and their distribution—analytic number theory also encompasses additive number theory, which concerns the additive structure of the integers. Classic problems include Waring's problem (representing every integer as a sum of a fixed number of kkth powers) and the Goldbach conjecture (every even number greater than 2 is the sum of two primes). These problems are attacked using a variety of analytic techniques: summation formulas such as Abel summation and the Euler–Maclaurin formula, character sums that estimate the distribution of values of Dirichlet characters, and sieve methods that provide elementary but powerful bounds on prime-like sets. The framework also draws heavily on complex analysis in number theory, using contour integration and the theory of functions of a complex variable to evaluate sums and derive asymptotic estimates.
    The intellectual history of analytic number theory begins with Peter Gustav Lejeune Dirichlet (1805–1859), who in 1837 introduced Dirichlet L-functions to prove his theorem on primes in arithmetic progressions. This was the first systematic use of analysis in number theory, and it opened a new era. The next major figure was Bernhard Riemann (1826–1866), whose 1859 memoir "On the Number of Primes Less Than a Given Magnitude" introduced the zeta function as a function of a complex variable and derived the explicit formula linking its zeros to the prime counting function. Riemann's work set the agenda for the field for the next century and a half. The Prime Number Theorem was proved independently by Jacques Hadamard (1865–1963) and Charles Jean de la Vallée-Poussin (1866–1962) in 1896, using Riemann's ideas and establishing the zero-free region of the zeta function. Later developments include the work of G. H. Hardy (1877–1947) and John Edensor Littlewood (1885–1977) on the distribution of primes and the zeros of the zeta function, the development of sieve methods by Viggo Brun (1885–1978) and later by Atle Selberg (1917–2007), and the application of analytic methods to additive problems by Hardy and Littlewood in their circle method. The framework continues to evolve, with modern techniques such as the use of automorphic forms and the Langlands program extending the reach of analytic methods into new areas.
    The 15 concepts its tower teaches
    • Character sums
    • Complex analysis in number theory
    • Dirichlet L-functions
    • Dirichlet's theorem on arithmetic progressions
    • Distribution of prime numbers
    • Euler product
    • Explicit formulas
    • Goldbach conjecture
    • Multiplicative number theory
    • Prime Number Theorem
    • Riemann zeta function
    • Sieve methods
    • Summation formulas
    • Waring's problem
    • Zero-free regions of L-functions

    Fly to its tower in Nousfarer

  5. 1840-Present

    Algebraic number theory

    How do primes behave in larger number systems?

    About Algebraic number theory
    Algebraic number theory emerged in the mid-nineteenth century as a systematic attempt to extend the methods of elementary number theory—especially the study of integer solutions to equations—into a broader realm where the integers themselves are replaced by the algebraic integers of a number field. Its central insight is that many Diophantine problems become tractable when one embeds the ordinary integers into a larger ring of algebraic integers, where the structure of ideals, rather than elements, governs arithmetic. This framework distinguishes itself from analytic number theory by its reliance on algebraic structures—rings, fields, and Galois groups—rather than on limits and estimates, and from elementary number theory by its willingness to leave the familiar terrain of Z\mathbb{Z} for the richer landscape of number fields.
    The core curriculum of algebraic number theory builds a coherent teaching spine around the concept of an algebraic number field—a finite extension of the rational numbers Q\mathbb{Q}. The first major cluster introduces the ring of integers of such a field, the natural analogue of Z\mathbb{Z}, and the fundamental objects that live inside it: ideals, prime ideals, and fractional ideals. The key structural result is that while the ring of integers may fail to be a unique factorization domain, it is always a Dedekind domain, which guarantees unique factorization of ideals into prime ideals. This shift from elements to ideals is the framework's signature move.
    The second cluster centers on the two abelian groups that encode the arithmetic of a number field: the class group, which measures the failure of unique factorization of elements, and the unit group, whose structure is described by Dirichlet's unit theorem. These are complemented by the norm and trace maps, which transfer information from the number field down to Q\mathbb{Q}, and the discriminant, which detects ramification. The third cluster introduces the Galois group of a number field extension and the splitting of primes in that extension, a topic that connects directly to class field theory and the deeper study of arithmetic.
    The intellectual history of algebraic number theory begins with a problem that elementary methods could not solve. In the 1840s, Ernst Kummer, while attempting to prove Fermat's Last Theorem for regular primes, discovered that the ring of cyclotomic integers—the integers of the field generated by a primitive ppth root of unity—did not always have unique factorization. To salvage the argument, Kummer introduced "ideal numbers," a precursor to the modern concept of an ideal. This work, published around 1847, marks the birth of the framework. Kummer's ideal numbers were later recast in more general and abstract terms by Richard Dedekind, who in the 1870s and 1880s developed the theory of ideals in rings of algebraic integers, giving the subject its modern algebraic foundation. Dedekind's formulation of Dedekind domains and the unique factorization of ideals became the canonical language of the field.
    Leopold Kronecker, a contemporary of Dedekind, pursued a different but related approach through his theory of divisors and his work on the splitting of primes in extensions. The late nineteenth century saw the consolidation of these ideas into a coherent curriculum, especially through the work of David Hilbert, whose 1897 Zahlbericht ("Report on Numbers") systematized the entire subject and set the agenda for the next generation. Hilbert's work on the theory of relative extensions and the law of reciprocity laid the groundwork for class field theory, which emerged around 1897 as the direct successor framework. Algebraic number theory thus reached its classical form in the decades between Kummer's ideal numbers and Hilbert's synthesis, and it remains the essential algebraic toolkit for number theorists, even as later frameworks like class field theory and arithmetic geometry have extended its reach.
    The 16 concepts its tower teaches
    • Algebraic number field
    • Class group
    • Dedekind domain
    • Dirichlet's unit theorem
    • Discriminant
    • Fractional ideal
    • Galois group
    • Ideal
    • Ideal numbers
    • Norm
    • Prime ideal
    • Ring of integers
    • Splitting of primes
    • Trace
    • Unique factorization of ideals
    • Unit group

    Fly to its tower in Nousfarer

  6. 1844-Present

    Transcendental number theory

    Which numbers are not roots of any polynomial?

    Fly to its tower in Nousfarer

  7. 1900-Present

    Class field theory

    How do abelian extensions of number fields work?

    Fly to its tower in Nousfarer

  8. 1900-Present

    Local methods and p-adic analysis

    How can we study numbers one prime at a time?

    Fly to its tower in Nousfarer

  9. 1920-Present

    Class field theory

    What is the complete reciprocity law for abelian extensions?

    Fly to its tower in Nousfarer

  10. 1949-Present

    Arithmetic geometry

    What is the arithmetic of geometric equations?

    Fly to its tower in Nousfarer

  11. 1950-Present

    Computational number theory

    How can machines compute with integers?

    About Computational number theory
    Computational number theory, also known as algorithmic number theory, emerged in the late twentieth century as the systematic study of explicit, efficient algorithms for classical problems in number theory. Its organizing question is not merely to prove existence or structure, but to produce concrete methods—running on actual computers—that can test primality, factor large integers, solve Diophantine equations, and compute with algebraic structures. This shift from proof to procedure was driven by the rise of electronic computers and the urgent demands of public-key cryptography, and it has since transformed how number theorists explore conjectures and design secure systems.
    A first course in computational number theory builds from fundamental algorithmic primitives to sophisticated sieves and lattice techniques. The curriculum typically opens with the Fast Fourier transform for multiplication, which enables efficient arithmetic on the large integers required in cryptography and factorization. From there, students encounter the core problems of primality testing (deterministic tests like AKS, probabilistic ones like Miller–Rabin) and integer factorization, including the quadratic sieve and the number field sieve. Next come algebraic and geometric methods: elliptic curve cryptography, which applies group-law computations on elliptic curves over finite fields; lattice reduction via the LLL algorithm, a tool for finding short vectors and solving approximation problems; and finite field arithmetic, the foundation for many cryptographic protocols. More advanced topics include computational class field theory, which makes explicit the ray class groups and Hilbert class fields; algorithms for Pell's equation, relying on continued fractions and unit group computations; computational modular forms, with algorithms for Hecke operators and spaces of modular forms; and general Diophantine equation solving algorithms that combine these techniques to find integer or rational points on curves.
    The intellectual roots of computational number theory stretch back to Euclid’s algorithm and Gauss’s methods, but the framework crystallized between 1970 and the present. A pivotal early figure was Derrick Henry Lehmer (1905–1991), whose work on sieve machines and primality tests foreshadowed later developments. In the 1970s and 1980s, the advent of powerful computers and the invention of public-key cryptography (RSA, 1977) concentrated attention on efficient algorithms. Donald Knuth’s The Art of Computer Programming (1968– ) systematized algorithmic analysis, while Carl Pomerance (born 1944) introduced the quadratic sieve (1981), a practical factorization algorithm. The LLL algorithm, published by Hendrik Lenstra, Arjen Lenstra, and László Lovász in 1982, provided a general tool for lattice problems with profound applications in number theory. Henri Cohen’s A Course in Computational Algebraic Number Theory (1993) became the standard reference, codifying computational class field theory and algebraic number theory. Victor Shoup’s A Computational Introduction to Number Theory and Algebra (2005) offered a rigorous algorithmic treatment. The number field sieve, developed by John Pollard and others in the 1990s, gave the fastest method for factoring large integers. These works, alongside the cryptographic needs of RSA and elliptic curve cryptography, established computational number theory as an indispensable branch of the discipline.
    Computational number theory does not replace earlier frameworks—it supplements them. It relies on algebraic number theory for class field computations, on elliptic curves theory for cryptography, and on analytic number theory for estimates of running times. Its distinctive contribution is the demand that every theorem produce an explicit algorithm, a stance that has deepened our understanding of classical problems and enabled practical applications from secure communication to experimental verification of conjectures.
    The 12 concepts its tower teaches
    • Algorithms for Pell's equation
    • Computational class field theory
    • Computational modular forms
    • Diophantine equation solving algorithms
    • Elliptic curve cryptography
    • Fast Fourier transform for multiplication
    • Finite field arithmetic
    • Integer factorization
    • Lattice reduction (LLL algorithm)
    • Number field sieve
    • Primality testing
    • Quadratic sieve

    Fly to its tower in Nousfarer

  12. 1955-Present
  13. 1967-Present

    Langlands program

    How do Galois representations correspond to automorphic forms?

    Fly to its tower in Nousfarer

How the ideas connect

Each arrow runs from an earlier idea to the later one it shaped. The list below says what passed between them.

Diophantine equationsAdditive number theoryElementary and algorithmic number the…Analytic number theoryAlgebraic number theoryTranscendental number theoryClass field theoryLocal methods and p-adic analysisClass field theoryArithmetic geometryComputational number theoryModular forms and automorphic represe…Langlands program

Beyond the field

Where Number Theory's ideas came from in other fields, and what they led to there: the strongest 12 of 141 links.

A city in Nousfarer: a red-carpeted stair climbing terraces to a crowned tower on an acropolis, more towers round it, forest and snowy mountains beyond.
A city in Nousfarer, the game played in the browser.

Number Theory is a planet in Nousfarer

Its city has a tower for each of these 13 frameworks. Land, walk in, and climb one concept at a time.

Land on Number Theory

Related fields

Fields its ideas are linked to

More in Number Theory

See where Number Theory sits on the Map of Human Knowledge