Skip to content
This repository

HTTPS clone URL

Subversion checkout URL

You can clone with HTTPS or Subversion.

Download ZIP
Browse code

Add change summaries for 0.06 - 0.08

  • Loading branch information...
commit f8c18435aedf2d9d9eec89dfce95e8ef824beac5 1 parent 618a03d
Dana Jacobsen authored February 04, 2013

Showing 1 changed file with 19 additions and 0 deletions. Show diff stats Hide diff stats

  1. 19  Changes
19  Changes
... ...
@@ -1,5 +1,24 @@
1 1
 =head1 Math::Primality Release Summaries
2 2
 
  3
+=head2 0.08
  4
+
  5
+  Use a GCD in the prime_count loop, making it much faster.
  6
+
  7
+=head2 0.07
  8
+
  9
+  All functions should work with objects that can stringify themselves.
  10
+  Math::BigInt is the obvious example of this.
  11
+
  12
+  primes.pl uses next_prime instead of is_prime.
  13
+
  14
+=head2 0.06
  15
+
  16
+  is_strong_pseudoprime() is more efficient for large inputs.
  17
+
  18
+  aks($n) changed to is_aks_prime($n).
  19
+
  20
+  Add Math::Primality::BigPolynomial, and use it for AKS.
  21
+
3 22
 =head2 0.05
4 23
 
5 24
  The AKS primality test (also known as Agrawal–Kayal–Saxena primality test) was implemented

0 notes on commit f8c1843

Please sign in to comment.
Something went wrong with that request. Please try again.