This is the cl-prime-maker Reference Manual, version 0.2, generated automatically by Declt version 4.0 beta 2 "William Riker" on Fri Sep 15 04:17:57 2023 GMT+0.
The main system appears first, followed by any subsystem dependency.
cl-prime-makerA simple library to generate big prime numbers in a fast way. But in some cases, the generated number is not a prime number (these are called pseudo-primes). "The probability of mis-classifying a number is approximately 2^-100. So we can be fairly sure that the classification is correct."
Xiaofeng Yang
BSD
0.2
package-init (module).
sources (module).
Modules are listed depth-first from the system components tree.
cl-prime-maker/package-initcl-prime-maker (system).
packages.lisp (file).
cl-prime-maker/sourcespackage-init (module).
cl-prime-maker (system).
prime-maker.lisp (file).
sm-ruiz-2000.lisp (file).
Files are sorted by type and then listed depth-first from the systems components trees.
cl-prime-maker/cl-prime-maker.asdcl-prime-maker/package-init/packages.lispcl-prime-maker/sources/prime-maker.lispcl-prime-maker/sources/sm-ruiz-2000.lispcl-prime-maker/cl-prime-maker.asdcl-prime-maker (system).
cl-prime-maker/package-init/packages.lisppackage-init (module).
cl-prime-maker/sources/prime-maker.lispsources (module).
make-prime (function).
primep (function).
+primes-below-65535+ (special variable).
make (function).
make-prime-list-for-range (function).
make-prime/2 (function).
make/2 (function).
new-seed (function).
pow (function).
primep/2 (function).
primep/3 (function).
random-uniform (function).
cl-prime-maker/sources/sm-ruiz-2000.lispprime-maker.lisp (file).
sources (module).
get-nth-prime (function).
*ruiz-pis* (special variable).
*ruiz-pis-part1* (special variable).
*ruiz-results* (special variable).
compute-ruiz-pi (function).
compute-ruiz-pis-part1 (function).
Packages are listed by definition order.
cl-prime-makercommon-lisp.
get-nth-prime (function).
make-prime (function).
primep (function).
*ruiz-pis* (special variable).
*ruiz-pis-part1* (special variable).
*ruiz-results* (special variable).
+primes-below-65535+ (special variable).
compute-ruiz-pi (function).
compute-ruiz-pis-part1 (function).
make (function).
make-prime-list-for-range (function).
make-prime/2 (function).
make/2 (function).
new-seed (function).
pow (function).
primep/2 (function).
primep/3 (function).
random-uniform (function).
Definitions are sorted by export status, category, package, and then by lexicographic order.
Generate the Nth prime number when N >= 1. Otherwise this function always returns 2.
Generates a random prime P with at least K decimal digits. Returns nil when k <= 0. Returns NIL otherwise. K should be an INTEGER.
Tests if N is a prime number. Returns T if N is a prime number. Returns NIL otherwise.
NOTES:
* If n <= 65535, the detection of whether a number is prime can always get the correct answer.
* If n > 65535, the detection of whether a number is prime is based on the Fermat’s little theorem.
make(n) -> I: Generates a random integer I with N decimal digits.
Computes V = (A^B) mod M. It’s much faster than (mod (expt a b) m).
| Jump to: | C F G M N P R |
|---|
| Jump to: | C F G M N P R |
|---|
| Jump to: | *
+
S |
|---|
| Jump to: | *
+
S |
|---|
| Jump to: | C F M P S |
|---|
| Jump to: | C F M P S |
|---|