primes-utils 2.5.0 → 2.5.1

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: af94be1cfe58cb1704376223da97cdb48d6cc8a0
-  data.tar.gz: 924587a02967cd156d2115d5d1ac22d547ca9089
+  metadata.gz: 7bc5495497089b070f595b0456a1b0c00da065d8
+  data.tar.gz: fd32d881956306de64948f69171909bb4f65843c
 SHA512:
-  metadata.gz: 1b30b2ac81ef9e21321a667d3e5f009218300048367a6be81c083f3293c32b131bd1461020ec349674d7449f0bef453431aaa96b334a526c0cb065dc9c2c5ba0
-  data.tar.gz: 78bdfd7fcc6d0b9904a42b13b4cf5be82c45da2a21317e47c05efefc44928b411a6612a6b044b4ff9536a29500d49a099714c4155f1e8a4c98ab01c17c2b341e
+  metadata.gz: 12b152e50667e3646c92104e22f61cfb5e2f028d452a1fc6dc9c6eeb638dbdbe044aaab23086aa17cedd18d27188063a4293efcff1520be7ec363272c1bb06b4
+  data.tar.gz: faa16320abef1a7f78e3c5c4fa4e76a90b784ee8a3b66c9597e89dd8bab5d15dbbd1bb588f3ba88205688cd7007202a7167fd57001b0ec7c6f47debc23df4e0e

data/README.md

@@ -193,17 +193,18 @@ All the `primes-utils` methods are `instance_methods` for `class Integer`.
 
 ## History
 ```
-2.5.0 –	9 more index primes under the 110-millionth in nths; fixed Ruby 1.8 incompatibility in primes;
-	better|simpler technique for select_pg, significant speed increases for large ranges; used now
-	in all sozcore2 client methods primes, primescnt and primenth|nthprime; more code cleanups
+2.5.1 – corrected minor error in select_pg
+2.5.0 – 9 more index primes under the 110-millionth in nths; fixed Ruby 1.8 incompatibility in primes;
+        better|simpler technique for select_pg, significant speed increases for large ranges; used now
+        in all sozcore2 client methods primes, primescnt and primenth|nthprime; more code cleanups
 2.4.0 – fixed error in algorithm when ks resgroup ≤ sqrt(end_num) resgroup; algorithm now split
         arrays when start_num > sqrt(end_num) in sozcore2, whose code also signficantly optimized,
         with API change adding pcs2start value to output parameters to use in primenth, which changed
         to use it; ruby idiom code opt for set_start_value; consolidated pcs_to_num | pcs_to_start_num  
         functions into one new pcs_to_num, with associated changes in sozcore1|2; primes|cnt also
         significantly faster resulting from sozcore2 changes; massive code cleanups all-arround; added 
-	private methods select_pg (to adaptively select the pg used in primes), and array_check (used in
-	sozcore2 to catch array creation out-of-memory errors)
+        private methods select_pg (to adaptively select the pg used in primes), and array_check (used in
+        sozcore2 to catch array creation out-of-memory errors)
 2.3.0 – primescnt now finds primes upto some integer much faster, and for much larger integers
         increased index nth primes to over 2 billionth; used in nthprime|primenth and primescnt
 2.2.0 – for sozcore2: refactored to include more common code; changed output api; added memory

data/lib/primes/utils.rb

@@ -215,10 +215,10 @@ module Primes
       (d >>= 1; s += 1) while d.even?
       k.times do
         a = 2 + rand(n-4)
-        x = a.to_bn.mod_exp(d,n)      # x = (a**d) mod n
+        x = a.to_bn.mod_exp(d,n)    # x = (a**d) mod n
         next if x == 1 or x == n-1
         (s-1).times do
-          x = x.mod_exp(2,n)          # x = (x**2) mod n
+          x = x.mod_exp(2,n)        # x = (x**2) mod n
           return false if x == 1
           break if x == n-1
         end
@@ -256,7 +256,7 @@ module Primes
 
     def primes_utils                # display list of available methods
       methods = %w/prime? primemr? primes primesf primesmr primescnt
-                   primescntf primescntmr primenth|nthprime factors|prime_division/
+                   primescntf primescntmr primenth|nthprime factors|prime_division primes_utils/
       (methods - (@@os_has_factor ? [] : %w/primesf primescntf/)).join(" ")
     end
 
@@ -448,7 +448,6 @@ module Primes
       primes = [2, 3, 5]                      # use P5 for small ranges
       primes << 7  if range_size > 35*10**5   # use P7 for midsize ranges
       primes << 11 if range_size > 850*10**5  # use P11 for large ranges
-      primes << 13 if range_size > 550*10**7  # use P13 for larger ranges
       [primes, primes.reduce(:*)]   # [excluded primes, mod] for PG
     end
 

data/lib/primes/utils/version.rb

@@ -1,5 +1,5 @@
 module Primes
   module Utils
-    VERSION = "2.5.0"
+    VERSION = "2.5.1"
   end
 end

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: primes-utils
 version: !ruby/object:Gem::Version
-  version: 2.5.0
+  version: 2.5.1
 platform: ruby
 authors:
 - Jabari Zakiya
 autorequire: 
 bindir: exe
 cert_chain: []
-date: 2015-12-02 00:00:00.000000000 Z
+date: 2015-12-03 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: bundler