This tag is for questions regarding to computational number theory, the branch of number theory concerned with finding and implementing efficient computer algorithms for solving various problems in number theory.
In mathematics and computer science, computational number theory, also known as algorithmic number theory, is the study of algorithms for performing number theoretic computations. Much progress has been made in this field in recent years, both in terms of improved computer speed and in terms of finding more efficient algorithms. The aim of the computational number theory is to study the most relevant algorithm from the number theory. Two important applications of computational number theory are primality testing and prime factorization of large integers.