Algorithmic, or Computational, Number Theory studies algorithms for performing number theoretic calculations such as highest common factor, factorisation or testing for primality.
More information
More information
Subcategories 2
Related categories 4
Sites 7
A chapter from "The Algorithm Design Manual" by Steven S. Skiena.
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.
Some of the conjectures and open problems motivated by the "PRIMES is in P" papers, compiled at the AIM.
Links and notes by Wilberd van der Kallen.
Maintained by Keith Matthews. Papers, examples, pseudocode.
Connected with divisibility and factoring.
Enter two positive integers, and click the button to see the operations of the Euclidean Algorithm.
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.
Some of the conjectures and open problems motivated by the "PRIMES is in P" papers, compiled at the AIM.
Enter two positive integers, and click the button to see the operations of the Euclidean Algorithm.
A chapter from "The Algorithm Design Manual" by Steven S. Skiena.
Maintained by Keith Matthews. Papers, examples, pseudocode.
Links and notes by Wilberd van der Kallen.
Connected with divisibility and factoring.
