Computational number theory

Study of algorithms for performing number theoretic computations

In mathematics and computer science, computational number theory, also known as algorithmic number theory, is the study of computational methods for investigating and solving problems in number theory and arithmetic geometry, including algorithms for primality testing and integer factorization, finding solutions to diophantine equations, and explicit methods in arithmetic geometry.^[1] Computational number theory has applications to cryptography, including RSA, elliptic curve cryptography and post-quantum cryptography, and is used to investigate conjectures and open problems in number theory, including the Riemann hypothesis, the Birch and Swinnerton-Dyer conjecture, the ABC conjecture, the modularity conjecture, the Sato-Tate conjecture, and explicit aspects of the Langlands program.^[1]^[2]^[3]

Software packages

References

^ ^a ^b Carl Pomerance (2009), Timothy Gowers (ed.), "Computational Number Theory" (PDF), The Princeton Companion to Mathematics, Princeton University Press
^ Eric Bach; Jeffrey Shallit (1996). Algorithmic Number Theory, Volume 1: Efficient Algorithms. MIT Press. ISBN 0-262-02405-5.
^ Henri Cohen (1993). A Course In Computational Algebraic Number Theory. Graduate Texts in Mathematics. Vol. 138. Springer-Verlag. doi:10.1007/978-3-662-02945-9. ISBN 0-387-55640-0.

External links

Media related to Computational number theory at Wikimedia Commons

Number-theoretic algorithms

Primality tests

Prime-generating

Integer factorization

Multiplication

Euclidean division

Discrete logarithm

Greatest common divisor

Modular square root

Other algorithms

Italics indicate that algorithm is for numbers of special forms

Topics in algebraic curves

Rational curves

Elliptic curves

Analytic theory	Elliptic function Elliptic integral Fundamental pair of periods Modular form
Arithmetic theory	Counting points on elliptic curves Division polynomials Hasse's theorem on elliptic curves Mazur's torsion theorem Modular elliptic curve Modularity theorem Mordell–Weil theorem Nagell–Lutz theorem Supersingular elliptic curve Schoof's algorithm Schoof–Elkies–Atkin algorithm
Applications	Elliptic curve cryptography Elliptic curve primality

Higher genus

Plane curves

Riemann surfaces

Constructions

Structure of curves

Divisors on curves	Abel–Jacobi map Brill–Noether theory Clifford's theorem on special divisors Gonality of an algebraic curve Jacobian variety Riemann–Roch theorem Weierstrass point Weil reciprocity law
Moduli	ELSV formula Gromov–Witten invariant Hodge bundle Moduli of algebraic curves Stable curve
Morphisms	Hasse–Witt matrix Riemann–Hurwitz formula Prym variety Weber's theorem (Algebraic curves)
Singularities	Acnode Crunode Cusp Delta invariant Tacnode
Vector bundles	Birkhoff–Grothendieck theorem Stable vector bundle Vector bundles on algebraic curves

v t e Number theory
Fields	Algebraic number theory (class field theory, non-abelian class field theory, Iwasawa theory, Iwasawa–Tate theory, Kummer theory) Analytic number theory (analytic theory of L-functions, probabilistic number theory, sieve theory) Geometric number theory Computational number theory Transcendental number theory Diophantine geometry (Arakelov theory, Hodge–Arakelov theory) Arithmetic combinatorics (additive number theory) Arithmetic geometry (anabelian geometry, P-adic Hodge theory) Arithmetic topology Arithmetic dynamics
Key concepts	Numbers 0 Natural numbers Unity Prime numbers Composite numbers Rational numbers Irrational numbers Algebraic numbers Transcendental numbers P-adic numbers (P-adic analysis) Arithmetic Modular arithmetic Chinese remainder theorem Arithmetic functions
Advanced concepts	Quadratic forms Modular forms L-functions Diophantine equations Diophantine approximation Continued fractions
Category List of topics List of recreational topics Wikibook Wikiversity