numb 0.125.0 → 0.138.0

data/VERSION

@@ -1 +1 @@
-0.125.0
+0.138.0

data/lib/numb/bernoulli.rb

@@ -0,0 +1,14 @@
+# coding: utf-8
+class Integer
+  # TODO: Consider http://cims.nyu.edu/~harvey/bernmm/
+  def bernoulli
+    return -0.5.to_r if self == 1
+    return 0.to_r if odd?
+    a = []
+    0.upto(self) do |m|
+      a[m] = Rational(1, m + 1)
+      m.downto(1){|j| a[j - 1] = j * (a[j - 1] - a[j])}
+    end
+    a.first
+  end
+end

data/lib/numb/brilliant.rb

@@ -0,0 +1,7 @@
+# coding: utf-8
+class Integer
+  def brilliant?
+    pfacts = prime_factors
+    pfacts.size == 2 and pfacts.map{|f| f.to_s.size}.uniq.size == 1
+  end
+end

data/lib/numb/centered_square.rb

@@ -0,0 +1,5 @@
+class Integer
+  def centered_square?
+    centered_n_gonal? 4
+  end
+end

data/lib/numb/choose.rb

@@ -0,0 +1,8 @@
+# coding: utf-8
+class Integer
+  def choose(k)
+    k > self ? 0 : factorial / (k.factorial * (self - k).factorial)
+  end
+
+  alias :binomial_coefficient :choose
+end

data/lib/numb/e_divisors.rb

@@ -0,0 +1,10 @@
+class Integer
+  def e_divisors
+    return [1] if self == 1
+    pfacts = primaries
+    comb = pfacts.map{|p,a| (1..a).select{|b| a.divides?(b)}.map{|b| p**b}}
+    comb.flatten.permutation(pfacts.size).select do |perm|
+      perm.each_with_index.all?{|x,i| comb[i].include? x}
+    end.map{|perm| perm.reduce(:*)}
+  end
+end

data/lib/numb/e_perfect.rb

@@ -0,0 +1,7 @@
+# coding: utf-8
+class Integer
+  def e_perfect?
+    return false if odd?
+    σe == 2 * self
+  end
+end

data/lib/numb/entringer.rb

@@ -0,0 +1,9 @@
+# coding: utf-8
+class Integer
+  def entringer(k)
+    return 1 if zero? and k.zero?
+    return 0 if (self < k or k < 0)
+    entringer(k - 1) + (self - 1).entringer(self - k)
+  end
+end
+

data/lib/numb/fermat.rb

@@ -0,0 +1,6 @@
+# coding: utf-8
+class Integer
+  def fermat?
+    self > 2 and Math.log2(Math.log2(self - 1)).integer?
+  end
+end

data/lib/numb/franel.rb

@@ -0,0 +1,6 @@
+# coding: utf-8
+class Integer
+  def franel
+    (0..self).map{|k| choose(k) ** 3 }.reduce(:+)
+  end
+end

data/lib/numb/genocchi.rb

@@ -0,0 +1,8 @@
+# coding: utf-8
+class Integer
+  def genocchi
+    return 1 if self == 1
+    return 0 if odd?
+    (2 * (1 - 2**self) * bernoulli).to_i
+  end
+end

data/lib/numb/gnomonic.rb

@@ -0,0 +1,4 @@
+# coding: utf-8
+class Integer
+  alias :gnomonic? :odd?
+end

data/lib/numb/mersenne.rb

@@ -0,0 +1,7 @@
+class Integer
+  def mersenne?
+    zero? or repunit?(2)
+  end
+
+  alias :fermat_lucas? :mersenne?
+end

data/lib/numb/mersenne_prime.rb

@@ -1,5 +1,5 @@
 class Integer
   def mersenne_prime?
-    prime? and repunit?(2)
+    mersenne? and prime?
   end
 end

data/lib/numb/n_step_fibonacci.rb

@@ -0,0 +1,8 @@
+# coding: utf-8
+class Integer
+  def n_step_fibonacci(n)
+    return 0 if self <= (n - 2) 
+    return 1 if self <= (n - 1)
+    (1..n).map{|i| (self-i).n_step_fibonacci(n) }.reduce(:+)
+  end
+end

data/lib/numb/number_of_divisors.rb

@@ -5,6 +5,8 @@ class Integer
 
   # Returns the number of divisors of self
   def τ 
+    # TODO: Consider something simpler, and perhaps faster, like
+    # primaries.map(&:last).map(&:succ).reduce(:*)
     n = self
     return @nod if defined?(@nod)
     @nod = (1..isqrt).

data/lib/numb/powerful.rb

@@ -5,4 +5,6 @@ class Integer
     divisors = self.divisors
     divisors.select {|d| d.prime? }.all?{|prime| divisors.include? (prime ** 2)}
   end
+
+  alias :handsome? :powerful?
 end

data/lib/numb/pronic.rb

@@ -3,4 +3,6 @@ class Integer
     return false unless even? and (positive? or zero?)
     (Math.sqrt(succ).round - sqrt.round) == 1
   end
+
+  alias :heteromecic? :pronic?
 end

data/lib/numb/sophie_germain_prime.rb

@@ -1,5 +1,5 @@
 class Integer
   def sophie_germain_prime?
-    prime? and ((2*self) + 1).prime?
+    prime? and (2*self).succ.prime?
   end
 end

data/lib/numb/subfactorial.rb

@@ -0,0 +1,7 @@
+class Integer
+  def subfactorial
+    zero? ? 1 : self * (self - 1).subfactorial + (-1)**self
+  end
+
+  alias :derangements :subfactorial
+end

data/lib/numb/sum_of_e_divisors.rb

@@ -0,0 +1,10 @@
+# coding: utf-8
+class Integer
+  def σe
+    # TODO: If squarefree, the sum of a number’s e-divisors is the number
+    # itself. Do we gain anything significant by special-casing this?
+    e_divisors.reduce(:+)
+  end
+
+  alias :sum_of_e_divisors :σe
+end

data/spec/numb/bernoulli_spec.rb

@@ -0,0 +1,23 @@
+# coding: utf-8
+describe Integer, "#bernoulli" do
+  # A000367 
+  @numerators = [1, 1, -1, 1, -1, 5, -691, 7, -3617, 43867, -174611, 854513,
+                 -236364091, 8553103, -23749461029, 8615841276005, -7709321041217,
+                 2577687858367, -26315271553053477373, 2929993913841559,
+                 -261082718496449122051]
+  # A002445
+  @denominators = [1, 6, 30, 42, 30, 66, 2730, 6, 510, 798, 330, 138, 2730, 6,
+                   870, 14322, 510, 6, 1919190, 6, 13530, 1806, 690, 282, 46410, 
+                   66, 1590, 798, 870, 354, 56786730, 6, 510, 64722, 30, 4686, 
+                   140100870, 6, 30, 3318, 230010]
+
+  @seq = @numerators.zip(@denominators).map{|n,d| Rational(n,d)}
+  @seq = ([0.to_r] * @numerators.size).zip(@seq).flatten
+  @seq.shift 
+  @seq[1] = -Rational(1, 2)
+  @seq.each_with_index do |r, n| 
+    it "returns #{r} for #{n}" do
+      n.bernoulli.should == r
+    end
+  end
+end

data/spec/numb/brilliant_spec.rb

@@ -0,0 +1,21 @@
+# coding: utf-8
+describe Integer, "#brilliant?" do
+  # A078972
+  @seq = [4,6,9,10,14,15,21,25,35,49,121,143,169,187,209,
+          221,247,253,289,299,319,323,341,361,377,391,403,
+          407,437,451,473,481,493,517,527,529,533,551,559,
+          583,589,611,629,649,667,671,689,697,703,713,731,
+          737,767,779,781]
+
+  @seq.each do |n|
+    it "returns true for brilliant number #{n}" do
+      n.should be_brilliant
+    end
+  end
+
+  @seq.to_seq.invert.sample(100).each do |n|
+    it "returns false for non-brilliant number #{n}" do
+      n.should_not be_brilliant
+    end
+  end
+end

data/spec/numb/centered_square_spec.rb

@@ -0,0 +1,20 @@
+describe Integer, "#centered_square?" do
+  # A001844      
+  @seq = [1,5,13,25,41,61,85,113,145,181,221,265,313,365,
+          421,481,545,613,685,761,841,925,1013,1105,1201,
+          1301,1405,1513,1625,1741,1861,1985,2113,2245,2381,
+          2521,2665,2813,2965,3121,3281,3445,3613,3785,3961,
+          4141,4325]
+
+  @seq.each do |n|
+    it "should return true for centered-square number #{n}" do
+      n.should be_centered_square
+    end
+  end
+
+  @seq.to_seq.invert.sample(100).each do |n|
+    it "should return false for non-centered-square number #{n}" do
+      n.should_not be_centered_square
+    end
+  end
+end

data/spec/numb/choose_spec.rb

@@ -0,0 +1,26 @@
+# coding: utf-8
+describe Integer, "#choose" do
+  # A007318
+  @seq = [
+    [1],
+    [1,  1],
+    [1,  2,  1],
+    [1,  3,  3,   1],
+    [1,  4,  6,   4,   1],
+    [1,  5, 10,  10,   5,   1],
+    [1,  6, 15,  20,  15,   6,   1],
+    [1,  7, 21,  35,  35,  21,   7,   1],
+    [1,  8, 28,  56,  70,  56,  28,   8,   1],
+    [1,  9, 36,  84, 126, 126,  84,  36,   9,  1],
+    [1, 10, 45, 120, 210, 252, 210, 120,  45, 10,  1],
+    [1, 11, 55, 165, 330, 462, 462, 330, 165, 55, 11, 1]
+  ]
+
+  @seq.each_with_index do |row, n|
+    row.each_with_index do |coeff, k|
+      it "returns #{coeff} for Binomial(#{n}, #{k})" do
+        n.choose(k).should == coeff
+      end
+    end
+  end
+end

data/spec/numb/e_divisors_spec.rb

@@ -0,0 +1,41 @@
+describe Integer, "#e_divisors" do
+  # A051377 
+  @sums = [1,2,3,6,5,6,7,10,12,10,11,18,13,14,15,22,17,24,
+           19,30,21,22,23,30,30,26,30,42,29,30,31,34,33,34,
+           35,72,37,38,39,50,41,42,43,66,60,46,47,66,56,60,
+           51,78,53,60,55,70,57,58,59,90,61,62,84,78,65,66,
+           67,102,69,70,71]
+
+  # A049419 
+  @counts = [1,1,1,2,1,1,1,2,2,1,1,2,1,1,1,3,1,2,1,2,1,1,1,2,
+             2,1,2,2,1,1,1,2,1,1,1,4,1,1,1,2,1,1,1,2,2,1,1,3,2,
+             2,1,2,1,2,1,2,1,1,1,2,1,1,2,4,1,1,1,2,1,1,1,4,1,1,
+             2,2,1,1,1,3,3,1,1,2,1,1,1,2,1,2,1,2,1,1,1,2,1,2,2,
+             4,1,1]
+  
+  # A157488
+  @products = [1,2,3,8,5,6,7,16,27,10,11,72,13,14,15,128,17,
+               108,19,200,21,22,23,144,125,26,81,392,29,30,31,64,33,34,
+               35,46656,37,38,39,400,41,42,43,968,675,46,47,3456,343,500,
+               51,1352,53,324,55,784,57,58,59,1800,61,62,1323,4096]
+
+  @counts.to_enum.with_index(1) do |count, n|
+    e_divisors = n.e_divisors
+    
+    it "returns #{count} e divisors for #{n}" do
+      e_divisors.size.should == count
+    end
+
+    if sum = @sums[n-1]
+      it "returns e divisors with a sum of #{sum} for #{n}" do
+        e_divisors.reduce(:+).should == sum
+      end
+    end
+    
+    if product = @products[n-1]
+      it "returns e divisors with a product of #{product} for #{n}" do
+        e_divisors.reduce(:*).should == product
+      end
+    end
+  end
+end

data/spec/numb/e_perfect_spec.rb

@@ -0,0 +1,21 @@
+# coding: utf-8
+describe Integer, "#e_perfect?" do
+  # A054979
+  @seq = [36,180,252,396,468,612,684,828,1044,1116,1260,
+          1332,1476,1548,1692,1800,1908,1980,2124,2196,2340,
+          2412,2556,2628,2700,2772,2844,2988,3060,3204,3276,
+          3420,3492,3636,3708,3852,3924,4068,4140,4284,4572,
+          4716]
+  
+  @seq.each do |n|
+    it "returns true for e-perfect number #{n}" do
+      n.should be_e_perfect
+    end
+  end
+
+  @seq.to_seq.invert.sample(100).each do |n|
+    it "returns false for non-e-perfect number #{n}" do
+      n.should_not be_e_perfect
+    end
+  end
+end

data/spec/numb/entringer_spec.rb

@@ -0,0 +1,25 @@
+# coding: utf-8
+describe Integer, "#entringer" do
+  # A008281
+  @seq = [
+          [1,                                                     ],
+          [0,    1,                                               ],
+          [0,    1,    1,                                         ],
+          [0,    1,    2,    2,                                   ],
+          [0,    2,    4,    5,    5,                             ],
+          [0,    5,   10,   14,   16,   16,                       ],
+          [0,   16,   32,   46,   56,   61,   61,                 ],
+          [0,   61,  122,  178,  224,  256,  272,  272,           ],
+          [0,  272,  544,  800, 1024, 1202, 1324, 1385, 1385,     ],    
+          [0, 1385, 2770, 4094, 5296, 6320, 7120, 7664, 7936, 7936],
+        ]
+
+  @seq.each_with_index do |row, a|
+    row.each_with_index do |n, b|
+      it "returns #{n} for Entringer(#{a}, #{b})" do
+        a.entringer(b).should == n
+      end
+    end
+  end
+end
+

data/spec/numb/fermat_spec.rb

@@ -0,0 +1,20 @@
+# coding: utf-8
+describe Integer, "#fermat?" do
+  # A000215
+  @seq = [3,5,17,257,65537,4294967297,18446744073709551617,
+          340282366920938463463374607431768211457,
+          115792089237316195423570985008687907853269984665640564039457584007913129639937,
+          13407807929942597099574024998205846127479365820592393377723561443721764030073546976801874298166903427690031858186486050853753882811946569946433649006084097]
+  
+  @seq.each do |n|
+    it "returns true for Fermat number #{n}" do
+      n.should be_fermat
+    end
+  end
+
+  @seq.to_seq.invert.sample(100).each do |n|
+    it "returns false for non-Fermat number #{n}" do
+      n.should_not be_fermat
+    end
+  end
+end

data/spec/numb/franel_spec.rb

@@ -0,0 +1,15 @@
+# coding: utf-8
+describe Integer, "#franel" do
+  # A000172
+  @seq = [1,2,10,56,346,2252,15184,104960,739162,5280932,
+          38165260,278415920,2046924400,15148345760,
+          112738423360,843126957056,6332299624282,
+          47737325577620,361077477684436,2739270870994736,
+          20836827035351596]
+
+  @seq.each_with_index do |franel, n|
+    it "returns #{franel} for #{n}" do
+      n.franel.should == franel
+    end
+  end
+end

data/spec/numb/genocchi_spec.rb

@@ -0,0 +1,22 @@
+# coding utf-8
+describe Integer, "#genocchi" do
+  #A001469
+  @seq = [-1,1,-3,17,-155,2073,-38227,929569,-28820619,
+          1109652905,-51943281731,2905151042481,
+          -191329672483963,14655626154768697,
+          -1291885088448017715,129848163681107301953,
+          -14761446733784164001387]
+
+  (2..(@seq.size * 2)).select(&:even?).each do |n|
+   
+    m_genocchi = (m = n - 1) == 1 ? 1 : 0
+    it "returns #{m_genocchi} for #{m}" do
+      m.genocchi.should == m_genocchi
+    end
+
+    genocchi = @seq.shift
+    it "returns #{genocchi} for #{n}" do
+      n.genocchi.should == genocchi
+    end
+  end
+end

data/spec/numb/gnomonic_spec.rb

@@ -0,0 +1,21 @@
+# coding: utf-8
+describe Integer, "#gnomonic?" do
+  # A005408
+  @seq = [1,3,5,7,9,11,13,15,17,19,21,23,25,27,29,31,33,35,
+          37,39,41,43,45,47,49,51,53,55,57,59,61,63,65,67,
+          69,71,73,75,77,79,81,83,85,87,89,91,93,95,97,99,
+          101,103,105,107,109,111,113,115,117,119,121,123,
+          125,127,129,131]
+
+  @seq.each do |n|
+    it "returns true for gnomonic number #{n}" do
+      n.should be_gnomonic
+    end
+  end
+
+  @seq.to_seq.invert.each do |n|
+    it "returns false for non-gnomonic number #{n}" do
+      n.should_not be_gnomonic
+    end
+  end
+end

data/spec/numb/mersenne_spec.rb

@@ -0,0 +1,21 @@
+# coding: utf-8
+describe Integer, "#mersenne?" do
+  # A000225
+  @seq = [0,1,3,7,15,31,63,127,255,511,1023,2047,4095,8191,
+          16383,32767,65535,131071,262143,524287,1048575,
+          2097151,4194303,8388607,16777215,33554431,
+          67108863,134217727,268435455,536870911,1073741823,
+          2147483647,4294967295]
+
+  @seq.each do |n|
+    it "returns true for Mersenne number #{n}" do
+      n.should be_mersenne
+    end
+  end
+
+  @seq.to_seq.invert.sample(100).each do |n|
+    it "returns false for non-Mersenne number #{n}" do
+      n.should_not be_mersenne
+    end
+  end
+end

data/spec/numb/n_step_fibonacci_spec.rb

@@ -0,0 +1,48 @@
+describe Integer, "#n_step_fibonacci" do
+  @seq = {
+    # A000045
+    2 => [0,1,1,2,3,5,8,13,21,34,55,89,144,233,377,610,987,
+          1597,2584,4181,6765,10946,17711,28657,46368,75025,
+          121393,196418,317811,514229,832040,1346269,
+          2178309,3524578,5702887,9227465,14930352,24157817,
+          39088169],
+    # A000073
+    3 => [0,0,1,1,2,4,7,13,24,44,81,149,274,504,927,1705,
+          3136,5768,10609,19513,35890,66012,121415,223317,
+          410744,755476,1389537,2555757,4700770,8646064,
+          15902591,29249425,53798080,98950096,181997601,
+          334745777],
+    # A000078      
+    4 => [0,0,0,1,1,2,4,8,15,29,56,108,208,401,773,1490,
+          2872,5536,10671,20569,39648,76424,147312,283953,
+          547337,1055026,2033628,3919944,7555935,14564533,
+          28074040,54114452,104308960,201061985,387559437,
+          747044834],
+    # A001591
+    5 => [0,0,0,0,1,1,2,4,8,16,31,61,120,236,464,912,1793,
+          3525,6930,13624,26784,52656,103519,203513,400096,
+          786568,1546352,3040048,5976577,11749641,23099186,
+          45411804,89277256,175514464,345052351,678355061,
+          1333610936],
+    # A001592      
+    6 => [0,0,0,0,0,1,1,2,4,8,16,32,63,125,248,492,976,
+          1936,3840,7617,15109,29970,59448,117920,233904,
+          463968,920319,1825529,3621088,7182728,14247536,
+          28261168,56058368,111196417,220567305,437513522,
+          867844316],
+    # A122189
+    7 => [0,0,0,0,0,0,1,1,2,4,8,16,32,64,127,253,504,1004,
+          2000,3984,7936,15808,31489,62725,124946,248888,
+          495776,987568,1967200,3918592,7805695,15548665,
+          30972384,61695880,122895984,244804400,487641600,
+          971364608],
+  }
+
+  @seq.each_pair do |n, ks|
+    ks.first(10 + n).each_with_index do |x, k|
+      it "returns #{x} for the #{k}#{k.ordinal} #{n}-step Fibonacci number" do
+        k.n_step_fibonacci(n).should == x
+      end
+    end
+  end
+end

data/spec/numb/subfactorial_spec.rb

@@ -0,0 +1,14 @@
+describe Integer, "#subfactorial" do
+  # A000166
+  @seq = [1,0,1,2,9,44,265,1854,14833,133496,1334961,
+          14684570,176214841,2290792932,32071101049,
+          481066515734,7697064251745,130850092279664,
+          2355301661033953,44750731559645106,
+          895014631192902121,18795307255050944540]
+
+  @seq.each_with_index do |sf, n|
+    it "returns #{sf} for #{n}" do
+      n.subfactorial.should == sf
+    end
+  end
+end

data/spec/numb/sum_of_e_divisors_spec.rb

@@ -0,0 +1,15 @@
+# coding: utf-8
+describe Integer, "#σe" do
+  # A051377 
+  @sums = [1,2,3,6,5,6,7,10,12,10,11,18,13,14,15,22,17,24,
+           19,30,21,22,23,30,30,26,30,42,29,30,31,34,33,34,
+           35,72,37,38,39,50,41,42,43,66,60,46,47,66,56,60,
+           51,78,53,60,55,70,57,58,59,90,61,62,84,78,65,66,
+           67,102,69,70,71]
+
+  @sums.to_enum.with_index(1) do |sum, n|
+    it "returns #{sum} for #{n}" do
+      n.σe.should == sum
+    end
+  end
+end

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification 
 name: numb
 version: !ruby/object:Gem::Version 
-  version: 0.125.0
+  version: 0.138.0
 platform: ruby
 authors: 
 - Run Paint Run Run
@@ -9,7 +9,7 @@ autorequire:
 bindir: bin
 cert_chain: []
 
-date: 2010-03-15 00:00:00 +00:00
+date: 2010-03-18 00:00:00 +00:00
 default_executable: 
 dependencies: 
 - !ruby/object:Gem::Dependency 
@@ -56,11 +56,13 @@ files:
 - lib/numb/base.rb
 - lib/numb/beastly.rb
 - lib/numb/bell.rb
+- lib/numb/bernoulli.rb
 - lib/numb/betrothed.rb
 - lib/numb/binomial.rb
 - lib/numb/biquadratic.rb
 - lib/numb/blum.rb
 - lib/numb/breeder.rb
+- lib/numb/brilliant.rb
 - lib/numb/brown.rb
 - lib/numb/carmichael.rb
 - lib/numb/carol.rb
@@ -69,7 +71,9 @@ files:
 - lib/numb/centered_hexagonal.rb
 - lib/numb/centered_n_gonal.rb
 - lib/numb/centered_pentagonal.rb
+- lib/numb/centered_square.rb
 - lib/numb/centered_triangular.rb
+- lib/numb/choose.rb
 - lib/numb/composite.rb
 - lib/numb/congruum.rb
 - lib/numb/consecutive.rb
@@ -88,21 +92,28 @@ files:
 - lib/numb/dodecagonal.rb
 - lib/numb/doubly_even.rb
 - lib/numb/dudeney.rb
+- lib/numb/e_divisors.rb
+- lib/numb/e_perfect.rb
 - lib/numb/eban.rb
 - lib/numb/economical.rb
 - lib/numb/emrip.rb
+- lib/numb/entringer.rb
 - lib/numb/equidigital.rb
 - lib/numb/euclid.rb
 - lib/numb/evil.rb
 - lib/numb/extravagant.rb
 - lib/numb/factorial.rb
 - lib/numb/factorion.rb
+- lib/numb/fermat.rb
 - lib/numb/fermat_pseudoprime.rb
 - lib/numb/fibonacci.rb
+- lib/numb/franel.rb
 - lib/numb/friendly.rb
 - lib/numb/frugal.rb
 - lib/numb/full_reptend_prime.rb
+- lib/numb/genocchi.rb
 - lib/numb/giuga.rb
+- lib/numb/gnomonic.rb
 - lib/numb/goldbach.rb
 - lib/numb/hamming.rb
 - lib/numb/happy.rb
@@ -129,6 +140,7 @@ files:
 - lib/numb/lucas.rb
 - lib/numb/lucas_carmichael.rb
 - lib/numb/lychrel.rb
+- lib/numb/mersenne.rb
 - lib/numb/mersenne_prime.rb
 - lib/numb/minimal.rb
 - lib/numb/mms_pair.rb
@@ -136,6 +148,7 @@ files:
 - lib/numb/modulo_order.rb
 - lib/numb/myriagonal.rb
 - lib/numb/n_gonal.rb
+- lib/numb/n_step_fibonacci.rb
 - lib/numb/narcissistic.rb
 - lib/numb/next_prev_prime.rb
 - lib/numb/nivenmorphic.rb
@@ -192,7 +205,9 @@ files:
 - lib/numb/squared_triangular.rb
 - lib/numb/strictly_non_palindromic.rb
 - "lib/numb/st\xC3\xB8rmer.rb"
+- lib/numb/subfactorial.rb
 - lib/numb/sublime.rb
+- lib/numb/sum_of_e_divisors.rb
 - lib/numb/sum_of_squares.rb
 - lib/numb/sum_of_unitary_divisors.rb
 - lib/numb/super_poulet.rb
@@ -234,11 +249,13 @@ files:
 - spec/numb/base_spec.rb
 - spec/numb/beastly_spec.rb
 - spec/numb/bell_spec.rb
+- spec/numb/bernoulli_spec.rb
 - spec/numb/betrothed_spec.rb
 - spec/numb/binomial_spec.rb
 - spec/numb/biquadratic_spec.rb
 - spec/numb/blum_spec.rb
 - spec/numb/breeder_spec.rb
+- spec/numb/brilliant_spec.rb
 - spec/numb/brown_spec.rb
 - spec/numb/carmichael_spec.rb
 - spec/numb/carol_spec.rb
@@ -247,7 +264,9 @@ files:
 - spec/numb/centered_hexagonal_spec.rb
 - spec/numb/centered_n_gonal_spec.rb
 - spec/numb/centered_pentagonal_spec.rb
+- spec/numb/centered_square_spec.rb
 - spec/numb/centered_triangular_spec.rb
+- spec/numb/choose_spec.rb
 - spec/numb/composite_spec.rb
 - spec/numb/congruum_spec.rb
 - spec/numb/coprime_spec.rb
@@ -266,9 +285,12 @@ files:
 - spec/numb/dodecagonal_spec.rb
 - spec/numb/doubly_even_spec.rb
 - spec/numb/dudeney_spec.rb
+- spec/numb/e_divisors_spec.rb
+- spec/numb/e_perfect_spec.rb
 - spec/numb/eban_spec.rb
 - spec/numb/economical_spec.rb
 - spec/numb/emrip_spec.rb
+- spec/numb/entringer_spec.rb
 - spec/numb/equidigital_spec.rb
 - spec/numb/euclid_spec.rb
 - spec/numb/evil_spec.rb
@@ -276,11 +298,15 @@ files:
 - spec/numb/factorial_spec.rb
 - spec/numb/factorion_spec.rb
 - spec/numb/fermat_pseudoprime_spec.rb
+- spec/numb/fermat_spec.rb
 - spec/numb/fibonacci_spec.rb
+- spec/numb/franel_spec.rb
 - spec/numb/friendly_spec.rb
 - spec/numb/frugal_spec.rb
 - spec/numb/full_reptend_prime_spec.rb
+- spec/numb/genocchi_spec.rb
 - spec/numb/giuga_spec.rb
+- spec/numb/gnomonic_spec.rb
 - spec/numb/goldbach_spec.rb
 - spec/numb/hamming_spec.rb
 - spec/numb/happy_spec.rb
@@ -309,10 +335,12 @@ files:
 - spec/numb/lychrel_spec.rb
 - spec/numb/maris_mcgwire_sosa_pair_spec.rb
 - spec/numb/mersenne_prime_spec.rb
+- spec/numb/mersenne_spec.rb
 - spec/numb/minimal_spec.rb
 - spec/numb/mobius_spec.rb
 - spec/numb/modulo_order_spec.rb
 - spec/numb/myriagonal_spec.rb
+- spec/numb/n_step_fibonacci_spec.rb
 - spec/numb/narcissistic_spec.rb
 - spec/numb/nivenmorphic_spec.rb
 - spec/numb/noncototient_spec.rb
@@ -369,7 +397,9 @@ files:
 - spec/numb/squared_triangular_spec.rb
 - spec/numb/strictly_non_palindromic_spec.rb
 - "spec/numb/st\xC3\xB8rmer_spec.rb"
+- spec/numb/subfactorial_spec.rb
 - spec/numb/sublime_spec.rb
+- spec/numb/sum_of_e_divisors_spec.rb
 - spec/numb/sum_of_squares_spec.rb
 - spec/numb/sum_of_unitary_divisors_spec.rb
 - spec/numb/super_poulet_spec.rb
@@ -431,10 +461,15 @@ test_files:
 - spec/numb/base_spec.rb
 - spec/numb/proth_spec.rb
 - spec/numb/prime_signature_spec.rb
+- spec/numb/mersenne_spec.rb
 - spec/numb/unitary_divisor_spec.rb
+- spec/numb/centered_square_spec.rb
 - spec/numb/primitive_pseudoperfect_spec.rb
 - spec/numb/polydivisible_spec.rb
+- spec/numb/choose_spec.rb
+- spec/numb/n_step_fibonacci_spec.rb
 - spec/numb/strictly_non_palindromic_spec.rb
+- spec/numb/gnomonic_spec.rb
 - spec/numb/cyclic_spec.rb
 - spec/numb/iban_spec.rb
 - spec/numb/equidigital_spec.rb
@@ -472,6 +507,7 @@ test_files:
 - spec/numb/zerofree_spec.rb
 - spec/numb/eban_spec.rb
 - spec/numb/automorphic_spec.rb
+- spec/numb/fermat_spec.rb
 - spec/numb/minimal_spec.rb
 - spec/numb/jacobsthal_lucas_spec.rb
 - spec/numb/aban_spec.rb
@@ -487,6 +523,7 @@ test_files:
 - spec/numb/centered_hexagonal_spec.rb
 - spec/numb/centered_n_gonal_spec.rb
 - spec/numb/highly_abundant_spec.rb
+- spec/numb/e_perfect_spec.rb
 - spec/numb/augmented_amicable_spec.rb
 - spec/numb/rough_spec.rb
 - spec/numb/nonhypotenuse_spec.rb
@@ -500,10 +537,12 @@ test_files:
 - spec/numb/bell_spec.rb
 - spec/numb/sublime_spec.rb
 - spec/numb/refactorable_spec.rb
+- spec/numb/subfactorial_spec.rb
 - spec/numb/betrothed_spec.rb
 - spec/numb/smith_spec.rb
 - spec/numb/unusual_spec.rb
 - spec/numb/octagonal_spec.rb
+- spec/numb/entringer_spec.rb
 - spec/numb/unitary_sociable_spec.rb
 - spec/numb/full_reptend_prime_spec.rb
 - spec/numb/vampire_spec.rb
@@ -539,10 +578,12 @@ test_files:
 - spec/numb/centered_pentagonal_spec.rb
 - spec/numb/almost_perfect_spec.rb
 - spec/numb/amicable_spec.rb
+- spec/numb/brilliant_spec.rb
 - spec/numb/amenable_spec.rb
 - spec/numb/happy_spec.rb
 - spec/numb/twin_prime_spec.rb
 - spec/numb/hexagonal_spec.rb
+- spec/numb/genocchi_spec.rb
 - spec/numb/wieferich_prime_spec.rb
 - spec/numb/fibonacci_spec.rb
 - spec/numb/triangular_spec.rb
@@ -576,14 +617,18 @@ test_files:
 - spec/numb/brown_spec.rb
 - spec/numb/perrin_spec.rb
 - spec/numb/beastly_spec.rb
+- spec/numb/franel_spec.rb
 - spec/numb/super_poulet_spec.rb
+- spec/numb/sum_of_e_divisors_spec.rb
 - spec/numb/factorion_spec.rb
 - spec/numb/undulating_spec.rb
 - spec/numb/extravagant_spec.rb
 - spec/numb/lychrel_spec.rb
 - spec/numb/self_descriptive_spec.rb
 - spec/numb/decagonal_spec.rb
+- spec/numb/e_divisors_spec.rb
 - spec/numb/apocalyptic_spec.rb
+- spec/numb/bernoulli_spec.rb
 - spec/numb/kaprekar_spec.rb
 - spec/numb/isqrt_spec.rb
 - spec/numb/hilbert_spec.rb