Algorithmic, or Computational, Number Theory studies algorithms for performing number theoretic calculations such as highest common factor, factorisation or testing for primality.
Related categories 4
Algorithm Design Manual - Number Theoretic Algorithms
A chapter from "The Algorithm Design Manual" by Steven S. Skiena.
Computational Projects in Number Theory
Interesting problems, usually requiring extensive verifications or enumerations, to occupy the idle CPU time of workstations and personal computers. Compiled by Tomás Oliveira e Silva.
Future Directions in Algorithmic Number Theory
Some of the conjectures and open problems motivated by the "PRIMES is in P" papers, compiled at the AIM.
Implementations of Extended LLL
Links and notes by Wilberd van der Kallen.
Maintained by Keith Matthews. Papers, examples, pseudocode.
Some Number Records
Connected with divisibility and factoring.
Visible Euclidean Algorithm
Enter two positive integers, and click the button to see the operations of the Euclidean Algorithm.
Last update:February 23, 2016 at 8:45:07 UTC