primes-utils 3.0.5 → 3.1.1

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: 4389a00aebe98cc43fc901200e8eebdf0ad704f17ce590aafa47b2fe6eadb4e1
-  data.tar.gz: af97630fb433b113734d2d04d68c7f24490373a0aec2e57f411383dccfab53e9
+  metadata.gz: 6e4efbd1adfba3980cb7d23ff8d6a604c835a1d8159993d52676941534ac9454
+  data.tar.gz: 1e730c6ec9e6e505cc7dbcaa706c7a788f25fd3b746b8d3738002f2c95d2d8bd
 SHA512:
-  metadata.gz: 92a9e70b078633b8570ad87057ec006ed3b45c9d9884f01cac28718a24dbf4479fd1429ea9b6d0074f4e8c543fdcf4b1ea912b244bccfe707e78ad1101cc35b7
-  data.tar.gz: 2f1d16062ce8618e22a9c1c1f3b790a3817199400e775d7ad0b0071ace4cfdb96bbd1d4047847316f34398b117f01187f54f48614a5edcaef55cc88cf891fcac
+  metadata.gz: 6af6def197418a3c5cf68c0a75d0ce182a96b60f1f414d6da2762ddf7156476a0d863f79bc65d08dc6824d62421f932e082ffb0b718f632a19ac416af618292a
+  data.tar.gz: 954aa75ea469ef4ccaaaf3b14b20c78d4d2c1b7e2ee7803126d40e2d35fbcd68e9682bf30710ca7127af31b2f86688951970bef2f7e51ac8ff3102973d0ca984

data/README.md

@@ -50,11 +50,15 @@ Uses PGT residues tests, then Miller-Rabin test using `primemr?`.
 
 **primemr?(k=5)**
 
-Optimized deterministic (over 64-bits) implementation of Miller-Rabin algorithm.      
-Default non-deterministic reliability set at k = 5, set higher if desired for very large numbers > 64-bts.
+Optimized deterministic (to 128-bits) implementation of Miller-Rabin algorithm.  
+It's the underlying primality test for `prime`, and used in other methods.  
+Default probabilistic reliability constant set at k = 5, set higher if desired for numbers > 128-bts.  
+Not really necessary to do though.
 
 ```
-n.prime?(6)
+5_000_000_000_000_000_003.primemr? => true
+987_654_321_012_345_678_901_382_737.primemr? 6 => true
+987_654_321_012_345_678_901_382_739.primemr? 6 => false
 ```
 
 **factors or prime_division**
@@ -80,6 +84,12 @@ Pure Ruby version equivalent of `factors`.
 Not as fast as `factors` for some values with multiple large prime factors.  
 Always available if OS doesn't have coreutils `factor`.
 
+```
+123_456_789.factors1 => [[3, 1], [7, 2], [839087, 1]]
+5_000_000_000_000_000_003.factors1 => [[5000000000000000003, 1]]
+987_654_321_012_345_678_901_382_739.factors1 => [[3, 1], [23, 1], [139, 1], [421, 1], [3469, 1], [7393, 1], [135899, 1], [70180703, 1]]
+```
+
 **primes(start=0), primesmr(start=0)**
 
 Return an array of prime values within the inclusive integers range `[start_num - end_num]`.  
@@ -108,8 +118,9 @@ prms => [1000003, 1000033, 1000037, 1000039, 1000081, 1000099]
 Provide count of primes within the inclusive integers range `[start_num - end_num]`.  
 Input order doesn't matter if both given: `start_num.primes end_num  <=> end_num.prime start_num`.  
 A single input is taken as `end_num`, and the primes count <= to it are returned.  
-`primescnt` is faster; uses SoZ to identify|count primes from closest hashed value starting point.  
-`primescntmr` is slower, but isn't memory limited, especially for very large numbers|ranges.  
+`primescnt` is generally faster; uses SoZ to identify|count primes from closest hashed value starting point.  
+`primescntmr` is situationally slower, but isn't memory limited, especially for very large numbers|ranges.  
+Can also perform effective primality test on an integer n as: `n.primescntmr n`  
 See `PRIMES-UTILS HANDBOOK` for details on best use practices.
 Also see `Error Handling`.
 
@@ -120,8 +131,11 @@ Also see `Error Handling`.
 100000.primescntmr 100500 => 40
 n=10**400; (n-500).primescntmr(n+500) => 1
 n=10**8; (25*n).primescnt => 121443371
+541.primescntmr 7919 => 901
 0.primescnt   => 0
 1.primescntmr => 0
+100.primescntmr 100 => 0
+101.primescntmr 101 => 1
 ```
 
 **primenth(p=0) or nthprime(p=0)**
@@ -174,7 +188,7 @@ Return value of previous prime < n > 2. Returns `nil` for n < 2 (and negatives)
 Displays a list of all the `primes-utils` methods available for a system.  
 Use as eg: `0.primes_utils` where input n is any `class Integer` value.
 
-Available methods for 3.0.0.
+Available methods for 3.1.1.
 
 ```
 0.primes_utils => "prime? primes primesmr primescnt primescntmr primenth|nthprime factors|prime_division factors1 next_prime prev_prime primes_utils"
@@ -194,9 +208,9 @@ If they occur you will know why now.
 This behavior is referenced to MRI Ruby.
 
 ## Coding Implementations
-The method `prime_division|factors` has 2 implementations. A pure ruby implementation, and a hybrid implementation 
+The method `prime_division|factors` has 2 implementations. A pure ruby implementation `factors1`, and a hybrid implementation 
 using the Unix cli command `factor` [5], if available on the host OS. It's an extremely fast C coded factoring algorithm, 
-part of the GNU Core Utilities package [4].
+part of the GNU Core Utilities package [4]. However, `factors1` is always exists separately.
 
 Upon loading, the gem tests if the command `factor` exists on the host OS.
 If so, it performs a system call to it within `prime_division|factors`, and Ruby reformats its output.
@@ -208,6 +222,10 @@ All the `primes-utils` methods are `instance_methods` for `Class Integer`.
 
 ## History
 ```
+3.1.1 – some methods refactoring|DRYing, documentation updates
+3.1.0 – major performance enhancements for methods primescnt, primescntmr, and nthprimes,
+        primarily by extending nth primes hash values up to 10.1 billion. Can now find nth primes
+        over ranges up to 10.1 billion, and thus prime counts up to 253+ billion, in < 30 secs at ~5Ghz.
 3.0.5 – YJIT enabled for Ruby >= 3.3, added new methods: next_prime, prev_prime.
         Uses 'bitarray' to extend memory use for methods 'nthprime', 'primes', and 'primescnt'.
 2.7.0 – more tweaking adaptive pg selection ranges in select_pg; coded using between? instead of cover?

data/lib/primes/utils/version.rb

@@ -1,5 +1,5 @@
 module Primes
   module Utils
-    VERSION = "3.0.5"
+    VERSION = "3.1.1"
   end
 end

data/lib/primes/utils.rb

@@ -17,9 +17,8 @@ module Primes
     end
 
     begin RUBY = RUBY_ENGINE rescue RUBY = 'ruby'.freeze end
-    #RUBY =  `ruby -v`.split[0] # alternative old way
 
-    if @@os_has_factor   # for platforms with cli 'factor' command
+    if @@os_has_factor  # for platforms with cli 'factor' command
 
       # Return prime factors of n in form [[-1,1],[p1,e1],...[pn,en]]
       # Use Linux|Unix coreutils cli command 'factor' for speed and large numbers
@@ -36,7 +35,7 @@ module Primes
     end  # use pure ruby versions for platforms without cli command 'factor'
 
     # Return prime factors of n in form [[-1,1],[p1,e1],..[pn,en]]
-    # Adaptively selects optimum PG of reduced factored number, if possible
+    # Uses P7 as default PG to generate factoring primes
     def factors1
       modpg, rescnt = 210, (48 + 4)         # P7's modulus and residues count
       residues = [2,3,5,7, 11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,
@@ -60,7 +59,7 @@ module Primes
     # Use pure Ruby version of `factor` if not in OS.
     alias prime_division factors1 unless @@os_has_factor
 
-    # Return value of nth prime for self > 0, or nil if self < 1
+    # Return value of nth prime for self >= 1, or nil if self < 1
     # Adaptively selects best SP PG, unless valid input PG given at runtime
     def primenth(p = 0)
       return nil if (n = self) < 1
@@ -69,56 +68,51 @@ module Primes
 
       start_num, nth, nthflag = set_start_value(n, true)
       return start_num if nthflag      # output nthprime value if n a ref prime key
-      end_num = approximate_nth(n)     # close approx to nth >= real nth
+      end_num = approx_nthprime(n)     # close approx to nth >= real nth
 
       (primes = seeds[0..seeds.index(p)]; modpg = primes.reduce(:*)) if seeds.include? p
       primes, modpg = select_pg(end_num, start_num) unless primes
 
-      prms, m, _, residues, pcs2start, * = sozcore2(end_num, start_num, modpg)
+      prms, m, _, residues, pcs_to_start, * = sozcore2(end_num, start_num, modpg)
       return unless prms               # exit gracefully if sozcore2 mem error
 
       # starting at start_num's location, find nth prime within given range
       pcnt = n > nth ? nth - 1 : primes.size
-      max  = prms.size
-      while pcnt < n && m < max; pcnt = pcnt.succ if prms[m].zero?; m = m.succ end
-      return puts "#{pcnt} not enough primes, ~nth val too small." if pcnt < n
-      k, r = (m + pcs2start - 1).divmod residues.size
+
+      while pcnt < n; pcnt = pcnt.succ if prms[m].zero?; m = m.succ end
+      k, r = (m + pcs_to_start - 1).divmod residues.size
       modpg * k + residues[r]
     end
 
     alias  nthprime  primenth          # to make life easier
 
-    # List primes between a number range: end_num - start_num
+    # List of primes within inputs range: start_num - end_num
     # Adaptively selects Strictly Prime (SP) Prime Generator
     def primes(start_num = 0)
       end_num, start_num = check_inputs(self, start_num)
 
-      primes, modpg = select_pg(end_num, start_num) # adaptively select PG
+      primes, modpg = select_pg(end_num, start_num)   # adaptively select PG
       prms, m, modk, residues, _, r = sozcore2(end_num, start_num, modpg)
       return unless prms               # exit gracefully if sozcore2 mem error
       rescnt, modpg, maxprms = residues.size, residues[-1] - 1, prms.size
 
-      # init 'primes' w/any excluded primes in range, extract primes from prms
-      primes.select! { |p| p >= start_num && p <= end_num }
+      # init 'primes' w/any modulus primes in range, extract primes from prms
+      primes.select! { |p| p.between?(start_num, end_num) }
 
-      # Find, numerate, and store primes from sieved pcs in prms for range 
+      # Find, numerate, and store primes from sieved pcs in prms for range
       while m < maxprms
-        begin
-          primes << modk + residues[r] if prms[m].zero?; m = m.succ
-        rescue Exception
-          return puts 'ERROR3: not enough sys memory for primes output array.'
-        end
+        primes << modk + residues[r] if prms[m].zero?; m = m.succ
         (r = 0; modk += modpg) if (r = r.succ) == rescnt
       end
       primes
     end
 
-    # Count primes between a number range: end_num - start_num
+    # Count of primes within inputs range: start_num - end_num
     # Adaptively selects Strictly Prime (SP) Prime Generator
     def primescnt(start_num = 0)
       end_num, start_num = check_inputs(self, start_num)
 
-      nthflag, nth = 0, 0
+      nthflag, nth = nil, 0
       if start_num < 3                 # for all primes upto num
         start_num, nth, nthflag = set_start_value(end_num, false) # closest nth value
         return nth unless nthflag      # output num's key|count if ref nth value
@@ -129,15 +123,15 @@ module Primes
       return unless prms               # exit gracefully if sozcore2 mem error
 
       # init prmcnt for any modulus primes in range; count primes in prms
-      prmcnt = primes.count { |p| p >= start_num && p <= end_num }
+      prmcnt = primes.count { |p| p.between?(start_num, end_num) }
       prmcnt = nth - 1 if nthflag && (nth > 0)  # start count for small range
       max = prms.size
       while m < max; prmcnt = prmcnt.succ if prms[m].zero?; m = m.succ end
       prmcnt
     end
 
-    # List primes within a number range: end_num - start_num
-    # Uses 'primemr' to check primality of prime candidates in range
+    # List of primes within inputs range: start_num - end_num
+    # Uses 'primemr?' to check primality of prime candidates in range
     def primesmr(start_num = 0)
       end_num, start_num = check_inputs(self, start_num)
       r, modk, residues, primes = sozcore1(end_num, start_num)
@@ -150,12 +144,12 @@ module Primes
       primes
     end
 
-    # Count primes within a number range: end_num - start_num
-    # Uses 'primemr' to check primality of prime candidates in range
+    # Count of primes within inputs range: start_num - end_num
+    # Uses 'primemr?' to check primality of prime candidates in range
     def primescntmr(start_num = 0)
       end_num, start_num = check_inputs(self, start_num)
 
-      nthflag, nth = 0, 0
+      nthflag, nth = nil, 0
       if start_num < 3                 # for all primes upto num
         start_num, nth, nthflag = set_start_value(end_num, false) # closest nth value
         return nth unless nthflag      # output num's key|count if ref nth value
@@ -173,18 +167,18 @@ module Primes
     end
 
     # PGT and Miller-Rabin combined primality tests for random n
-    def prime? (k = 5)      # Can change k higher for mr_prime?
-      #Use PGT residue checks for small values < PRIMES.last**2
+    def prime? (k = 5)       # Can change k up|down for primemr?
+      # Use PGT residue checks for small values < PRIMES.last**2
       return PRIMES.include? self if self <= PRIMES.last
       return false if MODPN.gcd(self) != 1
       return true  if self < PRIMES_LAST_SQRD
       primemr?(k)
     end
 
-    # Returns the next prime number for +self+ >= 0, or nil if n < 0
+    # Returns the next prime number for self >= 0, or nil if n < 0
     def next_prime
-      return nil if (n = self) < 0
-      return (n >> 1) + 2 if n <= 2                # return 2 if n is 0|1
+      return nil if (n = self) < 0                 # return nil if n negative
+      return (n >> 1) + 2 if n <= 2                # return 2 or 3 if n is 0|1|2
       n = n + 1 | 1                                # 1st odd number > n
       until (res = n % 6) & 0b11 == 1; n += 2 end  # n first P3 pc >= n, w/residue 1 or 5
       inc = (res == 1) ? 4 : 2                     # set its P3 PGS value, inc by 2 and 4
@@ -192,10 +186,10 @@ module Primes
       n
     end
 
-    # Returns the previous prime number < +self+, or nil if self <= 2
+    # Returns the previous prime number < self, or nil if self <= 2
     def prev_prime
-      return nil if (n = self) < 3
-      return (n >> 1) + 1 if n <= 5
+      return nil if (n = self) <= 2                # no primes for n <= 2
+      return (n >> 1) + 1 if n <= 5                # 5|4 -> 3, 3 -> 2
       n = n - 2 | 1                                # 1st odd number < n
       until (res = n % 6) & 0b11 == 1; n -= 2 end  # n first P3 pc <= n, w/residue 1 or 5
       dec = (res == 1) ? 2 : 4                     # set its P3 PGS value, dec by 2 and 4
@@ -210,7 +204,8 @@ module Primes
                    factors1 next_prime prev_prime primes_utils].join(" ")
     end
 
-    # Returns true if +self+ is a prime number, else returns false.
+    # Miller-Rabin primality test; uses deterministic witnesses for values upto 128-bits
+    # Returns true if self is a prime number, else returns false.
     def primemr? (k = 5)               # k is default number of random bases
       return false if self < 2         # return false for 0|1 and negatives
       neg_one_mod = n = d = self - 1   # these are even as self is always odd
@@ -221,10 +216,10 @@ module Primes
       witnesses.each do |b|
         next if (b % self).zero?       # **skip base if a multiple of input**
         y = b.pow(d, self)             # y = (b**d) mod self
-        s = d
+        s = d                          # set s to odd d value
         until y == 1 || y == neg_one_mod || s == n
           y = y.pow(2, self)           # y = (y**2) mod self
-          s <<= 1
+          s <<= 1                      # multiply s by 2 until its n
         end
         return false unless y == neg_one_mod || s.odd?
       end
@@ -252,13 +247,15 @@ module Primes
     PRIMES = [2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97,101,103]
     PRIMES_LAST_SQRD = PRIMES.last ** 2
 
+    # Return correct order for inputs range values start_num|end_num
+    # If either are negative then raise an error
     def check_inputs(end_num, start_num)
       raise "invalid negative input(s)" if end_num < 0 || start_num < 0
       end_num, start_num = start_num, end_num if start_num > end_num
       [end_num, start_num]
     end
 
-    # Returns for SP PG mod value array of residues [r1, r2,..mod-1, mod+1]
+    # Returns for SP PG mod value array of residues [r0, r1,..mod-1, mod+1]
     def make_residues(modpg)
       return [ 7, 11, 13, 17, 19, 23, 29, 31] if modpg == 30
       return [11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71,
@@ -266,57 +263,51 @@ module Primes
              139, 143, 149, 151, 157, 163, 167, 169, 173, 179, 181, 187, 191,
              193, 197, 199, 209, 211] if modpg == 210
       residues = []
-      pc, inc, midmod = 13, 4, modpg >> 1
-      while pc < midmod
-        residues << pc << (modpg - pc) if modpg.gcd(pc) == 1
-        pc += inc; inc ^= 0b110
+      rc, inc, midmod = 13, 4, modpg / 2
+      while rc < midmod
+        residues << rc << (modpg - rc) if modpg.gcd(rc) == 1
+        rc += inc; inc ^= 0b110
       end
       residues.sort << (modpg - 1) << (modpg + 1)
     end
 
-    # lte =  true: first output element is number of pcs <= num
-    # lte = false: num pcs <, residue index, resgroup val, for (start_)num pc
-    def pcs_to_num(num, residues, lte)
-      modpg, rescnt = residues[-1] - 1, residues.size
-      num -= 1; lte ? (num |= 1; k = num.abs/modpg) : k = (num - 1).abs/modpg
-      modk = modpg * k; r = 0
-      r = r.succ while num >= modk + residues[r]
-      [rescnt * k + r, r, modk]                # [num pcs, r index, num modulus]
-    end
-
-    def pcs_to_nums(end_num, start_num, residues)
+    # Determine number of pcs upto the effective start|end vals; w/flag
+    # The effective start_num is first pc >= start_num, first pc <= end_num,
+    # and effective range is number of pcs between them (inclusive).
+    # inputs:  end_num|start_num of range, PGs residues array, start:t|end:f flag
+    # outputs: pcs_to_num   - number of pcs < start_num or <= end_num
+    #          r            - residue index for effective start_num pc
+    #          modk         - mod resgroup value for effective num value
+    def pcs_to_num(num, residues, flag)
+      return [0, 0, 0] if num < residues[0]
       modpg, rescnt = residues[-1] - 1, residues.size
-      end_num   = 2 if end_num   < residues[0]
-      start_num = 2 if start_num < residues[0]
-      start_num -= 1; k1 = (start_num - 1)/modpg; modk1 = modpg * k1
-      end_num   -= 1; k2 = (end_num |= 1 )/modpg; modk2 = modpg * k2
-      r1 = 0; r1 = r1.succ while start_num >= modk1 + residues[r1]
-      r2 = 0; r2 = r2.succ while end_num   >= modk2 + residues[r2]
-      pcs2end = k2 * rescnt + r2; pcs2start = k1 * rescnt + r1
-      pcs_in_range = pcs2end - pcs2start
-      [pcs2end, pcs2start, r1, modk1, pcs_in_range]
+      val1, val2  = flag ? [num-2, num-1] : [(num-1)|1, (num-1)|1]
+      k = val1 / modpg; modk = k * modpg; r = 0; resk = val2 - modk
+      r = r.succ while resk >= residues[r]; pcs_to_num = k * rescnt + r
+      [pcs_to_num, r, modk]
     end
 
-    # Use default SP Prime Generator to parametize the pcs within range
-    # inputs:  end_num|start_num of range
-    # outputs: maxpcs-m - number of pcs in the range
-    #          r        - residue index value for start_num pc of range
-    #          modk     - base value for start_num's resgroup
-    #          residues - array of residues for PG: [r1..modpg-1, modpg+1]
-    #          primes array|primes.size - based on method_flag
+    # Select SP Prime Generator to parametize the pcs within inputs range
+    # inputs:  end_num and start_num of range
+    # outputs: r        - residue index value for start_num of pc inputs range
+    #          modk     - resgroup  base value for start_num
+    #          residues - array of residues [r0...mod+1] for PG
+    #          primes   - array of modulus primes in range, if any
     def sozcore1(end_num, start_num)
       range = end_num - start_num
-      modpg = range < 10_000 ? 210 : 30030
-      residues = make_residues(modpg)  # chosen PG residues
-      primes = PRIMES.select { |p| p < residues[0] && (p >= start_num && p <= end_num) }
-      start_num = 2 if start_num < residues[0]
-      k = (start_num - 2) / modpg; modk = k * modpg; r = 0
-      while (start_num - 1) >= modk + residues[r]; r = r.succ end
+      modpg = if    range <    100_001;       210  #  P7; Math.isqrt(10_000_200_001)
+              elsif range <  7_071_267;    30_030  # P13; Math.isqrt(50_002_816_985_289)
+              elsif range < 24_494_897;   510_510  # P17; Math.isqrt(600_000_000_000_000)
+              else                      9_699_690  # P19
+              end
+      residues = make_residues(modpg)       # chosen PG residues
+      primes = PRIMES.select { |p| p < residues[0] && p.between?(start_num, end_num) }
+      _, r, modk = pcs_to_num(start_num, residues, true)
       [r, modk, residues, primes]
     end
 
     # Perform SoZ with given Prime Generator and return array of parameters
-    # inputs:  end_num and start_num of range and modulus value for PG
+    # inputs:  end_num and start_num of inputs range and modulus value for PG
     # outputs: prms - binary (0,1) array of pcs within a range or to end_num
     #          m    - num of pcs in prms < start_num; so prms[m] = start_num
     #          modks    - modulus value for start_num's resgroup
@@ -324,50 +315,71 @@ module Primes
     #          pcs2start- number of pcs < start_num pc
     #          rs       - residue index location for first pc >= start_num
     def sozcore2(end_num, start_num, modpg)
-      residues = make_residues(modpg); rescnt = residues.size     
-      maxpcs, pcs2start, rs, modks, pcs_range = pcs_to_nums(end_num, start_num, residues)
-      sqrtN, inputs_range = Integer.sqrt(end_num), end_num - start_num
-      pcs2sqrtN, _ = pcs_to_nums(sqrtN, 0, residues) # num pcs <= sqrtN
-
-      m = pcs2start        # index to start retrieving primes in prms array
+      residues = make_residues(modpg)
+      rescnt, sqrtN = residues.size, Integer.sqrt(end_num)
+      pcs_to_start, rs, modks = pcs_to_num(start_num, residues, true) # num pcs <  start_num
+      maxpcs, _               = pcs_to_num(end_num, residues, false)  # num pcs <= end_num
+      pcs_to_sqrtN, _         = pcs_to_num(sqrtN, residues, false)    # num pcs <= sqrtN
+      inputs_range, pcs_range = end_num - start_num, maxpcs - pcs_to_start
+
+      m = pcs_to_start                      # index to start retrieving primes in prms array
       split_arrays = (start_num > sqrtN)    # flag, true for split arrays
-      if split_arrays      # if start_num > sqrtN create two arrays
-        maxpcs = pcs2sqrtN # array size now for primary sieve array prms
+      if split_arrays                       # if start_num > sqrtN create two arrays
+        maxpcs = pcs_to_sqrtN               # array size now for primary sieve array prms
         prms_range = array_check(pcs_range) # array for pcs in range
         raise 'ERROR1: range too big for free sys mem.' unless prms_range
-        m = 0              # index to start retrieving primes in split array
+        m = 0                               # address to start of split array
       end
       prms = array_check(maxpcs)            # array for pcs upto sqrtN, or end_num
       raise 'ERROR2: end_num too big for available sys mem.' unless prms
 
       # Sieve of Zakiya (SoZ) to eliminate nonprimes from prms, prms_range
-      pcs2sqrtN.times do |i|                # sieve primes from pcs upto sqrt(end_num)
+      pcs_to_sqrtN.times do |i|             # sieve primes from pcs upto sqrt(end_num)
         next unless prms[i].zero?           # if pc not prime, get next one
         prm_r = residues[i % rescnt]        # save its residue value
-        prime = modpg*(k=i/rescnt)+prm_r    # numerate its value; set k resgroup value
-        rem = start_num % prime             # prime's distance to start_num
-        next unless (prime - rem <= inputs_range) || rem == 0 # skip prime mults not in range
+        prime = modpg*(k=i/rescnt) + prm_r  # numerate its value; set k resgroup value
+        rem   = start_num % prime           # prime's modular distance to start_num
+        next unless (prime - rem <= inputs_range) || rem == 0 # skip prime if no multiple in range
         prmstep = prime * rescnt            # compute its primestep
         residues.each do |ri|               # find|mark its multiples
           # convert (prime * (modk + ri)) pc value to its address in prms
           kn, rr = (prm_r * ri - 2).divmod modpg
-          mult = mult1 = (k*(prime + ri) + kn)*rescnt + residues.index(rr+2) # 1st prime mult
-          while mult < maxpcs; prms[mult] = 1; mult += prmstep end
-          if split_arrays                   # when start_num > sqrtN(pcs2sqrtN+1)
-            mult = (pcs2start - mult1) % prmstep # (start_num - last mult) pcs
-            mult = prmstep - mult if mult != 0   # location in range, or beyond
-            while mult < pcs_range; prms_range[mult] = 1; mult += prmstep end
+          prm_mult = (k*(prime + ri) + kn)*rescnt + residues.index(rr+2) # 1st prime mult
+          while prm_mult < maxpcs; prms[prm_mult] = 1; prm_mult += prmstep end
+          if split_arrays                                  # when start_num > sqrtN(pcs2sqrtN+1)
+            prm_mult = (pcs_to_start - prm_mult) % prmstep # (start_num - last mult) pcs
+            prm_mult = prmstep - prm_mult if prm_mult != 0 # location in range, or beyond
+            while prm_mult < pcs_range; prms_range[prm_mult] = 1; prm_mult += prmstep end
       end end end
       # select prms array and start location val m for start_num in it
-      [(split_arrays ? prms_range : prms), m, modks, residues, pcs2start, rs]
+      [(split_arrays ? prms_range : prms), m, modks, residues, pcs_to_start, rs]
     end
 
-    def approximate_nth(n)
-      b = 0.5722 * n**0.0088
+    # Compute close approximate nthprime value >= real value
+    def approx_nthprime(n)
+      e = if    n <= 26_800_000;                                0.008702
+          elsif n.between?(   26_800_001,     144_000_000 - 0); 0.0088
+          elsif n.between?(  144_000_001,     250_000_000 - 1); 0.00881
+          elsif n.between?(  250_000_000,     800_000_000 - 1); 0.008798
+          elsif n.between?(  800_000_000,   1_000_000_000 - 1); 0.00875
+          elsif n.between?(1_000_000_000,   2_000_000_000 - 1); 0.008732
+          elsif n.between?(2_000_000_000,   3_000_000_000 - 1); 0.0086806
+          elsif n.between?(3_000_000_000,   4_000_000_000 - 1); 0.0086448
+          elsif n.between?(4_000_000_000,   5_000_000_000 - 1); 0.00862
+          elsif n.between?(5_000_000_000,   5_500_000_000 - 0); 0.008596
+          elsif n.between?(5_500_000_001,   6_500_000_000 - 0); 0.0085859
+          elsif n.between?(6_500_000_001,   7_500_000_000 - 0); 0.0085687
+          elsif n.between?(7_500_000_001,   8_500_000_000 - 0); 0.008554
+          elsif n.between?(8_500_000_001,   9_500_000_000 - 0); 0.008541
+          elsif n.between?(9_500_000_001, 100_000_000_000 - 0); 0.0085283
+          else                                                  0.00825
+          end
+      b = 0.5722 * (n**e)
       a = b * Math.log(log_n = Math.log(n))
       (n * (log_n + a) + 3).to_i
     end
 
+    # Adaptively select Strictly Prime (SP) Prime Generator
     def select_pg(end_num, start_num)       # adaptively select PG
       range = end_num - start_num
       pg = 5
@@ -382,7 +394,7 @@ module Primes
         pg = 11 if (range.between?(10**8, 10**9 - 1) && start_num < 55 * 10**7)  ||
                    (range >= 10**9 && start_num < 45 * 10**9)
       end
-      primes = [2, 3, 5, 7, 11, 13].select! { |p| p <= pg }
+      primes = PRIMES.select { |p| p <= pg }
       [primes, primes.reduce(:*)]           # [base primes, mod] for PG
     end
 
@@ -406,113 +418,195 @@ module Primes
     end
 
     def nths # hash table index of reference nth primes
-       {     1_000_000 =>     15_485_863,     5_000_000 =>     86_028_121,
-             7_500_000 =>    132_276_691,    10_000_000 =>    179_424_673,
-            12_500_000 =>    227_254_201,    15_000_000 =>    275_604_541,
-            18_500_000 =>    344_032_387,    25_000_000 =>    472_882_027,
-            31_000_000 =>    593_441_843,    37_500_000 =>    725_420_401,
-            43_500_000 =>    848_321_917,    50_000_000 =>    982_451_653,
-            56_000_000 =>  1_107_029_837,    62_500_000 =>  1_242_809_749,
-            68_500_000 =>  1_368_724_829,    75_000_000 =>  1_505_776_939,
-            81_500_000 =>  1_643_429_659,    87_500_000 =>  1_770_989_609,
-            93_500_000 =>  1_898_979_367,   100_000_000 =>  2_038_074_743,
-           106_500_000 =>  2_177_624_377,   112_500_000 =>  2_306_797_469,
-           125_000_000 =>  2_576_983_867,   137_500_000 =>  2_848_518_523,
-           150_000_000 =>  3_121_238_909,   162_500_000 =>  3_395_057_291,
-           175_000_000 =>  3_669_829_403,   187_500_000 =>  3_945_592_087,
-           200_000_000 =>  4_222_234_741,   212_500_000 =>  4_499_683_009,
-           225_000_000 =>  4_777_890_881,   237_500_000 =>  5_056_862_311,
-           250_000_000 =>  5_336_500_537,   262_500_000 =>  5_616_787_769,
-           275_000_000 =>  5_897_707_297,   287_500_000 =>  6_179_208_157,
-           300_000_000 =>  6_461_335_109,   312_500_000 =>  6_743_943_629,
-           325_000_000 =>  7_027_107_881,   337_500_000 =>  7_310_793_337,
-           350_000_000 =>  7_594_955_549,   362_500_000 =>  7_879_581_839,
-           375_000_000 =>  8_164_628_191,   387_500_000 =>  8_450_100_349,
-           400_000_000 =>  8_736_028_057,   412_500_000 =>  9_022_375_487,
-           425_000_000 =>  9_309_109_471,   437_500_000 =>  9_596_238_593,
-           450_000_000 =>  9_883_692_017,   462_500_000 => 10_171_564_687,
-           475_000_000 => 10_459_805_417,   487_500_000 => 10_748_372_137,
-           500_000_000 => 11_037_271_757,   512_500_000 => 11_326_513_039,
-           525_000_000 => 11_616_020_609,   537_500_000 => 11_905_863_799,
-           550_000_000 => 12_196_034_771,   562_500_000 => 12_486_465_863,
-           575_000_000 => 12_777_222_833,   587_500_000 => 13_068_237_251,
-           600_000_000 => 13_359_555_403,   612_500_000 => 13_651_119_389,
-           625_000_000 => 13_942_985_677,   637_500_000 => 14_235_122_851,
-           650_000_000 => 14_527_476_781,   662_500_000 => 14_820_071_503,
-           675_000_000 => 15_112_928_683,   687_500_000 => 15_406_031_899,
-           700_000_000 => 15_699_342_107,   712_500_000 => 15_992_957_251,
-           725_000_000 => 16_286_768_243,   737_500_000 => 16_580_801_137,
-           750_000_000 => 16_875_026_921,   762_500_000 => 17_169_527_171,
-           775_000_000 => 17_464_243_799,   787_500_000 => 17_759_139_259,
-           800_000_000 => 18_054_236_957,   812_500_000 => 18_349_591_409,
-           825_000_000 => 18_645_104_897,   837_500_000 => 18_940_846_207,
-           850_000_000 => 19_236_701_629,   862_500_000 => 19_532_780_327,
-           875_000_000 => 19_829_092_147,   887_500_000 => 20_125_592_731,
-           900_000_000 => 20_422_213_579,   912_500_000 => 20_719_050_323,
-           925_000_000 => 21_016_060_633,   937_500_000 => 21_313_231_963,
-           950_000_000 => 21_610_588_367,   962_500_000 => 21_908_128_993,
-           975_000_000 => 22_205_818_561,   987_500_000 => 22_503_733_657,
-         1_000_000_000 => 22_801_763_489, 1_012_500_000 => 23_099_993_743,
-         1_025_000_000 => 23_398_391_231, 1_037_500_000 => 23_696_858_797,
-         1_050_000_000 => 23_995_554_823, 1_062_500_000 => 24_294_392_179,
-         1_075_000_000 => 24_593_421_187, 1_087_500_000 => 24_892_587_403,
-         1_100_000_000 => 25_191_867_719, 1_112_500_000 => 25_491_361_037,
-         1_125_000_000 => 25_790_970_053, 1_137_500_000 => 26_090_709_563,
-         1_150_000_000 => 26_390_560_513, 1_162_500_000 => 26_690_560_601,
-         1_175_000_000 => 26_990_744_987, 1_187_500_000 => 27_291_009_337,
-         1_200_000_000 => 27_591_444_869, 1_212_500_000 => 27_892_051_267,
-         1_225_000_000 => 28_192_760_279, 1_237_500_000 => 28_493_648_629,
-         1_250_000_000 => 28_794_583_627, 1_262_500_000 => 29_095_694_269,
-         1_275_000_000 => 29_396_966_971, 1_287_500_000 => 29_698_366_099,
-         1_300_000_000 => 29_999_858_327, 1_312_500_000 => 30_301_430_881,
-         1_325_000_000 => 30_603_183_581, 1_337_500_000 => 30_905_024_497,
-         1_350_000_000 => 31_207_047_449, 1_362_500_000 => 31_509_131_153,
-         1_375_000_000 => 31_811_397_571, 1_387_500_000 => 32_113_702_069,
-         1_400_000_000 => 32_416_190_071, 1_412_500_000 => 32_718_790_873,
-         1_425_000_000 => 33_021_414_143, 1_437_500_000 => 33_324_275_711,
-         1_450_000_000 => 33_627_220_709, 1_462_500_000 => 33_930_284_893,
-         1_475_000_000 => 34_233_442_279, 1_487_500_000 => 34_536_683_891,
-         1_500_000_000 => 34_840_062_373, 1_512_500_000 => 35_143_545_889,
-         1_525_000_000 => 35_447_088_559, 1_537_500_000 => 35_750_747_297,
-         1_550_000_000 => 36_054_501_641, 1_562_500_000 => 36_358_440_731,
-         1_575_000_000 => 36_662_430_631, 1_587_500_000 => 36_966_563_321,
-         1_600_000_000 => 37_270_791_697, 1_612_500_000 => 37_575_137_933,
-         1_625_000_000 => 37_879_532_671, 1_637_500_000 => 38_184_009_763,
-         1_650_000_000 => 38_488_677_419, 1_662_500_000 => 38_793_413_899,
-         1_675_000_000 => 39_098_225_629, 1_687_500_000 => 39_403_174_463,
-         1_700_000_000 => 39_708_229_123, 1_712_500_000 => 40_013_309_359,
-         1_725_000_000 => 40_318_523_009, 1_737_500_000 => 40_623_800_311,
-         1_750_000_000 => 40_929_166_261, 1_762_500_000 => 41_234_743_751,
-         1_775_000_000 => 41_540_289_619, 1_787_500_000 => 41_845_958_971,
-         1_800_000_000 => 42_151_671_491, 1_812_500_000 => 42_457_500_313,
-         1_825_000_000 => 42_763_499_629, 1_837_500_000 => 43_069_571_603,
-         1_850_000_000 => 43_375_710_643, 1_862_500_000 => 43_681_898_699,
-         1_875_000_000 => 43_988_172_667, 1_887_500_000 => 44_294_549_347,
-         1_900_000_000 => 44_601_021_791, 1_912_500_000 => 44_907_564_593,
-         1_925_000_000 => 45_214_177_441, 1_937_500_000 => 45_520_935_011,
-         1_950_000_000 => 45_827_700_419, 1_962_500_000 => 46_134_655_219,
-         1_975_000_000 => 46_441_643_177, 1_987_500_000 => 46_748_693_981,
-         2_000_000_000 => 47_055_833_459, 2_012_500_000 => 47_363_059_687,
-         2_125_000_000 => 50_131_763_837, 2_250_000_000 => 53_215_141_519,
-         2_375_000_000 => 56_305_859_821, 2_500_000_000 => 59_403_556_879,
-         2_625_000_000 => 62_507_768_977, 2_750_000_000 => 65_618_159_808,
-         2_875_000_000 => 68_734_481_527, 3_000_000_000 => 71_856_445_751,
-         3_125_000_000 => 74_983_924_661, 3_250_000_000 => 78_116_541_127,
-         3_375_000_000 => 81_254_172_953, 3_500_000_000 => 84_396_675_733,
-         3_625_000_000 => 87_543_835_147, 3_750_000_000 => 90_695_492_941,
-         3_875_000_000 => 93_851_412_433, 4_000_000_000 => 97_011_687_217,
-         4_125_000_000 =>100_175_917_301, 4_250_000_000 => 103_344_103_553,
-         4_375_000_000 =>106_516_393_597, 4_500_000_000 => 109_692_247_799,
-         4_625_000_000 =>112_871_634_437, 4_750_000_000 => 116_054_419_753,
-         4_875_000_000 =>119_240_825_947, 5_000_000_000 => 122_430_513_841,
-         5_125_000_000 =>125_623_420_333, 5_250_000_000 => 128_819_622_391,
-         5_375_000_000 =>132_018_808_321, 5_500_000_000 => 135_221_143_753,
-         5_625_000_000 =>138_426_461_137, 5_750_000_000 => 141_634_567_969,
-         5_875_000_000 =>144_845_535_431, 6_000_000_000 => 148_059_109_201,
-         6_125_000_000 =>151_275_700_969, 6_250_000_000 => 154_494_952_609,
-         6_375_000_000 =>157_716_628_943, 6_500_000_000 => 160_940_840_461,
-         6_625_000_000 =>164_167_763_329, 6_750_000_000 => 167_397_013_051,
-         6_875_000_000 =>170_628_613_009, 7_000_000_000 => 173_862_636_221 }
+       {     1_000_000 =>     15_485_863,     2_500_000 =>      41_161_739,
+             5_000_000 =>     86_028_121,     7_500_000 =>     132_276_691,
+            10_000_000 =>    179_424_673,    12_500_000 =>     227_254_201,
+            15_000_000 =>    275_604_541,    17_500_000 =>     324_407_071,
+            20_000_000 =>    373_587_883,    22_500_000 =>     423_087_251,
+            25_000_000 =>    472_882_027,    27_500_000 =>     522_960_521,
+            31_000_000 =>    593_441_843,    37_500_000 =>     725_420_401,
+            43_500_000 =>    848_321_917,    50_000_000 =>     982_451_653,
+            56_000_000 =>  1_107_029_837,    62_500_000 =>   1_242_809_749,
+            68_500_000 =>  1_368_724_829,    75_000_000 =>   1_505_776_939,
+            81_500_000 =>  1_643_429_659,    87_500_000 =>   1_770_989_609,
+            91_000_000 =>  1_845_587_707,    95_500_000 =>   1_941_743_593,
+           100_000_000 =>  2_038_074_743,   106_250_000 =>   2_172_252_527,
+           112_500_000 =>  2_306_797_469,   118_750_000 =>   2_441_736_961,
+           125_000_000 =>  2_576_983_867,   131_250_000 =>   2_712_589_223,
+           137_500_000 =>  2_848_518_523,   143_750_000 =>   2_984_727_947,
+           150_000_000 =>  3_121_238_909,   156_250_000 =>   3_258_002_933,
+           162_500_000 =>  3_395_057_291,   168_750_000 =>   3_532_313_509,
+           175_000_000 =>  3_669_829_403,   181_250_000 =>   3_807_579_749,
+           187_500_000 =>  3_945_592_087,   193_750_000 =>   4_083_820_723,
+           200_000_000 =>  4_222_234_741,   206_250_000 =>   4_360_844_731,
+           212_500_000 =>  4_499_683_009,   218_750_000 =>   4_638_696_967,
+           225_000_000 =>  4_777_890_881,   231_250_000 =>   4_917_286_597,
+           237_500_000 =>  5_056_862_311,   243_750_000 =>   5_196_588_437,
+           250_000_000 =>  5_336_500_537,   256_250_000 =>   5_476_565_287,
+           262_500_000 =>  5_616_787_769,   268_750_000 =>   5_757_149_341,
+           275_000_000 =>  5_897_707_297,   281_250_000 =>   6_038_399_501,
+           287_500_000 =>  6_179_208_157,   293_750_000 =>   6_320_167_471,
+           300_000_000 =>  6_461_335_109,   306_250_000 =>   6_602_538_337,
+           312_500_000 =>  6_743_943_629,   318_750_000 =>   6_885_467_689,
+           325_000_000 =>  7_027_107_881,   331_250_000 =>   7_168_869_523,
+           337_500_000 =>  7_310_793_337,   343_750_000 =>   7_452_779_041,
+           350_000_000 =>  7_594_955_549,   356_250_000 =>   7_737_220_201,
+           362_500_000 =>  7_879_581_839,   368_750_000 =>   8_022_019_693,
+           375_000_000 =>  8_164_628_191,   381_250_000 =>   8_307_284_749,
+           387_500_000 =>  8_450_100_349,   393_750_000 =>   8_592_999_131,
+           400_000_000 =>  8_736_028_057,   406_250_000 =>   8_879_163_259,
+           412_500_000 =>  9_022_375_487,   418_750_000 =>   9_165_714_427,
+           425_000_000 =>  9_309_109_471,   431_000_000 =>   9_446_878_729,
+           437_500_000 =>  9_596_238_593,   443_750_000 =>   9_739_892_947,
+           450_000_000 =>  9_883_692_017,   456_500_000 =>  10_033_327_459,
+           462_500_000 => 10_171_564_687,   468_750_000 =>  10_315_624_537,
+           475_000_000 => 10_459_805_417,   481_500_000 =>  10_609_826_303,
+           487_500_000 => 10_748_372_137,   493_750_000 =>  10_892_768_429,
+           500_000_000 => 11_037_271_757,   506_250_000 =>  11_181_815_213,
+           512_500_000 => 11_326_513_039,   519_000_000 =>  11_477_051_947,
+           525_000_000 => 11_616_020_609,   531_250_000 =>  11_760_892_211,
+           537_500_000 => 11_905_863_799,   543_750_000 =>  12_050_939_503,
+           550_000_000 => 12_196_034_771,   556_250_000 =>  12_341_214_203,
+           562_500_000 => 12_486_465_863,   568_750_000 =>  12_631_810_823,
+           575_000_000 => 12_777_222_833,   581_250_000 =>  12_922_677_437,
+           587_500_000 => 13_068_237_251,   593_750_000 =>  13_213_860_971,
+           600_000_000 => 13_359_555_403,   606_250_000 =>  13_505_300_407,
+           612_500_000 => 13_651_119_389,   619_250_000 =>  13_808_675_917,
+           625_000_000 => 13_942_985_677,   631_250_000 =>  14_089_055_291,
+           637_500_000 => 14_235_122_851,   643_750_000 =>  14_381_273_323,
+           650_000_000 => 14_527_476_781,   656_250_000 =>  14_673_746_567,
+           662_500_000 => 14_820_071_503,   668_750_000 =>  14_966_474_821,
+           675_000_000 => 15_112_928_683,   681_250_000 =>  15_259_429_589,
+           687_500_000 => 15_406_031_899,   693_750_000 =>  15_552_667_763,
+           700_000_000 => 15_699_342_107,   706_250_000 =>  15_846_115_699,
+           712_500_000 => 15_992_957_251,   716_750_000 =>  16_092_830_933,
+           725_000_000 => 16_286_768_243,   731_250_000 =>  16_433_777_953,
+           737_500_000 => 16_580_801_137,   743_750_000 =>  16_727_906_893,
+           750_000_000 => 16_875_026_921,   756_250_000 =>  17_022_234_041,
+           762_500_000 => 17_169_527_171,   768_750_000 =>  17_316_837_781,
+           775_000_000 => 17_464_243_799,   781_250_000 =>  17_611_642_327,
+           787_500_000 => 17_759_139_259,   793_250_000 =>  17_894_866_747,
+           800_000_000 => 18_054_236_957,   806_250_000 =>  18_201_899_809,
+           812_500_000 => 18_349_591_409,   817_250_000 =>  18_461_848_099,
+           825_000_000 => 18_645_104_897,   831_250_000 =>  18_792_939_317,
+           837_500_000 => 18_940_846_207,   843_750_000 =>  19_088_754_313,
+           850_000_000 => 19_236_701_629,   856_250_000 =>  19_384_721_509,
+           862_500_000 => 19_532_780_327,   868_750_000 =>  19_680_906_451,
+           875_000_000 => 19_829_092_147,   881_250_000 =>  19_977_299_393,
+           887_500_000 => 20_125_592_731,   893_750_000 =>  20_273_868_583,
+           900_000_000 => 20_422_213_579,   906_250_000 =>  20_570_597_317,
+           912_500_000 => 20_719_050_323,   918_750_000 =>  20_867_520_769,
+           925_000_000 => 21_016_060_633,   931_250_000 =>  21_164_606_423,
+           937_500_000 => 21_313_231_963,   943_750_000 =>  21_461_910_023,
+           950_000_000 => 21_610_588_367,   956_250_000 =>  21_759_307_211,
+           962_500_000 => 21_908_128_993,   968_750_000 =>  22_056_948_833,
+           975_000_000 => 22_205_818_561,   981_250_000 =>  22_354_799_491,
+           987_500_000 => 22_503_733_657,   993_750_000 =>  22_652_687_809,
+         1_000_000_000 => 22_801_763_489, 1_012_500_000 =>  23_099_993_743,
+         1_025_000_000 => 23_398_391_231, 1_037_500_000 =>  23_696_858_797,
+         1_050_000_000 => 23_995_554_823, 1_062_500_000 =>  24_294_392_179,
+         1_075_000_000 => 24_593_421_187, 1_087_500_000 =>  24_892_587_403,
+         1_100_000_000 => 25_191_867_719, 1_112_500_000 =>  25_491_361_037,
+         1_125_000_000 => 25_790_970_053, 1_137_500_000 =>  26_090_709_563,
+         1_150_000_000 => 26_390_560_513, 1_162_500_000 =>  26_690_560_601,
+         1_175_000_000 => 26_990_744_987, 1_187_500_000 =>  27_291_009_337,
+         1_200_000_000 => 27_591_444_869, 1_212_500_000 =>  27_892_051_267,
+         1_225_000_000 => 28_192_760_279, 1_237_500_000 =>  28_493_648_629,
+         1_250_000_000 => 28_794_583_627, 1_262_500_000 =>  29_095_694_269,
+         1_275_000_000 => 29_396_966_971, 1_287_500_000 =>  29_698_366_099,
+         1_300_000_000 => 29_999_858_327, 1_312_500_000 =>  30_301_430_881,
+         1_325_000_000 => 30_603_183_581, 1_337_500_000 =>  30_905_024_497,
+         1_350_000_000 => 31_207_047_449, 1_362_500_000 =>  31_509_131_153,
+         1_375_000_000 => 31_811_397_571, 1_387_500_000 =>  32_113_702_069,
+         1_400_000_000 => 32_416_190_071, 1_412_500_000 =>  32_718_790_873,
+         1_425_000_000 => 33_021_414_143, 1_437_500_000 =>  33_324_275_711,
+         1_450_000_000 => 33_627_220_709, 1_462_500_000 =>  33_930_284_893,
+         1_475_000_000 => 34_233_442_279, 1_487_500_000 =>  34_536_683_891,
+         1_500_000_000 => 34_840_062_373, 1_512_500_000 =>  35_143_545_889,
+         1_525_000_000 => 35_447_088_559, 1_537_500_000 =>  35_750_747_297,
+         1_550_000_000 => 36_054_501_641, 1_562_500_000 =>  36_358_440_731,
+         1_575_000_000 => 36_662_430_631, 1_587_500_000 =>  36_966_563_321,
+         1_600_000_000 => 37_270_791_697, 1_612_500_000 =>  37_575_137_933,
+         1_625_000_000 => 37_879_532_671, 1_637_500_000 =>  38_184_009_763,
+         1_650_000_000 => 38_488_677_419, 1_662_500_000 =>  38_793_413_899,
+         1_675_000_000 => 39_098_225_629, 1_687_500_000 =>  39_403_174_463,
+         1_700_000_000 => 39_708_229_123, 1_712_500_000 =>  40_013_309_359,
+         1_725_000_000 => 40_318_523_009, 1_737_500_000 =>  40_623_800_311,
+         1_750_000_000 => 40_929_166_261, 1_762_500_000 =>  41_234_743_751,
+         1_775_000_000 => 41_540_289_619, 1_787_500_000 =>  41_845_958_971,
+         1_800_000_000 => 42_151_671_491, 1_812_500_000 =>  42_457_500_313,
+         1_825_000_000 => 42_763_499_629, 1_837_500_000 =>  43_069_571_603,
+         1_850_000_000 => 43_375_710_643, 1_862_500_000 =>  43_681_898_699,
+         1_875_000_000 => 43_988_172_667, 1_887_500_000 =>  44_294_549_347,
+         1_900_000_000 => 44_601_021_791, 1_912_500_000 =>  44_907_564_593,
+         1_925_000_000 => 45_214_177_441, 1_937_500_000 =>  45_520_935_011,
+         1_950_000_000 => 45_827_700_419, 1_962_500_000 =>  46_134_655_219,
+         1_975_000_000 => 46_441_643_177, 1_987_500_000 =>  46_748_693_081,
+         2_000_000_000 => 47_055_833_459, 2_062_500_000 =>  48_592_822_043,
+         2_125_000_000 => 50_131_763_837, 2_187_500_000 =>  51_672_463_541,
+         2_250_000_000 => 53_215_141_519, 2_312_500_000 =>  54_759_617_681,
+         2_375_000_000 => 56_305_859_821, 2_437_500_000 =>  57_853_856_521,
+         2_500_000_000 => 59_403_556_879, 2_562_500_000 =>  60_954_821_429,
+         2_625_000_000 => 62_507_768_977, 2_687_500_000 =>  64_062_179_743,
+         2_750_000_000 => 65_618_159_808, 2_812_500_000 =>  67_175_627_957,
+         2_875_000_000 => 68_734_481_527, 2_937_500_000 =>  70_294_765_447,
+         3_000_000_000 => 71_856_445_751, 3_062_500_000 =>  73_419_453_619,
+         3_125_000_000 => 74_983_924_661, 3_187_500_000 =>  76_549_505_951,
+         3_250_000_000 => 78_116_541_127, 3_312_500_000 =>  79_684_708_483,
+         3_375_000_000 => 81_254_172_953, 3_437_500_000 =>  82_824_830_279,
+         3_500_000_000 => 84_396_675_733, 3_562_500_000 =>  85_969_638_697,
+         3_625_000_000 => 87_543_835_147, 3_687_500_000 =>  89_119_062_301,
+         3_750_000_000 => 90_695_492_941, 3_812_500_000 =>  92_272_943_291,
+         3_875_000_000 => 93_851_412_433, 3_937_500_000 =>  95_431_061_423,
+         4_000_000_000 => 97_011_687_217, 4_062_500_000 =>  98_593_232_273,
+         4_125_000_000 =>100_175_917_301, 4_187_500_000 => 101_759_445_239,
+         4_250_000_000 =>103_344_103_553, 4_312_500_000 => 104_929_660_237,
+         4_375_000_000 =>106_516_393_597, 4_437_500_000 => 108_103_847_759,
+         4_500_000_000 =>109_692_247_799, 4_562_500_000 => 111_281_475_367,
+         4_625_000_000 =>112_871_634_437, 4_687_500_000 => 114_462_576_077,
+         4_750_000_000 =>116_054_419_753, 4_812_500_000 => 117_647_215_579,
+         4_875_000_000 =>119_240_825_947, 4_937_500_000 => 120_835_390_561,
+         5_000_000_000 =>122_430_513_841, 5_062_500_000 => 124_026_505_511,
+         5_125_000_000 =>125_623_420_333, 5_187_500_000 => 127_221_145_921,
+         5_250_000_000 =>128_819_622_391, 5_312_500_000 => 130_418_741_759,
+         5_375_000_000 =>132_018_808_321, 5_437_500_000 => 133_619_596_303,
+         5_500_000_000 =>135_221_143_753, 5_562_500_000 => 136_823_413_933,
+         5_625_000_000 =>138_426_461_137, 5_687_500_000 => 140_030_126_603,
+         5_750_000_000 =>141_634_567_969, 5_812_500_000 => 143_239_738_403,
+         5_875_000_000 =>144_845_535_431, 5_937_500_000 => 146_451_972_661,
+         6_000_000_000 =>148_059_109_201, 6_062_500_000 => 149_667_050_623,
+         6_125_000_000 =>151_275_700_969, 6_187_500_000 => 152_885_012_491,
+         6_250_000_000 =>154_494_952_609, 6_312_500_000 => 156_105_425_747,
+         6_375_000_000 =>157_716_628_943, 6_437_500_000 => 159_328_400_423,
+         6_500_000_000 =>160_940_840_461, 6_562_500_000 => 162_554_018_383,
+         6_625_000_000 =>164_167_763_329, 6_687_500_000 => 165_782_087_147,
+         6_750_000_000 =>167_397_013_051, 6_812_500_000 => 169_012_493_731,
+         6_875_000_000 =>170_628_613_009, 6_937_500_000 => 172_245_292_151,
+         7_000_000_000 =>173_862_636_221, 7_062_500_000 => 175_480_437_941,
+         7_125_000_000 =>177_098_901_853, 7_187_500_000 => 178_718_004_559,
+         7_250_000_000 =>180_337_540_729, 7_312_500_000 => 181_957_736_671,
+         7_375_000_000 =>183_578_464_339, 7_437_500_000 => 185_199_695_243,
+         7_500_000_000 =>186_821_628_281, 7_562_500_000 => 188_443_933_631,
+         7_625_000_000 =>190_066_857_349, 7_687_500_000 => 191_690_371_627,
+         7_750_000_000 =>193_314_249_683, 7_812_500_000 => 194_938_683_917,
+         7_875_000_000 =>196_563_769_217, 7_937_500_000 => 198_189_192_449,
+         8_000_000_000 =>199_815_106_433, 8_062_500_000 => 201_441_616_073,
+         8_125_000_000 =>203_068_844_123, 8_187_500_000 => 204_696_410_057,
+         8_250_000_000 =>206_324_421_217, 8_312_500_000 => 207_952_872_601,
+         8_375_000_000 =>209_581_922_889, 8_437_500_000 => 211_211_500_043,
+         8_500_000_000 =>212_841_570_911, 8_562_500_000 => 214_472_070_151,
+         8_625_000_000 =>216_102_910_559, 8_687_500_000 => 217_734_315_107,
+         8_750_000_000 =>219_366_232_937, 8_812_500_000 => 220_998_618_619,
+         8_875_000_000 =>222_631_402_171, 8_937_500_000 => 224_264_794_049,
+         9_000_000_000 =>225_898_512_559, 9_062_500_000 => 227_532_648_853,
+         9_125_000_000 =>229_167_269_077, 9_187_500_000 => 230_802_553_771,
+         9_250_000_000 =>232_438_083_623, 9_312_500_000 => 234_073_993_121,
+         9_375_000_000 =>235_710_242_393, 9_437_500_000 => 237_347_050_547,
+         9_500_000_000 =>238_984_246_139, 9_562_500_000 => 240_621_857_459,
+         9_625_000_000 =>242_259_972_943, 9_687_500_000 => 243_898_743_329,
+         9_750_000_000 =>245_537_657_177, 9_812_500_000 => 247_176_989_299,
+         9_875_000_000 =>248_816_855_407, 9_937_500_000 => 250_457_226_821,
+        10_000_000_000 =>252_097_800_623,10_062_500_000 => 253_738_728_317 }
     end
   end
 end

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification
 name: primes-utils
 version: !ruby/object:Gem::Version
-  version: 3.0.5
+  version: 3.1.1
 platform: ruby
 authors:
 - Jabari Zakiya
@@ -92,7 +92,7 @@ required_rubygems_version: !ruby/object:Gem::Requirement
     - !ruby/object:Gem::Version
       version: '0'
 requirements: []
-rubygems_version: 3.7.2
+rubygems_version: 4.0.3
 specification_version: 4
 summary: suite of extremely fast utility methods for testing and generating primes
 test_files: []