numb 0.21.0 → 0.63.0

data/spec/maris_mcgwire_sosa_pair_spec.rb

@@ -1,20 +1,20 @@
 describe Integer, "#maris_mcgwire_sosa_pair?" do
+  # A045759
+  @seq = [7,14,43,50,61,63,67,80,84,118,122,134,137,163,
+          196,212,213,224,241,273,274,277,279,283,351,352,
+          373,375,390,398,421,457,462,474,475,489,495,510,
+          516,523,526,537,547,555,558,577,584,590,592,616,
+          638,644,660,673,687,691]
 
-  MMS = [7,14,43,50,61,63,67,80,84,118,122,134,137,163,
-         196,212,213,224,241,273,274,277,279,283,351,352,
-         373,375,390,398,421,457,462,474,475,489,495,510,
-         516,523,526,537,547,555,558,577,584,590,592,616,
-         638,644,660,673,687,691]
-
-  it "returns true for Maris-McGwire-Sosa pairs" do
-    MMS.each do |number|
-      number.maris_mcgwire_sosa_pair?(number+1).should be_true
+  @seq.each do |n|
+    it "returns true for Maris-McGwire-Sosa pair #{n}, #{n+1}" do
+      n.maris_mcgwire_sosa_pair?(n+1).should be_true
     end
   end
 
-  it "returns false for non-Maris-McGwire-Sosa pairs" do
-    ((1..200).to_a - MMS).each do |number|
-      number.maris_mcgwire_sosa_pair?(number+1).should be_false
+  @seq.map{|e| [e, e+1]}.flatten.to_seq.invert.sample(10).each do |n|
+    it "returns true for non-Maris-McGwire-Sosa pair #{n}, #{n+1}" do
+      n.maris_mcgwire_sosa_pair?(n+1).should be_false
     end
   end
 end

data/spec/mersenne_prime_spec.rb

@@ -0,0 +1,26 @@
+describe Integer, "#mersenne_prime?" do
+  # A000668
+  @seq = [3,7,31,127,8191,131071,524287,2147483647,
+          2305843009213693951,618970019642690137449562111,
+          162259276829213363391578010288127,
+          170141183460469231731687303715884105727].to_seq
+
+  @seq.first(6).each do |n|
+    it "should return true for Mersenne prime #{n}" do
+      n.should be_mersenne_prime
+    end
+  end
+
+  @seq.invert.first(500).sample(10).each do |n|
+    it "should return false for non-Mersenne prime #{n}" do
+      n.should_not be_mersenne_prime
+    end
+  end
+
+  (Prime.first(12).to_a - @seq.to_a).each do |n|
+    it "should return false for a prime which isn't Mersenne: #{n}" do
+      n.should_not be_mersenne_prime
+    end
+  end
+end
+

data/spec/minimal_spec.rb

@@ -0,0 +1,19 @@
+describe Integer, "#minimal?" do
+  # A007416
+  @seq = [1,2,4,6,12,16,24,36,48,60,64,120,144,180,192,240,
+          360,576,720,840,900,960,1024,1260,1296,1680,2520,
+          2880,3072,3600,4096,5040,5184,6300,6480,6720,7560,
+          9216,10080].to_seq
+
+  @seq.first(20).sample(10).each do |n|
+    it "should return true for minimal number #{n}" do
+      n.should be_minimal
+    end
+  end
+
+  @seq.invert.sample(10).each do |n|
+    it "should return false for non-minimal number #{n}" do
+      n.should_not be_minimal
+    end
+  end
+end

data/spec/mobius_spec.rb

@@ -1,52 +1,37 @@
 # coding: utf-8
 describe Integer, "#mobius" do
-  # http://www.research.att.com/~njas/sequences/A008683
-  MOBIUS = [1,-1,-1,0,-1,1,-1,0,0,1,-1,0,-1,1,1,0,-1,0,-1,0,
-            1,1,-1,0,0,1,0,0,-1,-1,-1,0,1,1,1,0,-1,1,1,0,-1,
-            -1,-1,0,0,1,-1,0,0,0,1,0,-1,0,1,0,1,1,-1,0,-1,1,0,
-            0,1,-1,-1,0,1,-1,-1,0,-1,1,0,0,1]
+  # A008683
+  @seq = [1,-1,-1,0,-1,1,-1,0,0,1,-1,0,-1,1,1,0,-1,0,-1,0,
+          1,1,-1,0,0,1,0,0,-1,-1,-1,0,1,1,1,0,-1,1,1,0,-1,
+          -1,-1,0,0,1,-1,0,0,0,1,0,-1,0,1,0,1,1,-1,0,-1,1,0,
+          0,1,-1,-1,0,1,-1,-1,0,-1,1,0,0,1].to_seq
 
-  it "returns 1 if n is a square-free positive integer with an even number of distinct prime factors" do
-    MOBIUS.each_with_index do |value, idx|
-      next unless value == 1
-      (idx + 1).mobius.should == 1
+  @seq.each_with_index do |i, n|
+    it "should return #{i} for #{n}" do
+      n.succ.mobius.should == i
     end
-  end
 
-  it "returns −1 if n is a square-free positive integer with an odd number of distinct prime factors" do
-    MOBIUS.each_with_index do |value, idx|
-      next unless value == -1
-      (idx + 1).mobius.should == -1
+    it "should return nil for negative number #{-n}" do
+      (-n.succ).mobius.should be_nil
     end
   end
 
   it "returns −1 if n is prime" do
-    Prime.each(200).each do |prime|
-      next if MOBIUS.size < prime
-      prime.mobius.should == -1
+    Prime.first(10).each do |n|
+      n.mobius.should == -1
     end
   end
 
-  it "returns 0 iff n is not square-free." do
-    MOBIUS.each_with_index do |value, idx|
-      next unless value == 0
-      (idx + 1).mobius.should == 0
-    end
-
-    # http://www.research.att.com/~njas/sequences/A013929
-    [4,8,9,12,16,18,20,24,25,27,28,32,36,40,44,45,48,
-     49,50,52,54,56,60,63,64,68,72,75,76,80,81,84,88,
-     90,92,96,98,99,100,104,108,112,116,117,120,121,
-     124,125,126,128,132,135,136,140,144,147,148,150,
-     152,153,156,160].each do |number|
-      next if MOBIUS.size < number
-      number.mobius.should == 0
+  
+  # A013929
+  @seq = [4,8,9,12,16,18,20,24,25,27,28,32,36,40,44,45,48,
+          49,50,52,54,56,60,63,64,68,72,75,76,80,81,84,88,
+          90,92,96,98,99,100,104,108,112,116,117,120,121,
+          124,125,126,128,132,135,136,140,144,147,148,150,
+          152,153,156,160]
+  @seq.sample(10).each do |n|
+    it "should return 0 for non-square-free number #{n}" do
+      n.mobius.should == 0
      end
   end
-
-  it "returns nil if n is not a positive integer" do
-    (0..25).each do |number|
-      (-number).mobius.should be_nil
-    end
-  end
 end

data/spec/myriagonal_spec.rb

@@ -1,15 +1,17 @@
 describe Integer, "#myriagonal?" do
 
-  MYRIAGONAL = [0, 1, 10000, 29997, 59992, 99985, 149976, 209965, 279952, 
-                359937, 449920, 549901, 659880, 779857, 909832, 1049805, 
-                1199776, 1359745, 1529712, 1709677, 1899640, 2099601]
+  @spec = [0, 1, 10000, 29997, 59992, 99985, 149976, 209965, 279952, 
+           359937, 449920, 549901, 659880, 779857, 909832, 1049805, 
+           1199776, 1359745, 1529712, 1709677, 1899640, 2099601].to_seq
 
-  it "should return true for myriagonal numbers" do
-    MYRIAGONAL.shuffle.first(2).each{|n| n.should be_myriagonal}
+  @spec.each do |n|
+    it "should return true for myriagonal number #{n}" do
+      n.should be_myriagonal
+    end
   end
 
-  it "should return false for non-myriagonal numbers" do
-    ((0..MYRIAGONAL.last).to_a - MYRIAGONAL).shuffle.first(2).each do |n| 
+  @spec.invert.sample(10).each do |n|
+    it "should return false for non-myriagonal number #{n}" do
       n.should_not be_myriagonal
     end
   end

data/spec/narcissistic_spec.rb

@@ -1,18 +1,20 @@
 describe Integer, "#narcissistic?" do
-  NARCISSISTIC = [1,2,3,4,5,6,7,8,9,153,370,371,407,1634,8208,9474,
-                  54748,92727,93084,548834,1741725,4210818,9800817,
-                  9926315,24678050,24678051,88593477,146511208,
-                  472335975,534494836,912985153,4679307774,
-                  32164049650,32164049651]
-  it "returns true for narcissistic numbers" do
-    NARCISSISTIC.each do |number|
-      number.should be_narcissistic
+  # A005188
+  @seq =[1,2,3,4,5,6,7,8,9,153,370,371,407,1634,8208,9474,
+         54748,92727,93084,548834,1741725,4210818,9800817,
+         9926315,24678050,24678051,88593477,146511208,
+         472335975,534494836,912985153,4679307774,
+         32164049650,32164049651].to_seq
+
+  @seq.sample(10).each do |n|
+    it "returns true for narcissistic number #{n}" do
+      n.should be_narcissistic
     end
   end
 
-  it "returns false for non-narcissistic numbers" do
-    [10,30,100,178762628].each do |number|
-      number.should_not be_narcissistic
+  @seq.invert.sample(10).each do |n|
+    it "returns false for non-narcissistic number #{n}" do
+      n.should_not be_narcissistic
     end
   end
 end

data/spec/nivenmorphic_spec.rb

@@ -1,24 +1,30 @@
 describe Integer, "#nivenmorphic?" do
-  NIVENMORPHIC = [1,2,3,4,5,6,7,8,9,910,0,912,11713,6314,915,3616,
-                  15317,918,17119,9920,18921,9922,82823,19824,9925,
-                  46826,18927,18928,78329,99930,585931,388832,
-                  1098933,198934,289835,99936,99937,478838,198939,
-                  1999840]
-  it "returns true for Nivenmorphic numbers" do
-    NIVENMORPHIC.each do |number|
-      number.should be_nivenmorphic
+  # A075154
+  @seq = [1,2,3,4,5,6,7,8,9,910,0,912,11713,6314,915,3616,
+          15317,918,17119,9920,18921,9922,82823,19824,9925,
+          46826,18927,18928,78329,99930,585931,388832,
+          1098933,198934,289835,99936,99937,478838,198939,
+          1999840].to_seq
+
+  @seq.sample(10).each do |n|
+    it "returns true for Nivenmorphic number #{n}" do
+      n.should be_nivenmorphic
     end
-  end
 
-  it "returns false for non-Nivenmorphic numbers" do
-    ((1..300).to_a - NIVENMORPHIC).each do |number|
-      number.should_not be_nivenmorphic
+    next if n.zero?
+    it "returns false for negative Nivenmorphic number #{-n}" do
+      (-n).should_not be_nivenmorphic
     end
   end
 
-  it "returns false for negative numbers" do
-    (1..300).each do |number|
-      (-number).should_not be_nivenmorphic
+  @seq.invert.sample(10).each do |n|
+    next if n.zero?
+    it "returns false for non-Nivenmorphic number #{n}" do
+      n.should_not be_nivenmorphic
+    end
+
+    it "returns false for negative non-Nivenmorphic number #{-n}" do
+      (-n).should_not be_nivenmorphic
     end
   end
 end

data/spec/noncototient_spec.rb

@@ -0,0 +1,19 @@
+describe Integer, "#noncototient?" do
+  # A005278
+  @seq = [10,26,34,50,52,58,86,100,116,122,130,134,146,154,
+          170,172,186,202,206,218,222,232,244,260,266,268,
+          274,290,292,298,310,326,340,344,346,362,366,372,
+          386,394,404,412,436,466,470,474,482,490,518,520].to_seq
+
+  @seq.sample(10).each do |n|
+    it "should return true for noncototient number #{n}" do
+      n.should be_noncototient
+    end
+  end
+
+  @seq.invert.sample(10).each do |n|
+    it "should return false for cototient number #{n}" do
+      n.should_not be_noncototient
+    end
+  end
+end

data/spec/nth_prime_spec.rb

@@ -0,0 +1,8 @@
+describe Integer, "#nth_prime" do
+  Prime.first(20).each_with_index do |prime, n|
+    n = n.succ
+    it "should return #{prime} as the #{n}#{n.ordinal} prime" do
+      n.nth_prime.should == prime
+    end
+  end
+end

data/spec/number_of_distinct_prime_factors_spec.rb

@@ -1,28 +1,32 @@
 # coding: utf-8
 describe Integer, "#number_of_distinct_prime_factors" do
-  # http://www.research.att.com/~njas/sequences/A001221
-  OMEGA = [0,1,1,1,1,2,1,1,1,2,1,2,1,2,2,1,1,2,1,2,2,2,1,2,
-           1,2,1,2,1,3,1,1,2,2,2,2,1,2,2,2,1,3,1,2,2,2,1,2,1,
-           2,2,2,1,2,2,2,2,2,1,3,1,2,2,1,2,3,1,2,2,3,1,2,1,2,
-           2,2,2,3,1,2,1,2,1,3,2,2,2,2,1,3,2,2,2,2,2,2,1,2,2,
-           2,1,3,1,2,3,2,1,2,1,3,2]
+  # A001221
+  @seq = [0,1,1,1,1,2,1,1,1,2,1,2,1,2,2,1,1,2,1,2,2,2,1,2,
+          1,2,1,2,1,3,1,1,2,2,2,2,1,2,2,2,1,3,1,2,2,2,1,2,1,
+          2,2,2,1,2,2,2,2,2,1,3,1,2,2,1,2,3,1,2,2,3,1,2,1,2,
+          2,2,2,3,1,2,1,2,1,3,2,2,2,2,1,3,2,2,2,2,2,2,1,2,2,
+          2,1,3,1,2,3,2,1,2,1,3,2].to_seq
 
-  it "returns the number of distinct prime factors of self" do
-    OMEGA.each_with_index do |omega, number|
-      (number + 1).number_of_distinct_prime_factors.should == omega
+  @seq.each_with_index do |omega, n|
+    it "should return #{omega} for #{n}" do
+      n.succ.number_of_distinct_prime_factors.should == omega
     end
+  end
 
-    # http://www.research.att.com/~njas/sequences/A046386
-    [210,330,390,462,510,546,570,690,714,770,798,858,
-     870,910,930,966,1110,1122,1155,1190,1218,1230,
-     1254,1290,1302,1326,1330,1365,1410,1430,1482,1518,
-     1554,1590,1610,1722,1770,1785,1794,1806,1830,1870,
-     1914,1938,1974].each do |number|
-      number.number_of_distinct_prime_factors.should == 4
+  # A046386
+  @seq = [210,330,390,462,510,546,570,690,714,770,798,858,
+          870,910,930,966,1110,1122,1155,1190,1218,1230,
+          1254,1290,1302,1326,1330,1365,1410,1430,1482,1518,
+          1554,1590,1610,1722,1770,1785,1794,1806,1830,1870,
+          1914,1938,1974].to_seq
+  
+  @seq.each do |n|
+    it "should return 4 for #{n}" do
+      n.number_of_distinct_prime_factors.should == 4
      end
   end
 
-  it "does not count any factor more than once" do
+  it "should not count factors with multiplicity" do
     [4, 8, 9, 12, 16, 18, 20, 24, 25, 27, 28, 32, 36, 40, 44, 45, 48, 49, 
      50, 52, 54, 56, 60, 63, 64, 68, 72, 75, 76, 80, 81, 84, 88, 90, 92, 
      96, 98, 99, 100, 104, 108, 112, 116, 117, 120, 121, 124, 125, 126, 128,

data/spec/number_of_prime_factors_spec.rb

@@ -1,25 +1,19 @@
 # coding: utf-8
 describe Integer, "#number_of_prime_factors" do
-  # http://www.research.att.com/~njas/sequences/A001222
-  BIGOMEGA = [0,1,1,2,1,2,1,3,2,2,1,3,1,2,2,4,1,3,1,3,2,2,1,4,
-              2,2,3,3,1,3,1,5,2,2,2,4,1,2,2,4,1,3,1,3,3,2,1,5,2,
-              3,2,3,1,4,2,4,2,2,1,4,1,2,3,6,2,3,1,3,2,3,1,5,1,2,
-              3,3,2,3,1,5,4,2,1,4,2,2,2,4,1,4,2,3,2,2,2,6,1,3,3,
-              4,1,3,1,4,3,2,1,5,1,3,2]
+  # A001222
+  @seq = [0,1,1,2,1,2,1,3,2,2,1,3,1,2,2,4,1,3,1,3,2,2,1,4,
+          2,2,3,3,1,3,1,5,2,2,2,4,1,2,2,4,1,3,1,3,3,2,1,5,2,
+          3,2,3,1,4,2,4,2,2,1,4,1,2,3,6,2,3,1,3,2,3,1,5,1,2,
+          3,3,2,3,1,5,4,2,1,4,2,2,2,4,1,4,2,3,2,2,2,6,1,3,3,
+          4,1,3,1,4,3,2,1,5,1,3,2].to_seq
 
-  it "returns the number of prime factors (counted with multiplicity) of self" do
-    BIGOMEGA.each_with_index do |bigomega, number|
-      (number + 1).number_of_prime_factors.should == bigomega
+  @seq.each_with_index do |bigomega, n|
+    it "should return #{bigomega} for #{n.succ}" do
+      n.succ.number_of_prime_factors.should == bigomega
     end
   end
 
-  it "is >= ω" do
-    BIGOMEGA.each_with_index do |bigomega, number|
-      (number + 1).number_of_prime_factors.should >= (number + 1).number_of_distinct_prime_factors
-    end
-  end
-
-  it "counts factors more than once" do
+  it "should count factors with multiplicity" do
     [4, 8, 9, 12, 16, 18, 20, 24, 25, 27, 28, 32, 36, 40, 44, 45, 48, 49, 
      50, 52, 54, 56, 60, 63, 64, 68, 72, 75, 76, 80, 81, 84, 88, 90, 92, 
      96, 98, 99, 100, 104, 108, 112, 116, 117, 120, 121, 124, 125, 126, 128,

data/spec/ore_spec.rb

@@ -0,0 +1,21 @@
+describe Integer, "#ore?" do
+  # A001599
+  ORE = [1,6,28,140,270,496,672,1638,2970,6200,8128,8190,
+         18600,18620,27846,30240,32760,55860,105664,117800,
+         167400,173600,237510,242060,332640,360360,539400,
+         695520,726180,753480,950976,1089270,1421280,
+         1539720]
+
+  ORE.each do |n|
+    it "returns true for Ore number #{n}" do
+      n.should be_ore
+    end
+  end
+
+  (1..1_000).each do |n|
+    next if ORE.include? n
+    it "returns false for non-Ore number #{n}" do
+      n.should_not be_ore
+    end
+  end
+end

data/spec/perfect_spec.rb

@@ -43,41 +43,41 @@ describe Integer, "#perfect?" do
   end
 end
 
-describe Integer, "#proper_positive_divisors" do
+describe Integer, "#proper_divisors" do
   it "returns an Array" do
-    6.proper_positive_divisors.should be_an_instance_of(Array)
+    6.proper_divisors.should be_an_instance_of(Array)
   end
 
   it "returns integers that divide into self with no remainder" do
-    6.proper_positive_divisors.should include(2, 3)
+    6.proper_divisors.should include(2, 3)
   end
 
   it "doesn't return integers that divide into self with a remainder" do
-    6.proper_positive_divisors.should_not include(4, 5)
+    6.proper_divisors.should_not include(4, 5)
   end
 
   it "doesn't return itself as a divisor" do
-    9.proper_positive_divisors.should_not include(9)
+    9.proper_divisors.should_not include(9)
   end
 
   it "returns all of the proper divisors of self" do
-    33.proper_positive_divisors.sort.should == [1, 3, 11]
+    33.proper_divisors.sort.should == [1, 3, 11]
   end
 
   it "returns [] for 1" do
-    1.proper_positive_divisors.should == []
+    1.proper_divisors.should == []
   end
 
   it "returns [] for 0" do
-    0.proper_positive_divisors.should == []
+    0.proper_divisors.should == []
   end
 
   it "returns [] for -1" do
-    -1.proper_positive_divisors.should == []
+    -1.proper_divisors.should == []
   end
 
   it "returns [] when self is negative" do
-    -32.proper_positive_divisors.should == []
+    -32.proper_divisors.should == []
   end
 end
 

data/spec/poulet_spec.rb

@@ -0,0 +1,20 @@
+describe Integer, "#poulet?" do
+  # A001567
+  @seq = [341,561,645,1105,1387,1729,1905,2047,2465,2701,
+          2821,3277,4033,4369,4371,4681,5461,6601,7957,8321,
+          8481,8911,10261,10585,11305,12801,13741,13747,
+          13981,14491,15709,15841,16705,18705,18721,19951,
+          23001,23377,25761,29341].to_seq
+
+  @seq.each do |n|
+    it "should return true for Poulet number #{n}" do
+      n.should be_poulet
+    end
+  end
+
+  @seq.invert.sample(10).each do |n|
+    it "should false true for non-Poulet number #{n}" do
+      n.should_not be_poulet
+    end
+  end
+end

data/spec/prime_count_spec.rb

@@ -0,0 +1,13 @@
+describe Integer, "#prime_count" do
+ # A000720
+ PRIME_COUNT = [0,1,2,2,3,3,4,4,4,4,5,5,6,6,6,6,7,7,8,8,8,8,9,9,
+                9,9,9,9,10,10,11,11,11,11,11,11,12,12,12,12,13,13,
+                14,14,14,14,15,15,15,15,15,15,16,16,16,16,16,16,
+                17,17,18,18,18,18,18,18,19,19,19,19,20,20,21,21,
+                21,21,21,21]
+ PRIME_COUNT.each_with_index do |count, n|
+   it "should return #{count} for #{n.succ}" do
+     n.succ.prime_count.should == count
+   end
+ end
+end

data/spec/prime_signature_spec.rb

@@ -0,0 +1,70 @@
+describe Integer, "#prime_signature" do
+  SIGNATURES = {
+    # A000040
+    [1]     =>  [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,107,109,113,127,
+                 131,137,139,149,151,157,163,167,173,179,181,191,
+                 193,197,199,211,223,227,229,233,239,241,251,257,
+                 263,269,271],
+    # A001248
+    [2]     =>  [4,9,25,49,121,169,289,361,529,841,961,1369,1681,
+                 1849,2209,2809,3481,3721,4489,5041,5329,6241,6889,
+                 7921,9409,10201,10609,11449,11881,12769,16129,
+                 17161,18769,19321,22201],
+    # A006881        
+    [1,1]   =>  [6,10,14,15,21,22,26,33,34,35,38,39,46,51,55,57,
+                 58,62,65,69,74,77,82,85,86,87,91,93,94,95,106,111,
+                 115,118,119,122,123,129,133,134,141,142,143,145,
+                 146,155,158,159,161,166,177,178,183,185,187,194,
+                 201,202,203,205],
+    # A030078
+    [3]     =>  [8,27,125,343,1331,2197,4913,6859,12167,24389,
+                 29791,50653,68921,79507,103823,148877,205379,
+                 226981,300763,357911,389017,493039,571787,704969,
+                 912673,1030301,1092727,1225043,1295029,1442897],
+    # A054753
+    [2,1]   =>  [12,18,20,28,44,45,50,52,63,68,75,76,92,98,99,116,
+                 117,124,147,148,153,164,171,172,175,188,207,212,
+                 236,242,244,245,261,268,275,279,284,292,316,325,
+                 332,333,338,356,363,369,387,388,404,412,423,425,
+                 428,436,452],
+    # A030514
+    [4]     =>  [16,81,625,2401,14641,28561,83521,130321,279841,
+                 707281,923521,1874161,2825761,3418801,4879681,
+                 7890481,12117361,13845841,20151121,25411681,
+                 28398241,38950081,47458321,62742241,88529281,
+                 104060401],
+    # A065036
+    [3,1]   =>  [24,40,54,56,88,104,135,136,152,184,189,232,248,
+                  250,296,297,328,344,351,375,376,424,459,472,488,
+                  513,536,568,584,621,632,664,686,712,776,783,808,
+                  824,837,856,872,875,904,999,1016,1029,1048,1096,
+                  1107,1112],
+    # A007304
+    [1,1,1] =>  [30,42,66,70,78,102,105,110,114,130,138,154,165,
+                 170,174,182,186,190,195,222,230,231,238,246,255,
+                 258,266,273,282,285,286,290,310,318,322,345,354,
+                 357,366,370,374,385,399,402,406,410,418,426,429,
+                 430,434,435,438],
+    # A050997
+    [5]     =>  [32,243,3125,16807,161051,371293,1419857,2476099,
+                 6436343,20511149,28629151,69343957,115856201,
+                 147008443,229345007,418195493,714924299,844596301,
+                 1350125107,1804229351,2073071593,3077056399,
+                 3939040643],
+    # A085986
+    [2,2]   =>  [36,100,196,225,441,484,676,1089,1156,1225,1444,
+                 1521,2116,2601,3025,3249,3364,3844,4225,4761,5476,
+                 5929,6724,7225,7396,7569,8281,8649,8836,9025,
+                 11236,12321,13225,13924,14161,14884,15129,16641,
+                 17689,17956,19881]
+  }
+
+  SIGNATURES.each do |sig, members|
+    members.each do |n|
+      it "should return #{sig} for #{n}" do
+        n.prime_signature.should == sig
+      end
+    end
+  end
+end

data/spec/primorial_spec.rb

@@ -0,0 +1,30 @@
+# A034386 
+PRIMORIAL = [1,2,6,6,30,30,210,210,210,210,2310,2310,30030,
+             30030,30030,30030,510510,510510,9699690,9699690,
+             9699690,9699690,223092870,223092870,223092870,
+             223092870,223092870,223092870,6469693230,
+             6469693230]
+
+describe Integer, "#primorial" do
+
+  PRIMORIAL.each_with_index do |n,i|
+    i = i.succ
+    it "should return #{n} for #{i}" do
+      i.primorial.should  == n
+    end
+  end
+end
+
+describe Integer, "#primorial?" do
+  PRIMORIAL.uniq.each do |n|
+    it "should return true for primorial number #{n}" do
+      n.should be_primorial
+    end
+  end
+
+  ((1..PRIMORIAL.last).first(20) - PRIMORIAL).uniq.each do |n|
+    it "should return false for non-primorial number #{n}" do
+      n.should_not be_primorial
+    end
+  end
+end

data/spec/proth_spec.rb

@@ -0,0 +1,21 @@
+describe Integer, "#proth?" do
+  # A080075
+  PROTH = [3,5,9,13,17,25,33,41,49,57,65,81,97,113,129,145,
+           161,177,193,209,225,241,257,289,321,353,385,417,
+           449,481,513,545,577,609,641,673,705,737,769,801,
+           833,865,897,929,961,993,1025,1089,1153,1217,1281,
+           1345,1409]
+
+  PROTH.each do |n|
+    it "should return true for Proth number #{n}" do
+      n.should be_proth
+    end
+  end
+
+  (1..PROTH.last).each do |n|
+    next if PROTH.include? n
+    it "should return false for non-Proth number #{n}" do
+      n.should_not be_proth
+    end
+  end
+end

data/spec/refactorable_spec.rb

@@ -0,0 +1,20 @@
+describe Integer, "#refactorable?" do
+  # A033950
+  REFACTORABLE = [1,2,8,9,12,18,24,36,40,56,60,72,80,84,88,96,104,
+                  108,128,132,136,152,156,180,184,204,225,228,232,
+                  240,248,252,276,288,296,328,344,348,360,372,376,
+                  384,396,424,441,444,448,450,468,472,480,488,492,
+                  504,516,536]
+
+  (1..REFACTORABLE.last).each do |n|
+    if REFACTORABLE.include?(n)
+      it "should return true for refactorable number #{n}" do
+        n.should be_refactorable
+      end
+    else
+      it "should return false for non-refactorable number #{n}" do
+        n.should_not be_refactorable
+      end
+    end
+  end
+end