Computational number theory Computer Science Fundamentals
noun phrase
Definition: The area of number theory concerned with the design, analysis, and implementation of algorithms for number-theoretic computations, including problems such as primality testing, integer factorization, modular arithmetic, and related complexity analysis [Encyclopaedia of Mathematics].
.Example in context: “A survey of computational number theory viewed through the prism of my own experience and the Pari/GP software.” [Cohen 2022]
Synonym: algorithmic number theory
Related terms: computational arithmetic; cryptographic number theory