Template:Short description 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.Template:R 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.Template:RTemplate:RTemplate:R
Software packagesEdit
Further readingEdit
- Michael E. Pohst (1993): Computational Algebraic Number Theory, Springer, ISBN 978-3-0348-8589-8
- Peter Giblin (1993): Primes and Programming: An Introduction to Number Theory with Computing, Cambridge University Press, ISBN 0-521-40988-8
- Nigel P. Smart (1998): The Algorithmic Resolution of Diophantine Equations, Cambridge University Press, ISBN 0-521-64633-2
- Ramanujachary Kumanduri and Cristina Romero (1998): Number Theory with Computer Applications, Prentice Hall, ISBN 0-13-801812-X
- Fernando Rodriguez Villegas (2007): Experimental Number Theory, Oxford University Press, ISBN 978-0-19-922730-3
- Harold M. Edwards (2008): Higher Arithmetic: An Algorithmic Introduction to Number Theory, American Mathematical Society, ISBN 978-1-4704-2153-3
- Lasse Rempe-Gillen and Rebecca Waldecker (2014). Primality Testing for Beginners. American Mathematical Society. ISBN 978-0-8218-9883-3
ReferencesEdit
External linksEdit
Template:Number-theoretic algorithms Template:Algebraic curves navbox Template:Number theory-footer