prime_methods 0.0.1 → 0.0.4

checksums.yaml

@@ -1,7 +1,7 @@
 ---
-SHA1:
-  metadata.gz: 07fbaee89b65b4aa6453dcb9eda40584742d4b31
-  data.tar.gz: da004943f89def047a85de951e2c41e7f5204f3b
+SHA256:
+  metadata.gz: 8974d423deef638427fda163831284fe35f1bdbeca8461cd04164d3308a91e48
+  data.tar.gz: a69774c5c90a1d0ad40a143d0b1e8eee4db2bed733ed29efe93b3c1790945a1e
 SHA512:
-  metadata.gz: 0fdd4b646337e51e001236e996ebd48c7c984a87b22a932ee6901c42cc6f3154b5d3361cbcd31688b9b3fc0602086ac95426c86539eac5715a0baee56cbc6128
-  data.tar.gz: f6a069e0f4375e9a946d891316ffa145a51d685ade325c9dc0e74e300debc4c096854c4c4cc2449d5c1a967345c7e6dd954efac96edb0ebbf843cf3725f5c302
+  metadata.gz: b73c5eea468b47a46f8be48f2de20141052abb80311dbc75c785365665a577b1495bcc401b83bf7e6283bb62a20dc077f0e7d6cf82182d41127bedc46c28c2e7
+  data.tar.gz: 6820bd49b640e64e24ed119deeff64d1bc4797c944e9d564a6ac09a364c23dc8d783038150b6a7e02695dd2fb87a9e35c8be86eab68786fd53b97f9d192e11cb

data/lib/prime_methods.rb

@@ -52,7 +52,7 @@ class Integer
   end
 
   def minimal_strong_jacobi( a = 0 )
-     if self < 2 then return [0, 0] end
+     return [0, 0] if self < 2
      return [0, 0] if is_square?
      if a < 2 then
        return [0, -1] if self % 4 == 3
@@ -90,7 +90,7 @@ class Integer
       s, t = ( s * ( a * s + 2 * t ) ) % self, ( ( t - s ) * ( t + s ) ) % self
       s, t = ( 2 * a * s + 2 * t ) % self, ( -2 * s ) % self if chr == "1"
     end
-    s % self == 0 && t  == ( 2 * jacobi_symbol( 2 * ( a + 2 ) ) ) % self
+    s % self == 0 && t == ( 2 * jacobi_symbol( 2 * ( a + 2 ) ) ) % self
   end
 
   def next_prime
@@ -101,4 +101,37 @@ class Integer
     n
   end
 
+  def factor
+    n = self.abs
+    return nil if n == 0
+    return 1 if n == 1
+    return 2 if n.even?
+    return 5 if n % 5 == 0
+    return n if n.is_prp? && n.is_fu?
+    a, d = 1, n
+    while d == n
+      a += 1
+      s, t, d = a, a, 1
+      while  d == 1 do
+        s = ( s * s + 1 ) % n
+        t = ( t ** 4 + 2 * t * t + 2 ) % n
+        d = n.gcd( ( s - t ).abs )
+      end
+    end
+    d
+  end
+
+  def factorize
+    n = self.abs
+    return [ ] if n == 0
+    return [1] if n == 1
+    r = []
+    while n != 1  do
+      f = n.factor
+      r << f
+      n = n / f
+    end
+    r.sort
+  end
+
 end

metadata

@@ -1,17 +1,17 @@
 --- !ruby/object:Gem::Specification
 name: prime_methods
 version: !ruby/object:Gem::Version
-  version: 0.0.1
+  version: 0.0.4
 platform: ruby
 authors:
 - Paul Underwood
 autorequire: 
 bindir: bin
 cert_chain: []
-date: 2019-01-07 00:00:00.000000000 Z
+date: 2020-02-26 00:00:00.000000000 Z
 dependencies: []
 description: 'Adds to Integer class: trial_factor, is_prp?(b=2), is_square?, jacobi_symbol,
-  minimal_strong_jacobi(a=0), is_fu?, is_bpsw2?, next_prime'
+  minimal_strong_jacobi(a=0), is_fu?, is_bpsw2?, next_prime, factor, factorize'
 email: paulunderwood@mindless.com
 executables: []
 extensions: []
@@ -37,8 +37,7 @@ required_rubygems_version: !ruby/object:Gem::Requirement
     - !ruby/object:Gem::Version
       version: '0'
 requirements: []
-rubyforge_project: 
-rubygems_version: 2.5.2.1
+rubygems_version: 3.0.3
 signing_key: 
 specification_version: 4
 summary: Adds prime number methods to Integer class