primes-utils 1.1.0 → 1.1.1

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: 7497029778cb110fc50639cd15d0dbabad984349
-  data.tar.gz: 2175a6b5900225783fddcafff2b8689a8409e7df
+  metadata.gz: b3c9d1ce71f37ddfef893df9081068e4bed16c1f
+  data.tar.gz: 8c43034d10f57ad8e4753e866c35c52b43da8d37
 SHA512:
-  metadata.gz: 300970b9508005dc6a21ca4c1d516f5e681c0127abd28b650d8d63fedd912d9d21fff5ddafdfe8143e8048c83c7e8746b96b480cb4d4bfdf4ef740a250aef741
-  data.tar.gz: 4518384b744815f59ce8303f5e5716eafd97899f04395df00d06c5397a764abd5f0d5b59fd43471a6f0531be2b77d1ec0f8c901c51071c60ccc36139c28adaf5
+  metadata.gz: f12686ee34059845f8c0525283b1d83a4076676606acce3acbd1b3c58baacd375648c8cb926aaa61b2cb69d9df109f939ec7977e7d158044bf0e028f9df4374f
+  data.tar.gz: 0e6d049b7a9787bce8ceb27cafc224d1a0e05dd8ae7438ed36ae6ecd1916351bd1dedc944e0abc8ac3a77e400edee4d902fe79d9ad71fde02a641199aea44e09

data/README.md

@@ -102,7 +102,7 @@ Can change SP PG used on input. Acceptable primes range: [3 - 19].
 ```
 1000000.primenth => 15485863
 1500000.nthprime => 23879519
-2000000.nthprime 13 => 32452843l
+2000000.nthprime 13 => 32452843
 -500000.nthprime => 7368787
 0.nthprime => 0
 ```

data/lib/primes/utils.rb

@@ -105,9 +105,11 @@ module Primes
       seeds  = [2, 3, 5, 7, 11, 13, 17, 19]
       primes = []
 
-      n = self.abs # the desired nth prime
-      return n != 0 ? seeds[n-1] : 0 if n < seeds.size
-      numb = (n*(Math.log(n)+2)).to_i # approx close value > nth prime
+      n = self.abs                  # the desired nth prime
+      return n != 0 ? seeds[n-1] : 0  if n < seeds.size
+
+      # compute approximate value of (>) nth prime to count up to
+      numb = (n*(Math.log(n)+2)).to_i
 
       # find primes <= Pn, compute modPn then Prime Gen residues for Pn
       primes = seeds[0..seeds.index(p)]; mod = primes.reduce(:*)
@@ -141,14 +143,12 @@ module Primes
         end
       end
       # the prms array now has all the primes positions for primes r1..N
-      # find the nth prime and output it
-      count = primes.size
-      modk,r=0,0
-      prms.each do |prime|
-        r +=1; if r > rescnt; r=1; modk +=mod end
-        count +=1 if prime
-        return modk+residues[r] if count == n
-      end
+      # count up to nth prime, compute value from address, and output
+      prmcnt = primes.size          # number of primes up to Pn
+      m=0
+      while prmcnt < n; prmcnt +=1 if prms[m]; m +=1 end
+      k,rr = m.divmod rescnt
+      return (mod*k + residues[rr])
     end
 
     alias  nthprime  primenth       # to make life easier

data/lib/primes/utils/version.rb

@@ -1,5 +1,5 @@
 module Primes
   module Utils
-    VERSION = "1.1.0"
+    VERSION = "1.1.1"
   end
 end

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: primes-utils
 version: !ruby/object:Gem::Version
-  version: 1.1.0
+  version: 1.1.1
 platform: ruby
 authors:
 - Jabari Zakiya
 autorequire: 
 bindir: exe
 cert_chain: []
-date: 2015-04-05 00:00:00.000000000 Z
+date: 2015-04-06 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: bundler