Computational Number Theory Math
Computational Number Theory Math
Computational
Algorithmic, or Computational, Number Theory studies algorithms for performing number theoretic calculations such as highest common factor, factorisation or testing for primality.
Top: Science: Math: Number Theory: Computational
See Also:
- A chapter from "The Algorithm Design Manual" by Steven S. Skiena.
- Links and notes by Wilberd van der Kallen.
- Enter two positive integers, and click the button to see the operations of the Euclidean Algorithm.
- Connected with divisibility and factoring.
- 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.
- Notes by Al Sethuraman.
- Notes and Javascript illustrations by Robert Campbell.
- Lecture notes by Robert Campbell, December 1997.
- Some of the conjectures and open problems motivated by the "PRIMES is in P" papers, compiled at the AIM.
- Provided by the organizers of the MSRI Fall 2000 research program.
- Maintained by Keith Matthews. Papers, examples, pseudocode.
- Papers on the LLL algorithm and its applications collected by François Koeune.
| | | | | | |
Copyright © 1995-2007 Internet Advertising Solutions, Inc.
Copyright Notice | Privacy Policy | Site Map | APR
|
 |
|