numb 0.8.0 → 0.9.0

data/VERSION

@@ -1 +1 @@
-0.8.0
+0.9.0

data/lib/numb/primitive_pseudoperfect.rb

@@ -0,0 +1,5 @@
+class Integer
+  def primitive_pseudoperfect?
+    pseudoperfect? and proper_positive_divisors.sort.none?(&:pseudoperfect?)
+  end
+end

data/lib/numb/semiperfect.rb

@@ -0,0 +1,20 @@
+# coding: utf-8
+class Integer
+   def semiperfect?
+     return false if deficient?
+     return true if perfect?
+     possibles, divisors = { 0 => true}, proper_positive_divisors
+     proper_sod = (sod = sum_of_divisors || 0) - self
+     divisors.reverse.each do |divisor|
+       possibles.keys.each do |possible|
+         possibles.delete(possible) if possible + sod < self 
+         x = possible + divisor
+         return true if x == self or x == proper_sod 
+         possibles[x] = true if x < self        
+       end
+       sod -= divisor
+     end
+     false
+   end
+  alias :pseudoperfect? :semiperfect?
+end

data/lib/numb/weird.rb

@@ -3,6 +3,6 @@ class Integer
   def weird?
     return false unless self > 0
     return false if odd? && self < (10 ** 17)
-    not semi_perfect? and abundant?
+    not semiperfect? and abundant?
   end
 end

data/lib/numb.rb

@@ -5,10 +5,10 @@ libs = %w{abundant achilles automorphic balanced_prime carol composite deficient
           extravagant factorion frugal happy harshad hilbert hyperperfect 
           impolite kaprekar keith kynea lucas lucas_carmichael mms_pair mobius 
           narcissistic nivenmorphic ordinal parasitic perfect perfect_power 
-          polite polydivisible powerful practical pronic self self_descriptive
-          semi_perfect semiprime smarandache_wellin smith sophie_germain_prime 
-          sphenic square square_free triangular trimorphic undulating vampire 
-          weird
+          polite polydivisible powerful practical primitive_pseudoperfect
+          pronic self self_descriptive semiperfect semiprime 
+          smarandache_wellin smith sophie_germain_prime sphenic square 
+          square_free triangular trimorphic undulating vampire weird
 }
 
 class Integer

data/spec/primitive_pseudoperfect_spec.rb

@@ -0,0 +1,18 @@
+describe Integer, "#primitive_pseudoperfect" do
+  PPP = [6,20,28,88,104,272,304,350,368,464,490,496,550,
+         572,650,748,770,910,945,1184,1190,1312,1330,1376,
+         1430,1504,1575,1610,1696,1870,1888,1952,2002,2030,
+         2090,2170,2205,2210,2470,2530,2584,2590,2870,2990,
+         3010,3128,3190,3230,3290,3410,3465,3496,3710,3770,
+         3944,4070,4095,4130,4216,4270,4288,4408,4510,4544,
+         4672,4690,4712,4730,4970]
+  it "returns true for primitive pseudoperfect numbers" do
+    PPP.shuffle.first(10).each{|_| _.should be_primitive_pseudoperfect}
+  end
+
+  it "returns true for primitive pseudoperfect numbers" do
+    ((1..PPP.max).to_a - PPP).shuffle.
+                              first(10).
+                              each{|_| _.should_not be_primitive_pseudoperfect}
+  end
+end

data/spec/semi_perfect_spec.rb

@@ -1,4 +1,4 @@
-describe Integer, "#semi_perfect?" do
+describe Integer, "#semiperfect?" do
   SEMI_PERFECT = [6,12,18,20,24,28,30,36,40,42,48,54,56,60,66,72,
                   78,80,84,88,90,96,100,102,104,108,112,114,120,126,
                   132,138,140,144,150,156,160,162,168,174,176,180,
@@ -6,19 +6,45 @@ describe Integer, "#semi_perfect?" do
                   228,234,240,246,252,258,260,264]
   it "returns true if the number is semi-perfect" do
     SEMI_PERFECT.each do |number|
-      number.should be_semi_perfect
+      number.should be_semiperfect
+    end
+  end
+
+  it "returns true if the number is a multiple of a known semi-perfect" do
+    (SEMI_PERFECT.combination(2).map{|_| _.reduce(:*)}.uniq - SEMI_PERFECT).
+      shuffle.first(15).each do |number|
+      number.should be_semiperfect
+    end
+  end
+
+  # Guy, R. K. 
+  # "Almost Perfect, Quasi-Perfect, Pseudoperfect, Harmonic, Weird, Multiperfect and Hyperperfect Numbers." 
+  # §B2 in Unsolved Problems in Number Theory, 2nd ed. New York: Springer-Verlag, pp. 45-53, 1994
+  it "returns true for 2**m * p (where m >= 1 && p.prime? && (p < 2**(m+1) && p > 2**m)" do
+    [[4, 17], [4, 19], [4, 23], [4, 29], [4, 31], 
+     [5, 37], [5, 41], [5, 43], [5, 47], [5, 53], [5, 59], [5, 61],
+     [6, 67], [6, 71], [6, 73], [6, 79], [6, 83], [6, 89], [6, 97],
+     [6, 101],[6, 103],[6, 107],[6, 109],[6, 113],[6, 127]].shuffle.first(10).each do |m,p|
+      (2**m * p).should be_semiperfect
     end
   end
 
   it "returns false if the number is not semi-perfect" do
     ((1..263).to_a - SEMI_PERFECT).each do |number|
-      number.should_not be_semi_perfect
+      number.should_not be_semiperfect
     end
   end
 
   it "returns false if the number is negative" do
     (1..263).each do |number|
-      (-number).should_not be_semi_perfect
+      (-number).should_not be_semiperfect
     end
   end
+
+  it "handles large input quickly and without raising a RangeError" do
+    require 'timeout'
+    lambda do 
+      Timeout.timeout(5) { 19305.semiperfect? }
+    end.should_not raise_error
+  end
 end

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification 
 name: numb
 version: !ruby/object:Gem::Version 
-  version: 0.8.0
+  version: 0.9.0
 platform: ruby
 authors: 
 - Run Paint Run Run
@@ -77,12 +77,13 @@ files:
 - lib/numb/powerful.rb
 - lib/numb/practical.rb
 - lib/numb/prime.rb
+- lib/numb/primitive_pseudoperfect.rb
 - lib/numb/pronic.rb
 - lib/numb/ruby1.8.rb
 - lib/numb/ruby1.9.rb
 - lib/numb/self.rb
 - lib/numb/self_descriptive.rb
-- lib/numb/semi_perfect.rb
+- lib/numb/semiperfect.rb
 - lib/numb/semiprime.rb
 - lib/numb/smarandache_wellin.rb
 - lib/numb/smith.rb
@@ -136,6 +137,7 @@ files:
 - spec/polydivisible_spec.rb
 - spec/powerful_spec.rb
 - spec/practical_spec.rb
+- spec/primitive_pseudoperfect_spec.rb
 - spec/pronic_spec.rb
 - spec/self_descriptive_spec.rb
 - spec/self_spec.rb
@@ -184,6 +186,7 @@ specification_version: 3
 summary: Experiments in number theory with new predicate methods for Integer.
 test_files: 
 - spec/economical_spec.rb
+- spec/primitive_pseudoperfect_spec.rb
 - spec/polydivisible_spec.rb
 - spec/equidigital_spec.rb
 - spec/nivenmorphic_spec.rb

data/lib/numb/semi_perfect.rb

@@ -1,15 +0,0 @@
-# coding: utf-8
-class Integer
-  def semi_perfect?
-    return false if deficient?
-    return true if perfect?
-    divisors = proper_positive_divisors
-    1.upto(divisors.size-1) do |size|
-      divisors.combination(size) do |comb|
-        return true if Array(comb).reduce(:+) == self
-      end
-    end
-    false
-  end
-  alias :pseudo_perfect? :semi_perfect?
-end