primes-utils 1.0.3 → 1.0.4

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: 4c974a531ffdb56d1907751ff2df0c5f451105c2
-  data.tar.gz: b9616c2850ded0be6a1cd23b58f2b5b4be1cf97c
+  metadata.gz: 6395f48acbfe0ee860220c35690d48b9c45aa045
+  data.tar.gz: 16150fa85ec9bf964012c59f04257e76665ddb79
 SHA512:
-  metadata.gz: 828be099bf80cc65d68f4d64ba6e1ce338dc7eff05eec21d6c4d9767a2880062d6905e1bcb2bcdca8b48ce2ae1a400d20769c7be127334ecc5a8f63f39d804d0
-  data.tar.gz: fa374d9ac9276859bfed141be5bcc160c907c999683d6ab5fa2a64448cea28ca393e52d67af0c5a83dd8aeb349b2cf9ae7d9b24824cf28d22cfdcd09245a8591
+  metadata.gz: 873cd552aa258335f00100627cfa5a2a4e65f3a3ac09bb5b39ebc88e4bd1b9f3039b2406b6c862d077f79f580f08094c9f5e7779dcbbd6b3ed5795a01bf36234
+  data.tar.gz: cad68673964dce20ecc8f876d75b908a29ab2537d0ddc757fe632cb5e23ce30b6fc86660a11c371f2d687db144e217ba1860b03cdc92eb795104ed8d743a892e

data/README.md

@@ -31,6 +31,8 @@ This replaces the `prime?` method  in the `prime.rb` standard library.
 101.prime? => true
 100.prime? => false
 -71.prime? => true
+  0.prime? => false
+  1.prime? => false
 ```
 **primemr?(k=20)**
 Determine if the absolute value of an integer is prime using Miller-Rabin test.  Return 'true' or 'false'.
@@ -43,6 +45,8 @@ The method's reliability can be increased by increasing the default input parame
 1111111111111111111.primemr?(50) => true
 11111111111111111111.primemr? => false
 -3333333333333333333.primemr? => false
+0.prime? => false
+1.prime? => false
 ```
 **factors(p=13)  or prime_division(p=13)**
 Determine the prime factorization of the absolute value of an integer.
@@ -57,6 +61,8 @@ Can change SP PG used on input.  Acceptable range are primes from 3 - 19.
 123456789.factors 17 => [[3, 2], [3607, 1], [3803, 1]]
 123456789.factors(17) => [[3, 2], [3607, 1], [3803, 1]]
 -12345678.factors => [[2, 1], [3, 2], [47, 1], [14593, 1]]
+0.factors => []
+1.factors => []
 ```
 **primes(start_num=0)**
 Create an array of primes from the range start_num - end_num.
@@ -82,6 +88,7 @@ Can change SP PG used on input.  Acceptable range are primes from 3 - 19.
 1500000.nthprime  => 23879519
 2000000.nthprime 13  => 32452843
 -500000.nthprime  => 7368787
+0.nthprime  => 0
 ```
 ## Coding Implementations
 The methods `primemr`, `nthprime/primenth`, and `primes` are coded in pure ruby.

data/lib/primes/utils/version.rb

@@ -1,5 +1,5 @@
 module Primes
   module Utils
-    VERSION = "1.0.3"
+    VERSION = "1.0.4"
   end
 end

data/lib/primes/utils.rb

@@ -106,7 +106,7 @@ module Primes
       primes = []
 
       n = self.abs # the desired nth prime
-      return seeds[n-1] if n < 14
+      return n != 0 ? seeds[n-1] : 0 if n < seeds.size
       numb = 22*n  # approx value need to check primes up to
 
       # find primes <= Pn, compute modPn then Prime Gen residues for Pn
@@ -166,12 +166,12 @@ module Primes
       num, start_num = start_num, num  if start_num > num
 
       primes = [2,3,5,7,11,13]      # P13 excluded primes lists
+      plast  = primes.last          # last prime in primes
+      return primes.select {|p| p >= start_num && p <= num} if num <= plast
 
-      return primes.select {|p| p >= start_num && p <= num} if num <= 13
+      mod = primes.reduce(:*)       # P13 modulus value 2*3*5*7*11*13
 
-      mod = 30030                   # P13 modulus value 2*3*5*7*11*13
-
-      residues=[1]; 17.step(mod,2) {|i| residues << i if mod.gcd(i) == 1}
+      residues=[1]; plast.step(mod,2) {|i| residues << i if mod.gcd(i) == 1}}
       rescnt = residues.size        # number of residues
       residues << mod+1             # to make algorithm easier
 
@@ -202,11 +202,11 @@ module Primes
         end
       end
       # the prms array now has all the primes positions for primes r1..N
-      primes = start_num <= 13 ? primes.drop_while {|p| p < start_num} : []
-      k = start_num / mod
-      modk = mod*k
-      m = rescnt*k
-      r = 0
+      primes = start_num <= plast ? primes.drop_while {|p| p < start_num} : []
+      k = (start_num-2).abs/mod  # start_num's residue group value
+      modk = mod*k               # start_num's mod group value
+      m = rescnt*k               # number of prms elements upto kth resgroup
+      r = 0                      # begin process at start of resgroup
       while m < maxprms
         r +=1; if r > rescnt; r=1; modk +=mod end
         if prms[m]

metadata

@@ -1,43 +1,43 @@
 --- !ruby/object:Gem::Specification
 name: primes-utils
 version: !ruby/object:Gem::Version
-  version: 1.0.3
+  version: 1.0.4
 platform: ruby
 authors:
 - Jabari Zakiya
 autorequire: 
 bindir: exe
 cert_chain: []
-date: 2015-04-02 00:00:00.000000000 Z
+date: 2015-04-03 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: bundler
-  prerelease: false
   requirement: !ruby/object:Gem::Requirement
     requirements:
     - - "~>"
       - !ruby/object:Gem::Version
         version: '1.9'
+  type: :development
+  prerelease: false
   version_requirements: !ruby/object:Gem::Requirement
     requirements:
     - - "~>"
       - !ruby/object:Gem::Version
         version: '1.9'
-  type: :development
 - !ruby/object:Gem::Dependency
   name: rake
-  prerelease: false
   requirement: !ruby/object:Gem::Requirement
     requirements:
     - - "~>"
       - !ruby/object:Gem::Version
         version: '10.0'
+  type: :development
+  prerelease: false
   version_requirements: !ruby/object:Gem::Requirement
     requirements:
     - - "~>"
       - !ruby/object:Gem::Version
         version: '10.0'
-  type: :development
 description: 'Methods: prime?, primemr?, primes, nthprime/primenth, factors/prime_division'
 email:
 - jzakiya@gmail.com