| Currently there may be errors shown on top of a page, because of a missing Wiki update (PHP version and extension DPL3). |
Navigation
| Topics | Help • Register • News • History • How to • Sequences statistics • Template prototypes |
Difference between revisions of "PrimeKit"
(restored) |
(Crandall) |
||
| Line 1: | Line 1: | ||
| − | '''PrimeKit''' is a package of Mathematica implementations of all 112 algorithms discussed in the book ''Prime Numbers: A Computational Perspective'' (2001) by [[Richard Crandall]] and Carl Pomerance. | + | '''PrimeKit''' is a package of Mathematica implementations of all 112 algorithms discussed in the book ''Prime Numbers: A Computational Perspective'' (2001) by [[Richard E. Crandall]] and [[Carl Pomerance]]. |
These algorithm sources are designed for pedagogical strength (the code is clear & tutorial, as opposed to heavily-optimized), but there is also an "Extras" folder containing some efficient number-theoretical C sources. | These algorithm sources are designed for pedagogical strength (the code is clear & tutorial, as opposed to heavily-optimized), but there is also an "Extras" folder containing some efficient number-theoretical C sources. | ||
Latest revision as of 07:13, 17 October 2024
PrimeKit is a package of Mathematica implementations of all 112 algorithms discussed in the book Prime Numbers: A Computational Perspective (2001) by Richard E. Crandall and Carl Pomerance.
These algorithm sources are designed for pedagogical strength (the code is clear & tutorial, as opposed to heavily-optimized), but there is also an "Extras" folder containing some efficient number-theoretical C sources.
The 112 programs in Mathematica were created by various authors: student interns, professors, programming experts.
