-
Notifications
You must be signed in to change notification settings - Fork 13
/
Changes
58 lines (30 loc) · 1.05 KB
/
Changes
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
=head1 Math::Primality Release Summaries
=head2 0.08
Use a GCD in the prime_count loop, making it much faster.
=head2 0.07
All functions should work with objects that can stringify themselves.
Math::BigInt is the obvious example of this.
primes.pl uses next_prime instead of is_prime.
=head2 0.06
is_strong_pseudoprime() is more efficient for large inputs.
aks($n) changed to is_aks_prime($n).
Add Math::Primality::BigPolynomial, and use it for AKS.
=head2 0.05
The AKS primality test (also known as Agrawal–Kayal–Saxena primality test) was implemented
in Math::Primality::AKS.
https://en.wikipedia.org/wiki/AKS_primality_test
=head2 0.04
a version for everyone!
=head2 0.03
=head3 0.03_03
documentation
=head3 0.03_02
optimizations and code cleanup
=head3 0.03_01
is_prime(), next_prime(), prev_prime() and prime_count()
=head3 0.03_00
is_strong_lucas_pseudoprime() implemented
=head2 0.02
documentation and house keeping cleanups
=head2 0.01 - Initial Release
is_pseudoprime() and is_strong_pseudoprime() implemented