numb 0.170.0 → 0.181.0

data/VERSION

@@ -1 +1 @@
-0.170.0
+0.181.0

data/lib/numb/divisors/abundant.rb

@@ -55,4 +55,3 @@ class Integer
   end
   memoize :superabundant?
 end
-

data/lib/numb/divisors.rb

@@ -102,7 +102,7 @@ class Integer
   #     81.extravagant?   #=> false
   #
   def extravagant?
-    digits.size < prime_division.flatten.reject{|d|d==1}.join.to_i.digits.size
+    digits.size < primaries.flatten.reject{|d|d==1}.join.to_i.digits.size
   end
 
   alias :wasteful? :extravagant?
@@ -132,10 +132,13 @@ class Integer
   end
   memoize :divisors
 
-  def sum_of_divisors
-    @sod ||= divisors.reduce(:+)
+  def sum_of_divisors(k=1)
+    (k == 1 ? divisors : divisors.map{|d| d**k}).reduce(:+)
   end
+  
   alias :σ :sum_of_divisors
+  
+  memoize :σ
 
   def aliquot_sum
     return 0 if zero?
@@ -149,7 +152,7 @@ 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(:+)
+    e_divisors.reduce :+
   end
 
   alias :sum_of_e_divisors :σe
@@ -204,7 +207,7 @@ class Integer
   #     1287.equidigital?  #=> false
   #
   def equidigital?
-    digits.size == prime_division.flatten.reject{|d|d==1}.join.to_i.digits.size
+    digits.size == primaries.flatten.reject{|d|d==1}.join.to_i.digits.size
   end
 
   def giuga?
@@ -240,7 +243,7 @@ class Integer
 
   def ore?
     div = divisors
-    Rational(div.size, div.map{|d| Rational(1, d)}.reduce(:+)).denominator == 1
+    Rational(div.size, div.map{|d| d.reciprocal}.reduce(:+)).denominator == 1
   end
 
   alias :harmonic_divisor? :ore?
@@ -276,7 +279,7 @@ class Integer
 
   def smith?
     return false if prime?
-    digital_sum == prime_division.map{|d,e| d.digital_sum * e}.reduce(:+)
+    digital_sum == primaries.map{|d,e| d.digital_sum * e}.reduce(:+)
   end
 
   def smooth?(b)
@@ -345,8 +348,6 @@ class Integer
         neighbour = ->(e) { (self/e).divisors.reject{|d| d > e} }
         x, div, exponents = self, divisors, {}
 
-        # TODO: Consider using limit's primaries as an upper limit on the
-        # exponents
         Prime.each do |b| 
           max_exponent = Math.log(limit, b).floor
           d = div.reject{|d| d > max_exponent}.sort.reverse - [1]
@@ -386,4 +387,39 @@ class Integer
   def square_part
     divisors.sort.reverse.each{|d| return d if d.square?}
   end
+
+  def ruler
+    (2 * self).primaries.first.last
+  end
+
+  def smarandache
+    if    self == 1                       then 1
+    elsif prime?                          then self
+    elsif factorial?                      then factorial_of?
+    elsif primaries.map(&:last).uniq == 1 then primaries.last.first
+    elsif primaries.size == 1
+      p, k = primaries.first
+      return p*k if k < p
+      i = k/p
+      loop do
+        sum = i
+        r = i / p
+        while r > 0
+          sum += r
+          r /= p
+        end
+        return i*p if sum >= k
+        i += 1
+      end
+    else
+      primaries.map{|b,e| (b**e).smarandache}.max
+    end
+  end
+
+  def ramanujan_tau
+    return 1 if (n = self) == 1
+    n**4 * n.σ - 24 * (1...n).map do |k|
+      k**2 * (35 * k**2 - 52 * k * n + 18 * n**2) * k.σ * (n-k).σ
+    end.reduce(:+)
+  end
 end

data/lib/numb/factorial.rb

@@ -14,4 +14,16 @@ class Integer
       end
     end
   end
+
+  def factorial_of?
+    return false unless factorial?
+    return 1 if self == 1
+    pfacts = primaries
+    divisors.sort.take_while.with_index{|d,i| d == i.succ}.reverse_each do |d|
+      pfacts.all? do |b, e|
+        (1..Math.log(d,b)).map{|k| Rational(d, b**k).floor}.reduce(:+) == e
+      end and return d
+    end
+    nil
+  end
 end

data/lib/numb/figurate.rb

@@ -90,7 +90,7 @@ class Integer
 
   def pyramidal(r)
     n = self
-    (Rational(1, 6) * n * n.succ * (((r - 2) * n) + (5 - r))).to_i
+    (6.reciprocal * n * n.succ * (((r - 2) * n) + (5 - r))).to_i
   end
 
   def octahedral

data/lib/numb/mobius.rb

@@ -2,9 +2,16 @@
 class Integer
   def mobius
    return if self < 1
-   ω < Ω  ? 0 : (-1)**(Ω)
+   ω < Ω  ? 0 : liouville
   end
 
   alias :möbius :mobius
   alias :μ :mobius
+
+  # TODO: Consider Deléglise and Rivat's "Computing the Summation of the
+  # Mőbius Function", Experimental Mathematics, Vol. 5 (1996), No. 4
+
+  def mertens
+    (1..self).map(&:μ).reduce(:+)
+  end
 end

data/lib/numb/primes.rb

@@ -151,6 +151,11 @@ class Integer
   end
   alias :bigomega :number_of_prime_factors
   alias :Ω :number_of_prime_factors
+  alias :roundness :number_of_prime_factors
+
+  def liouville
+    (-1)**Ω
+  end
 
   def prime_factors
     return [] if zero?
@@ -161,4 +166,12 @@ class Integer
     return false unless prime?
     (2**(self - 1)).modulo(self ** 2) == 1
   end
+
+  def chen_prime?
+    prime? and (succ.succ.prime? or succ.succ.semiprime?)
+  end
+
+  def mangoldt
+    prime? ? Math.log(prime_factors.first) : 0
+  end
 end

data/lib/numb/reciprocity.rb

@@ -0,0 +1,19 @@
+# coding: utf-8
+class Integer
+  def quadratic_residue?(p)
+    residue? p, 2
+  end
+
+  def cubic_residue?(p)
+    coprime?(p) and residue? p, 3
+  end
+
+  def reciprocal
+    self ** -1
+  end
+
+  private
+  def residue?(p, e=1)
+    (1...p).any?{|x| (x**e).modulo(p) == self}
+  end
+end

data/lib/numb/totient.rb

@@ -3,7 +3,7 @@ class Integer
   def φ
     return 1 if self == 1
     return self - 1 if prime?
-    (prime_factors.uniq.map{|f| 1 - Rational(1, f)}.reduce(:*) * self).to_i
+    (prime_factors.uniq.map{|f| 1 - f.reciprocal}.reduce(:*) * self).to_i
   end
 
   alias :totient :φ

data/spec/numb/bernoulli_spec.rb

@@ -14,7 +14,7 @@ describe Integer, "#bernoulli" do
   @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[1] = -2.reciprocal
   @seq.each_with_index do |r, n| 
     it "returns #{r} for #{n}" do
       n.bernoulli.should == r

data/spec/numb/chen_prime_spec.rb

@@ -0,0 +1,21 @@
+# coding: utf-8
+describe Integer, "#chen_prime?" do
+  # A109611
+  @seq = [2,3,5,7,11,13,17,19,23,29,31,37,41,47,53,59,67,
+          71,83,89,101,107,109,113,127,131,137,139,149,157,
+          167,179,181,191,197,199,211,227,233,239,251,257,
+          263,269,281,293,307,311,317,337,347,353,359,379,
+          389,401,409]
+
+  @seq.each do |n|
+    it "returns true for Chen prime #{n}" do
+      n.should be_chen_prime
+    end
+  end
+
+  @seq.to_seq.invert.each do |n|
+    it "returns false for non-Chen prime #{n}" do
+      n.should_not be_chen_prime
+    end
+  end
+end

data/spec/numb/cubic_residue_spec.rb

@@ -0,0 +1,40 @@
+# coding: utf-8
+describe Integer, "#cubic_residue?" do
+  # A096107
+  @seq = [
+          [1],
+          [1,2],
+          [1,3],
+          [1,2,3,4],
+          [1,5],
+          [1,6],
+          [1,3,5,7],
+          [1,8],
+          [1,3,7,9],
+          [1,2,3,4,5,6,7,8,9,10],
+          [1,5,7,11],
+          [1,5,8,12],
+          [1,13],
+          [1,2,4,7,8,11,13,14],
+          [1,3,5,7,9,11,13,15],
+          [1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16],
+          [1,17],
+          [1,7,8,11,12,18],
+          [1,3,7,9,11,13,17,19],
+          [1,8]
+  ]
+
+  @seq.to_enum.with_index(2).each do |values, p|
+    (1...p).each do |n|
+      if values.include?(n)
+        it "returns true for cubic residue (mod #{p}) #{n}" do
+          n.should be_cubic_residue(p)
+        end
+      elsif p != 21
+        it "returns false for cubic non-residue (mod #{p}) #{n}" do
+          n.should_not be_cubic_residue(p)
+        end
+      end
+    end
+  end
+end

data/spec/numb/factorial_spec.rb

@@ -1,12 +1,12 @@
-describe Integer, "#factorial" do
-  # A000142
-  @seq = [1,1,2,6,24,120,720,5040,40320,362880,3628800,
-          39916800,479001600,6227020800,87178291200,
-          1307674368000,20922789888000,355687428096000,
-          6402373705728000,121645100408832000,
-          2432902008176640000]
+# A000142
+FACTORIAL = [1,1,2,6,24,120,720,5040,40320,362880,3628800,
+             39916800,479001600,6227020800,87178291200,
+             1307674368000,20922789888000,355687428096000,
+             6402373705728000,121645100408832000,
+             2432902008176640000]
 
-  @seq.each_with_index do |factorial, n|
+describe Integer, "#factorial" do
+  FACTORIAL.each_with_index do |factorial, n|
     it "should return #{factorial} for #{n}!" do
       n.factorial.should == factorial
     end
@@ -14,22 +14,30 @@ describe Integer, "#factorial" do
 end
 
 describe Integer, "#factorial?" do
-  # A000142
-  @seq = [1,1,2,6,24,120,720,5040,40320,362880,3628800,
-          39916800,479001600,6227020800,87178291200,
-          1307674368000,20922789888000,355687428096000,
-          6402373705728000,121645100408832000,
-          2432902008176640000]
-
-  @seq.first(10).each do |n|
+  FACTORIAL.first(10).each do |n|
     it "should return true for factorial #{n}" do
       n.should be_factorial
     end
   end
 
-  @seq.first(10).to_seq.invert.sample(10).each do |n|
+  FACTORIAL.first(10).to_seq.invert.sample(10).each do |n|
     it "should return false for non-factorial #{n}" do
       n.should_not be_factorial
     end
   end
 end
+
+describe Integer, "#factorial_of?" do
+  FACTORIAL.first(12).each_with_index do |factorial, n|
+    next if n.zero?
+    it "should return #{n} for #{factorial}" do
+      factorial.factorial_of?.should == n
+    end
+  end
+
+  FACTORIAL.first(10).to_seq.invert.sample(10).each do |n|
+    it "should return false for non-factorial #{n}" do
+      n.factorial_of?.should be_false
+    end
+  end
+end

data/spec/numb/liouville_spec.rb

@@ -0,0 +1,16 @@
+# coding: utf-8
+describe Integer, "#liouville" do
+  # A008836
+  @seq = [1,-1,-1,1,-1,1,-1,-1,1,1,-1,-1,-1,1,1,1,-1,-1,-1,
+          -1,1,1,-1,1,1,1,-1,-1,-1,-1,-1,-1,1,1,1,1,-1,1,1,
+          1,-1,-1,-1,-1,-1,1,-1,-1,1,-1,1,-1,-1,1,1,1,1,1,
+          -1,1,-1,1,-1,1,1,-1,-1,-1,1,-1,-1,-1,-1,1,-1,-1,1,
+          -1,-1,-1,1,1,-1,1,1,1,1,1,-1,1,1,-1,1,1,1,1,-1,-1,
+          -1,1,-1]
+
+  @seq.to_enum.with_index(1).each do |l, n|
+    it "returns #{l} for #{n}" do
+      n.liouville.should == l
+    end
+  end
+end

data/spec/numb/mangoldt_spec.rb

@@ -0,0 +1,34 @@
+# coding: utf-8
+describe Integer, "#mangoldt" do
+  # A029833
+  @seq = [0,1,1,0,2,0,2,0,0,0,2,0,3,0,0,0,3,0,3,0,0,0,3,0,
+          0,0,0,0,3,0,3,0,0,0,0,0,4,0,0,0,4,0,4,0,0,0,4,0,0,
+          0,0,0,4,0,0,0,0,0,4,0,4,0,0,0,0,0,4,0,0,0,4,0,4,0,
+          0,0,0,0,4,0]
+
+  @seq.to_enum.with_index(1).each do |m, n|
+    it "returns a value which rounds to #{m} for #{n}" do
+      n.mangoldt.round.should == m
+    end
+  end
+  
+  # A029834
+  [0,0,1,0,1,0,1,0,0,0,2,0,2,0,0,0,2,0,2,0,0,0,3,0,
+   0,0,0,0,3,0,3,0,0,0,0,0,3,0,0,0,3,0,3,0,0,0,3,0,0,
+   0,0,0,3,0,0,0,0,0,4,0,4,0,0,0,0,0,4,0,0,0,4,0,4,0,
+   0,0,0,0,4,0].to_enum.with_index(1).each do |m, n|
+    it "returns a value which has a floor of #{m} for #{n}" do
+      n.mangoldt.floor.should == m
+    end
+  end
+
+  # A029832 
+  [0,1,2,0,2,0,2,0,0,0,3,0,3,0,0,0,3,0,3,0,0,0,4,0,
+   0,0,0,0,4,0,4,0,0,0,0,0,4,0,0,0,4,0,4,0,0,0,4,0,0,
+   0,0,0,4,0,0,0,0,0,5,0,5,0,0,0,0,0,5,0,0,0,5,0,5,0,
+   0,0,0,0,5,0].to_enum.with_index(1).each do |m, n|
+    it "returns a value which has a ceiling of #{m} for #{n}" do
+      n.mangoldt.ceil.should == m
+    end
+  end
+end

data/spec/numb/mertens_spec.rb

@@ -0,0 +1,15 @@
+# coding: utf-8
+describe Integer, "#mertens" do
+  # A002321
+  @seq = [1,0,-1,-1,-2,-1,-2,-2,-2,-1,-2,-2,-3,-2,-1,-1,-2,
+          -2,-3,-3,-2,-1,-2,-2,-2,-1,-1,-1,-2,-3,-4,-4,-3,
+          -2,-1,-1,-2,-1,0,0,-1,-2,-3,-3,-3,-2,-3,-3,-3,-3,
+          -2,-2,-3,-3,-2,-2,-1,0,-1,-1,-2,-1,-1,-1,0,-1,-2,
+          -2,-1,-2,-3,-3,-4,-3,-3,-3,-2,-3,-4,-4,-4]
+
+  @seq.to_enum.with_index(1).each do |m, n|
+    it "returns #{m} for #{n}" do
+      n.mertens.should == m
+    end
+  end
+end

data/spec/numb/quadratic_residue_spec.rb

@@ -0,0 +1,41 @@
+# coding: utf-8
+describe Integer, "#quadratic_residue?" do
+  #A046071
+  @seq = [
+      [1],
+      [1],
+      [1],
+      [1,4],
+      [1,3,4],
+      [1,2,4],
+      [1,4],
+      [1,4,7],
+      [1,4,5,6,9],
+      [1,3,4,5,9],
+      [1,4,9],
+      [1,3,4,9,10,12],
+      [1,2,4,7,8,9,11],
+      [1,4,6,9,10],
+      [1,4,9],
+      [1,2,4,8,9,13,15,16],
+      [1,4,7,9,10,13,16],
+      [1,4,5,6,7,9,11,16,17],
+      [1,4,5,9,16],
+      [1,4,7,9,15,16,18],
+      [1,3,4,5,9,11,12]
+  ]
+
+  @seq.to_enum.with_index(2).each do |values, p|
+    (1...p).each do |n|
+      if values.include?(n)
+        it "returns true for quadratic residue (mod #{p}) #{n}" do
+          n.should be_quadratic_residue(p)
+        end
+      elsif p != 22
+        it "returns false for quadratic non-residue (mod #{p}) #{n}" do
+          n.should_not be_quadratic_residue(p)
+        end
+      end
+    end
+  end
+end

data/spec/numb/ramanujan_tau_spec.rb

@@ -0,0 +1,23 @@
+# coding: utf-8
+describe Integer, "#ramanujan_tau" do
+  # A000594
+  @seq = [1,-24,252,-1472,4830,-6048,-16744,84480,-113643,
+          -115920,534612,-370944,-577738,401856,1217160,
+          987136,-6905934,2727432,10661420,-7109760,
+          -4219488,-12830688,18643272,21288960,-25499225,
+          13865712,-73279080,24647168]
+
+  @seq.to_enum.with_index(1).each do |r, n|
+    it "returns #{r} for #{n}" do
+      n.ramanujan_tau.should == r
+    end
+  end
+
+  # Confirm some arbitrary large(ish) values to confirm we aren't subject to
+  # rounding errors
+  [[1357, -96743736788237280], [1314, 3992391292945104]].each do |n, r|
+    it "returns #{r} for #{n}" do
+      n.ramanujan_tau.should == r
+    end
+  end
+end

data/spec/numb/reciprocal_spec.rb

@@ -0,0 +1,16 @@
+# coding: utf-8
+describe Integer, "#reciprocal" do
+  
+  100.times do
+    n = rand(10**10)
+    redo if n.zero?
+    r = Rational(1, n)
+    it "returns #{r} as the reciprocal of #{n}" do
+      n.reciprocal.should == r
+    end
+  end
+
+  it "raises a ZeroDivisionError for the reciprocal of zero" do
+    ->{ 0.reciprocal }.should raise_error(ZeroDivisionError)
+  end
+end

data/spec/numb/ruler_spec.rb

@@ -0,0 +1,15 @@
+# coding: utf-8
+describe Integer, "#ruler" do
+  # A001511
+  @seq = [1,2,1,3,1,2,1,4,1,2,1,3,1,2,1,5,1,2,1,3,1,2,1,4,
+          1,2,1,3,1,2,1,6,1,2,1,3,1,2,1,4,1,2,1,3,1,2,1,5,1,
+          2,1,3,1,2,1,4,1,2,1,3,1,2,1,7,1,2,1,3,1,2,1,4,1,2,
+          1,3,1,2,1,5,1,2,1,3,1,2,1,4,1,2,1,3,1,2,1,6,1,2,1,
+          3,1,2,1,4,1]
+
+  @seq.to_enum.with_index(1).each do |r, n|
+    it "returns #{r} for the ruller function applied to #{n}" do
+      n.ruler.should == r
+    end
+  end
+end

data/spec/numb/smarandache_spec.rb

@@ -0,0 +1,15 @@
+# coding: utf-8
+describe Integer, "#smarandache" do
+  # A002034
+  @seq = [1,2,3,4,5,3,7,4,6,5,11,4,13,7,5,6,17,6,19,5,7,11,
+          23,4,10,13,9,7,29,5,31,8,11,17,7,6,37,19,13,5,41,
+          7,43,11,6,23,47,6,14,10,17,13,53,9,11,7,19,29,59,
+          5,61,31,7,8,13,11,67,17,23,7,71,6,73,37,10,19,11,
+          13,79,6,9,41,83,7]
+
+  @seq.to_enum.with_index(1).each do |s, n|
+    it "returns #{s} as the value of the Smarandache function for #{n}" do
+      n.smarandache.should == s
+    end
+  end
+end

data/spec/numb/sum_of_divisors_spec.rb

@@ -0,0 +1,44 @@
+# coding: utf-8
+describe Integer, "σ" do
+
+  @seq = {
+    # A000005 
+    0 => [1,2,2,3,2,4,2,4,3,4,2,6,2,4,4,5,2,6,2,6,4,4,2,8,
+          3,4,4,6,2,8,2,6,4,4,4,9,2,4,4,8,2,8,2,6,6,4,2,10,
+          3,6,4,6,2,8,4,8,4,4,2,12,2,4,6,7,4,8,2,6,4,8,2,12,
+          2,4,6,6,4,8,2,10,5,4,2,12,4,4,4,8,2,12,4,6,4,4,4,
+          12,2,6,6,9,2,8,2,8],
+    # A000203      
+    1 => [1,3,4,7,6,12,8,15,13,18,12,28,14,24,24,31,18,39,
+          20,42,32,36,24,60,31,42,40,56,30,72,32,63,48,54,
+          48,91,38,60,56,90,42,96,44,84,78,72,48,124,57,93,
+          72,98,54,120,72,120,80,90,60,168,62,96,104,127,84,
+          144,68,126,96,144],
+    # A001157      
+    2 => [1,5,10,21,26,50,50,85,91,130,122,210,170,250,260,
+          341,290,455,362,546,500,610,530,850,651,850,820,
+          1050,842,1300,962,1365,1220,1450,1300,1911,1370,
+          1810,1700,2210,1682,2500,1850,2562,2366,2650,2210,
+          3410,2451,3255],
+    # A001158       
+    3 => [1,9,28,73,126,252,344,585,757,1134,1332,2044,
+          2198,3096,3528,4681,4914,6813,6860,9198,9632,
+          11988,12168,16380,15751,19782,20440,25112,24390,
+          31752,29792,37449,37296,44226,43344,55261,50654,
+          61740,61544],
+  }
+
+  @seq.each do |k, values|
+    values.to_enum.with_index(1).each do |m, n|
+      it "returns #{m} for σ#{k}(#{n})" do
+        n.σ(k).should == m
+      end
+    end
+  end
+
+  @seq[1].to_enum.with_index(1).each do |m, n|
+    it "returns #{m} for σ(#{n})" do
+      n.σ.should == m
+    end
+  end
+end

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification 
 name: numb
 version: !ruby/object:Gem::Version 
-  version: 0.170.0
+  version: 0.181.0
 platform: ruby
 authors: 
 - Run Paint Run Run
@@ -9,7 +9,7 @@ autorequire:
 bindir: bin
 cert_chain: []
 
-date: 2010-03-26 00:00:00 +00:00
+date: 2010-03-27 00:00:00 +00:00
 default_executable: 
 dependencies: 
 - !ruby/object:Gem::Dependency 
@@ -141,6 +141,7 @@ files:
 - lib/numb/proth.rb
 - lib/numb/q.rb
 - lib/numb/quarticfree.rb
+- lib/numb/reciprocity.rb
 - lib/numb/refactorable.rb
 - lib/numb/repunit.rb
 - lib/numb/reverse.rb
@@ -204,12 +205,14 @@ files:
 - spec/numb/centered_pentagonal_spec.rb
 - spec/numb/centered_square_spec.rb
 - spec/numb/centered_triangular_spec.rb
+- spec/numb/chen_prime_spec.rb
 - spec/numb/choose_spec.rb
 - spec/numb/composite_spec.rb
 - spec/numb/congruum_spec.rb
 - spec/numb/coprime_spec.rb
 - spec/numb/core_spec.rb
 - spec/numb/cube_spec.rb
+- spec/numb/cubic_residue_spec.rb
 - spec/numb/cullen_spec.rb
 - spec/numb/cyclic_spec.rb
 - spec/numb/d_spec.rb
@@ -275,13 +278,16 @@ files:
 - spec/numb/lah_spec.rb
 - spec/numb/leonardo_spec.rb
 - spec/numb/leyland_spec.rb
+- spec/numb/liouville_spec.rb
 - spec/numb/lucas2_spec.rb
 - spec/numb/lucas_carmichael_spec.rb
 - spec/numb/lucas_spec.rb
 - spec/numb/lychrel_spec.rb
+- spec/numb/mangoldt_spec.rb
 - spec/numb/maris_mcgwire_sosa_pair_spec.rb
 - spec/numb/mersenne_prime_spec.rb
 - spec/numb/mersenne_spec.rb
+- spec/numb/mertens_spec.rb
 - spec/numb/minimal_spec.rb
 - spec/numb/mobius_spec.rb
 - spec/numb/modulo_order_spec.rb
@@ -335,12 +341,16 @@ files:
 - spec/numb/proth_spec.rb
 - spec/numb/pyramidal_spec.rb
 - spec/numb/q_spec.rb
+- spec/numb/quadratic_residue_spec.rb
 - spec/numb/quarticfree_spec.rb
+- spec/numb/ramanujan_tau_spec.rb
+- spec/numb/reciprocal_spec.rb
 - spec/numb/refactorable_spec.rb
 - spec/numb/repunit_spec.rb
 - spec/numb/reverse_spec.rb
 - spec/numb/rhonda_spec.rb
 - spec/numb/rough_spec.rb
+- spec/numb/ruler_spec.rb
 - spec/numb/safe_prime_spec.rb
 - "spec/numb/schr\xC3\xB6der_spec.rb"
 - spec/numb/segmented_spec.rb
@@ -349,6 +359,7 @@ files:
 - spec/numb/semi_perfect_spec.rb
 - spec/numb/semiprime_spec.rb
 - spec/numb/singly_even_spec.rb
+- spec/numb/smarandache_spec.rb
 - spec/numb/smarandache_wellin_spec.rb
 - spec/numb/smith_spec.rb
 - spec/numb/smooth_spec.rb
@@ -368,6 +379,7 @@ files:
 - "spec/numb/st\xC3\xB8rmer_spec.rb"
 - spec/numb/subfactorial_spec.rb
 - spec/numb/sublime_spec.rb
+- spec/numb/sum_of_divisors_spec.rb
 - spec/numb/sum_of_e_divisors_spec.rb
 - spec/numb/sum_of_infinitary_divisors_spec.rb
 - spec/numb/sum_of_squares_spec.rb
@@ -436,11 +448,13 @@ test_files:
 - spec/numb/proth_spec.rb
 - spec/numb/stella_octangula_spec.rb
 - spec/numb/prime_signature_spec.rb
+- spec/numb/reciprocal_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/mangoldt_spec.rb
 - spec/numb/choose_spec.rb
 - spec/numb/n_step_fibonacci_spec.rb
 - spec/numb/sum_of_infinitary_divisors_spec.rb
@@ -467,6 +481,7 @@ test_files:
 - spec/numb/biquadratic_spec.rb
 - spec/numb/self_spec.rb
 - spec/numb/pandigital_spec.rb
+- spec/numb/ruler_spec.rb
 - spec/numb/square_spec.rb
 - spec/numb/quarticfree_spec.rb
 - spec/numb/untouchable_spec.rb
@@ -486,6 +501,7 @@ test_files:
 - spec/numb/persistent_spec.rb
 - spec/numb/cullen_spec.rb
 - spec/numb/palindrome_spec.rb
+- spec/numb/smarandache_spec.rb
 - spec/numb/zerofree_spec.rb
 - spec/numb/eban_spec.rb
 - spec/numb/automorphic_spec.rb
@@ -539,6 +555,7 @@ test_files:
 - spec/numb/entringer_spec.rb
 - spec/numb/unitary_sociable_spec.rb
 - spec/numb/full_reptend_prime_spec.rb
+- spec/numb/quadratic_residue_spec.rb
 - spec/numb/vampire_spec.rb
 - spec/numb/tetrahedral_spec.rb
 - spec/numb/dodecagonal_spec.rb
@@ -554,6 +571,7 @@ test_files:
 - spec/numb/totient_spec.rb
 - spec/numb/leyland_spec.rb
 - spec/numb/mersenne_prime_spec.rb
+- spec/numb/chen_prime_spec.rb
 - spec/numb/composite_spec.rb
 - spec/numb/practical_spec.rb
 - spec/numb/words_spec.rb
@@ -582,9 +600,11 @@ test_files:
 - spec/numb/hexagonal_spec.rb
 - spec/numb/nsw_spec.rb
 - spec/numb/primitive_abundant_spec.rb
+- spec/numb/liouville_spec.rb
 - spec/numb/lucas2_spec.rb
 - spec/numb/genocchi_spec.rb
 - spec/numb/wieferich_prime_spec.rb
+- spec/numb/cubic_residue_spec.rb
 - spec/numb/fibonacci_spec.rb
 - spec/numb/triangular_spec.rb
 - spec/numb/integer_p_spec.rb
@@ -616,6 +636,7 @@ test_files:
 - spec/numb/weird_spec.rb
 - spec/numb/interprime_spec.rb
 - spec/numb/number_of_distinct_prime_factors_spec.rb
+- spec/numb/mertens_spec.rb
 - spec/numb/catalan_spec.rb
 - spec/numb/balanced_prime_spec.rb
 - spec/numb/binomial_spec.rb
@@ -628,11 +649,13 @@ test_files:
 - spec/numb/super_poulet_spec.rb
 - spec/numb/sum_of_e_divisors_spec.rb
 - spec/numb/pyramidal_spec.rb
+- spec/numb/ramanujan_tau_spec.rb
 - spec/numb/super_d_spec.rb
 - spec/numb/factorion_spec.rb
 - spec/numb/lah_spec.rb
 - spec/numb/undulating_spec.rb
 - spec/numb/extravagant_spec.rb
+- spec/numb/sum_of_divisors_spec.rb
 - spec/numb/lychrel_spec.rb
 - spec/numb/self_descriptive_spec.rb
 - spec/numb/decagonal_spec.rb