Home > Science > Math > Number Theory > Computational
Algorithmic, or Computational, Number Theory studies algorithms for performing number theoretic calculations such as highest common factor, factorisation or testing for primality.
http://www.cs.sunysb.edu/~algorith/major_section/1.2.shtml
A chapter from "The Algorithm Design Manual" by Steven S. Skiena.
http://sweet.ua.pt/tos/hobbies.html
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.
http://aimath.org/WWN/primesinp/
Some of the conjectures and open problems motivated by the "PRIMES is in P" papers, compiled at the AIM.
http://www.math.uu.nl/people/vdkallen/lllimplementations.html
Links and notes by Wilberd van der Kallen.
http://www.numbertheory.org/lll.html
Maintained by Keith Matthews. Papers, examples, pseudocode.
http://www.loria.fr/~zimmerma/records/
Connected with divisibility and factoring.
http://www.math.umn.edu/~garrett/crypto/a01/Euclid.html
Enter two positive integers, and click the button to see the operations of the Euclidean Algorithm.
Home > Science > Math > Number Theory > Computational
Thanks to DMOZ, which built a great web directory for nearly two decades and freely shared it with the web. About us