numb 0.114.0 → 0.125.0

data/VERSION

@@ -1 +1 @@
-0.114.0
+0.125.0

data/lib/numb/aliquot_sequence.rb

@@ -1,6 +1,6 @@
 # coding: utf-8
 class Integer
-  def aliquot_sequence(max_iterations=(self > 100 ? 10 : Math.sqrt(self)),
+  def aliquot_sequence(max_iterations=(self > 100 ? 10 : sqrt),
                        summatory_function=->(n){ n.aliquot_sum })
     sequence = [self]
     max_iterations.floor.times do |limit|

data/lib/numb/carmichael.rb

@@ -5,4 +5,18 @@ class Integer
       (self - 1).remainder(p - 1) == 0
     end
   end
+
+  def carmichael
+    case self
+      when 1, 2 then 1
+      when 4 then 2
+      else
+        if primaries.size == 1
+          p, a = primaries.first
+          return totient if p.odd?
+          return totient/2 if p == 2 and a >= 3
+        end
+        primaries.map{|p| p.reduce(:**)}.map(&:carmichael).reduce(&:lcm)
+    end
+  end
 end

data/lib/numb/centered_pentagonal.rb

@@ -0,0 +1,6 @@
+class Integer
+  def centered_pentagonal?
+    n = self - 1
+    n.divides?(5) and (n/5).triangular?
+  end
+end

data/lib/numb/cube.rb

@@ -1,8 +1,5 @@
 class Integer
   def cube?
-    y = self < 0 ? (-self) : self
-    x = Math.cbrt(y)
-    # The hack below is seemingly needed for 1.8 compatibility
-    x.ceil.to_f.to_s == x.to_s
+    Math.cbrt(self).integer?
   end
 end

data/lib/numb/cullen.rb

@@ -0,0 +1,7 @@
+class Integer
+  def cullen?
+    return true if self == 1
+    factors = (self - 1).divisors.sort
+    factors.first(factors.size/2).any?{|n| n * 2**n + 1 == self}
+  end
+end

data/lib/numb/cyclic.rb

@@ -0,0 +1,12 @@
+class Integer
+  def cyclic?
+    return true if zero?
+    return false unless digits.size >= 6
+    nzd = nonzero_digits.sort
+    (1...digits.size).all?{|n| (self * n).nonzero_digits.sort == nzd}
+  end
+
+  def nonzero_digits
+    digits.reject(&:zero?)
+  end
+end

data/lib/numb/delannoy.rb

@@ -0,0 +1,25 @@
+class Integer
+  def delannoy?
+    return true if self == 1
+    max_a, max_b = self/2, self/2
+    (1..max_a).each do |a|
+      (1..max_b).each do |b|
+        d = a.delannoy(b)
+        return true if d == self
+        if d > self
+          max_b = b 
+          max_a = a
+          break
+        end
+      end
+      break if a > max_a
+    end
+    false
+  end
+
+  def delannoy(b)
+    a = self
+    return 1 if b.zero? or a.zero?
+    [(a - 1).delannoy(b), a.delannoy(b - 1), (a - 1).delannoy(b - 1)].reduce(:+)
+  end
+end

data/lib/numb/demlo.rb

@@ -0,0 +1,9 @@
+class Integer
+  def demlo
+    repunit ** 2
+  end
+
+  def demlo?
+    square? and isqrt.repunit?(10)
+  end
+end

data/lib/numb/full_reptend_prime.rb

@@ -0,0 +1,5 @@
+class Integer
+  def full_reptend_prime?
+    prime? and primitive_root?(10)
+  end
+end

data/lib/numb/integer_p.rb

@@ -6,6 +6,6 @@ end
 
 class Float
   def integer?
-    self == to_i
+    round(10) == to_i
   end
 end

data/lib/numb/leyland.rb

@@ -1,7 +1,7 @@
 class Integer
   def leyland?
-    (2..Math.sqrt(self)).each do |x|
-      (x..Math.sqrt(self)).each do |y|
+    (2..sqrt).each do |x|
+      (x..sqrt).each do |y|
         sum = x**y + y**x
         return true if sum == self
         break if sum > self

data/lib/numb/modulo_order.rb

@@ -0,0 +1,12 @@
+class Integer
+  def modulo_order(n)
+    return 0 if n < 1
+    return 1 if self == 2 and n == 1
+    (1..n.totient).each{|e| return e if (self**e).modulo(n) == 1}
+    0
+  end
+  alias :haupt_exponent :modulo_order
+  alias :multiplicative_order :modulo_order
+  # TODO: Add Rational#period for calculating the period of the decimal
+  # expansion of the rational in terms the multiplicative order of 10
+end

data/lib/numb/noncototient.rb

@@ -2,7 +2,7 @@
 class Integer
   def noncototient?
     return false if self < 10 or odd?
-    (Math.sqrt(self).floor..(2 * self)).none? do |m|
+    (isqrt..(2 * self)).none? do |m|
       m.cototient == self
     end
   end

data/lib/numb/number_of_divisors.rb

@@ -7,11 +7,10 @@ class Integer
   def τ 
     n = self
     return @nod if defined?(@nod)
-    square_root = Math.sqrt(n)
-    @nod = (1..square_root.floor).
+    @nod = (1..isqrt).
       map {|i|  n.quo(i).to_i - (n - 1).quo(i).to_i }.
       reduce(:+) * 2
-    @nod -= 1 if square_root.integer?
+    @nod -= 1 if square?
     @nod
   end
 

data/lib/numb/primitive_root.rb

@@ -0,0 +1,15 @@
+class Integer
+  def primitive_root?(g=nil)
+    if g
+      return true if g.zero? and self == 1
+      coprime?(g) and g.modulo_order(self) == totient
+    else
+      return true if [1, 2, 4].include?(self)
+      prime_factors.select(&:odd?).any? do |p|
+        [1,2].any? do |x|
+          Math.log(self / x, p).integer?
+        end
+      end
+    end
+  end
+end

data/lib/numb/primitive_roots.rb

@@ -0,0 +1,6 @@
+class Integer
+  def primitive_roots
+    return [] unless primitive_root?
+    (0..self).select{|n| primitive_root?(n)}
+  end
+end

data/lib/numb/pronic.rb

@@ -1,6 +1,6 @@
 class Integer
   def pronic?
     return false unless even? and (positive? or zero?)
-    (Math.sqrt(succ).round - Math.sqrt(self).round) == 1
+    (Math.sqrt(succ).round - sqrt.round) == 1
   end
 end

data/lib/numb/repunit.rb

@@ -2,4 +2,8 @@ class Integer
   def repunit?(base)
     !!to_s(base).match(/^1+$/)
   end
+
+  def repunit
+    (10 ** self) / 9 
+  end
 end

data/lib/numb/square.rb

@@ -2,6 +2,6 @@
 class Integer
   def square?
     return false if self < 0
-    Math.sqrt(self).integer?
+    sqrt.integer?
   end
 end

data/lib/numb/squared_triangular.rb

@@ -1,5 +1,5 @@
 class Integer
   def squared_triangular?
-    square? and Math.sqrt(self).to_i.triangular?
+    square? and sqrt.to_i.triangular?
   end
 end

data/lib/numb/strictly_non_palindromic.rb

@@ -5,6 +5,6 @@ end
 class Integer
   def strictly_non_palindromic?
     return true if (0..4).include?(self) or self == 6
-    prime? and (2..(Math.sqrt(self).floor)).none?{|base| base(base).palindrome?}
+    prime? and (2..(isqrt)).none?{|base| base(base).palindrome?}
   end
 end

data/lib/numb/unusual.rb

@@ -1,5 +1,5 @@
 class Integer
   def unusual?
-    prime_factors.max > Math.sqrt(self)
+    prime_factors.max > sqrt
   end
 end

data/lib/numb.rb

@@ -22,6 +22,14 @@ class Integer
     divisors.select{|d| d > 1}.select{|d| d.odd?}.size
   end
 
+  def sqrt
+    Math.sqrt(self)
+  end
+
+  def isqrt
+    sqrt.floor
+  end
+
   def proper_divisors
     divisors.reject {|d| d == self }
   end
@@ -29,8 +37,8 @@ class Integer
   def divisors
     return [] unless positive?
     return [1, self] if prime?
-    (1..Math.sqrt(self).floor).select { |n| (self % n).zero? }.
-                               map {|n| [n, self/n]}.flatten.uniq
+    (1..isqrt).select { |n| (self % n).zero? }.
+               map {|n| [n, self/n]}.flatten.uniq
   end
 
   def sum_of_divisors
@@ -64,4 +72,8 @@ end
 
 require 'prime'
 
+class Integer
+  alias :primaries :prime_division
+end
+
 Dir.glob(File.dirname(__FILE__) + '/numb/*.rb').each {|file| require file}

data/spec/numb/carmichael_spec.rb

@@ -18,3 +18,18 @@ describe Integer, "#carmichael?" do
     end
   end
 end
+
+describe Integer, "#carmichael" do
+  # A002322 
+  @seq = [1,1,2,2,4,2,6,2,6,4,10,2,12,6,4,4,16,6,18,4,6,10,
+          22,2,20,12,18,6,28,4,30,8,10,16,12,6,36,18,12,4,
+          40,6,42,10,12,22,46,4,42,20,16,12,52,18,20,6,18,
+          28,58,4,60,30,6,16,12,10,66,16,22,12,70,6,72,36,
+          20,18,30,12,78,4,54]
+
+  @seq.to_enum.with_index(1).each do |c,n|
+    it "returns #{c} for #{n}" do
+      n.carmichael.should == c
+    end
+  end
+end

data/spec/numb/centered_pentagonal_spec.rb

@@ -0,0 +1,20 @@
+describe Integer, "#centered_pentagonal?" do
+ #  A005891
+  @seq = [1,6,16,31,51,76,106,141,181,226,276,331,391,456,
+          526,601,681,766,856,951,1051,1156,1266,1381,1501,
+          1626,1756,1891,2031,2176,2326,2481,2641,2806,2976,
+          3151,3331,3516,3706,3901,4101,4306,4516,4731,4951,
+          5176,5406]
+
+  @seq.each do |n|
+    it "returns true for centered pentagonal #{n}" do
+      n.should be_centered_pentagonal
+    end
+  end
+
+  @seq.to_seq.invert.sample(100).each do |n|
+    it "returns false for non-centered-pentagonal #{n}" do
+      n.should_not be_centered_pentagonal
+    end
+  end
+end

data/spec/numb/cullen_spec.rb

@@ -0,0 +1,20 @@
+describe Integer, "#cullen?" do
+  # A002064
+  @seq = [1,3,9,25,65,161,385,897,2049,4609,10241,22529,
+          49153,106497,229377,491521,1048577,2228225,
+          4718593,9961473,20971521,44040193,92274689,
+          192937985,402653185,838860801,1744830465,
+          3623878657,7516192769]
+
+  @seq.sample(10).each do |n|
+    it "returns true for Cullen number #{n}" do
+      n.should be_cullen
+    end
+  end
+
+  @seq.to_seq.invert.sample(10).each do |n|
+    it "returns false for non-Cullen number #{n}" do
+      n.should_not be_cullen
+    end
+  end
+end

data/spec/numb/cyclic_spec.rb

@@ -0,0 +1,19 @@
+describe Integer, "#cyclic?" do
+  # A004042
+  @seq = [0,142857,5882352941176470,526315789473684210,
+          4347826086956521739130,
+          3448275862068965517241379310,
+          2127659574468085106382978723404255319148936170]
+
+  @seq.each do |n|
+    it "returns true for cyclic number #{n}" do
+      n.should be_cyclic
+    end
+  end
+
+  @seq.to_seq.invert.sample(100).each do |n|
+    it "returns false for non-cyclic number #{n}" do
+      n.should_not be_cyclic
+    end
+  end
+end

data/spec/numb/delannoy_spec.rb

@@ -0,0 +1,40 @@
+describe Integer, "#delannoy" do
+  #  A008288 / http://mathworld.wolfram.com/DelannoyNumber.html
+  @seq = [
+    [1,  1,  1,  1,    1,    1,    1,    1,     1],
+    [1,  3,  5,  7,    9,   11,   13,   15,    17],
+    [1,  5, 13, 25,   41,   61,   85,  113,   145],
+    [1,  7, 25, 63,  129,  231,  377,  575,   833],
+    [1,  9, 41, 129, 321,  681, 1289, 2241,  3649],
+    [1, 11, 61, 231, 681, 1683, 3653, 7183, 13073],
+  ]
+
+  @seq.each_with_index do |row, a|
+    row.each_with_index do |d, b|
+      it "returns #{d} for Delannoy(#{a}, #{b})" do
+        a.delannoy(b).should == d
+      end
+    end
+  end
+end
+
+describe Integer, "#delannoy?" do
+  #  A008288
+  @seq = [1,1,1,1,3,1,1,5,5,1,1,7,13,7,1,1,9,25,25,9,1,1,
+          11,41,63,41,11,1,1,13,61,129,129,61,13,1,1,15,85,
+          231,321,231,85,15,1,1,17,113,377,681,681,377,113,
+          17,1,1,19,145,575,1289,1683,1289,575,145,19,1,1,
+          21,181,833,2241,3653,3653].uniq
+
+  @seq.each do |n|
+    it "returns true for Delannoy number #{n}" do
+      n.should be_delannoy
+    end
+  end
+
+  [2, 10, 50, 26, 80].each do |n|
+    it "returns false for non-Delannoy number #{n}" do
+      n.should_not be_delannoy
+    end
+  end
+end

data/spec/numb/demlo_spec.rb

@@ -0,0 +1,28 @@
+# A002477 
+DEMLO = [1,121,12321,1234321,123454321,12345654321,
+        1234567654321,123456787654321,12345678987654321,
+        1234567900987654321,123456790120987654321,
+        12345679012320987654321,
+        1234567901234320987654321]
+
+describe Integer, "#demlo" do
+  DEMLO.to_enum.with_index(1).each do |demlo, n|
+    it "returns #{demlo} for #{n}" do
+      n.demlo.should == demlo
+    end
+  end
+end
+
+describe Integer, "#demlo?" do
+  DEMLO.each do |n|
+    it "returns true for Demlo number #{n}" do
+      n.should be_demlo
+    end
+  end
+
+  DEMLO.to_seq.invert.sample(500).each do |n|
+    it "returns false for non-Demlo number #{n}" do
+      n.should_not be_demlo
+    end
+  end
+end

data/spec/numb/full_reptend_prime_spec.rb

@@ -0,0 +1,20 @@
+describe Integer, "#full_reptend_prime?" do
+  # A001913 
+  @seq = [7,17,19,23,29,47,59,61,97,109,113,131,149,167,
+          179,181,193,223,229,233,257,263,269,313,337,367,
+          379,383,389,419,433,461,487,491,499,503,509,541,
+          571,577,593,619,647,659,701,709,727,743,811,821,
+          823,857,863,887,937,941]
+
+  @seq.each do |n|
+    it "returns true for full-reptend prime #{n}" do
+      n.should be_full_reptend_prime
+    end
+  end
+
+  @seq.to_seq.invert.sample(100).each do |n|
+    it "returns false for non-full-reptend-prime #{n}" do
+      n.should_not be_full_reptend_prime
+    end
+  end
+end

data/spec/numb/integer_p_spec.rb

@@ -18,4 +18,10 @@ describe Float, "#integer?" do
       n.should_not be_integer
     end
   end
+
+  it "ignores digits past the tenth" do
+    3.00000000001.should be_integer
+    123.0000000000032.should be_integer
+    123.00000000032.should_not be_integer
+  end
 end

data/spec/numb/isqrt_spec.rb

@@ -0,0 +1,14 @@
+describe Integer, "#isqrt" do
+  # A000196 
+  @seq = [0,1,1,1,2,2,2,2,2,3,3,3,3,3,3,3,4,4,4,4,4,4,4,4,
+        4,5,5,5,5,5,5,5,5,5,5,5,6,6,6,6,6,6,6,6,6,6,6,6,6,
+        7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,8,8,8,8,8,8,8,8,8,8,
+        8,8,8,8,8,8,8,9,9,9,9,9,9,9,9,9,9,9,9,9,9,9,9,9,9,
+        9,10,10]
+
+  @seq.each_with_index do |isqrt, n|
+    it "returns #{isqrt} for #{n}" do
+      n.isqrt.should == isqrt
+    end
+  end
+end

data/spec/numb/modulo_order_spec.rb

@@ -0,0 +1,67 @@
+describe Integer, "#modulo_order" do
+  @seq = {
+    # A002326 
+    2 => [1,2,4,3,6,10,12,4,8,18,6,11,20,18,28,5,10,12,36,
+          12,20,14,12,23,21,8,52,20,18,58,60,6,12,66,22,35,
+          9,20,30,39,54,82,8,28,11,12,10,36,48,30,100,51,12,
+          106,36,36,28,44,12,24,110,20,100,7,14,130,18,36,
+          68,138,46,60,28],
+    # A050975
+    3 => [1,2,4,6,2,4,5,3,6,4,16,18,4,5,11,20,3,6,28,30,8,
+          16,12,18,18,4,8,42,10,11,23,42,20,6,52,20,6,28,29,
+          10,30,16,12,22,16,12,35,12,18,18,30,78,4,8,41,16,
+          42,10,88,6,22,23,36,48,42,20,100,34,6,52,53,27,20,
+          12],
+    # A050976      
+    4 => [1,2,3,3,5,6,2,4,9,3,11,10,9,14,5,5,6,18,6,10,7,6,
+          23,21,4,26,10,9,29,30,3,6,33,11,35,9,10,15,39,27,
+          41,4,14,11,6,5,18,24,15,50,51,6,53,18,18,14,22,6,
+          12,55,10,50,7,7,65,9,18,34,69,23,30,14,21,74,15,
+          12,10,26],
+    # A050977      
+    5 => [1,2,1,2,6,2,6,5,2,4,6,4,16,6,9,6,5,22,2,4,18,6,
+          14,3,8,10,16,6,36,9,4,20,6,42,5,22,46,4,42,16,4,
+          52,18,6,18,14,29,30,3,6,16,10,22,16,22,5,6,72,36,
+          9,30,4,39,54,20,82,6,42,14,10,44,12,22,6,46,8,96,
+          42,30,25,16],
+    # A050978      
+    6 => [1,2,10,12,16,9,11,5,14,6,2,4,40,3,23,14,26,10,58,
+          60,12,33,35,36,10,78,82,16,88,12,9,12,10,102,106,
+          108,112,11,16,110,25,126,130,18,136,23,60,14,37,
+          150,6,156,22,27,83,156,43,10,178,60,4,80,19,96,14,
+          198,14],
+    # A050979      
+    7 => [1,1,2,4,1,2,3,4,10,2,12,4,2,16,3,3,4,10,22,2,4,
+          12,9,7,4,15,4,10,16,6,9,3,12,4,40,6,10,12,22,23,2,
+          4,16,12,26,9,20,3,7,29,4,60,15,8,12,10,66,16,22,
+          70,6,24,9,4,6,12,78,4,27,40,41,16,6,7,10,88,12,22,
+          15,23,12],
+    # A050980
+    8 => [2,4,1,2,10,4,4,8,6,2,11,20,6,28,5,10,4,12,4,20,
+          14,4,23,7,8,52,20,6,58,20,2,4,22,22,35,3,20,10,13,
+          18,82,8,28,11,4,10,12,16,10,100,17,4,106,12,12,28,
+          44,4,8,110,20,100,7,14,130,6,12,68,46,46,20,28,14,
+          148,5],
+    # A050981      
+    9 => [1,1,2,3,1,2,5,3,3,2,8,9,2,5,11,10,3,3,14,15,4,8,
+          6,9,9,2,4,21,5,11,23,21,10,3,26,10,3,14,29,5,15,8,
+          6,11,8,6,35,6,9,9,15,39,2,4,41,8,21,5,44,3,11,23,
+          18,24,21,10,50,17,3,26,53,27,10,6,56,22,14,29,24,
+          5,5,15],
+    # A002329
+    10 =>[1,6,1,2,6,16,18,6,22,3,28,15,2,3,6,5,21,46,42,16,
+          13,18,58,60,6,33,22,35,8,6,13,9,41,28,44,6,15,96,
+          2,4,34,53,108,3,112,6,48,22,5,42,21,130],
+  }
+
+  @seq.each do |base, values|
+    1.upto(100) do |n|
+      mo = base.modulo_order(n)
+      value = mo.zero? ? 0 : values.shift
+      it "returns #{value} for the multiplicative order of base #{base} (mod #{n})" do
+        mo.should == value
+      end
+      break if values.empty?
+    end
+  end
+end

data/spec/numb/primitive_root_spec.rb

@@ -0,0 +1,74 @@
+describe Integer, "#primitive_root?" do
+  # A033948
+  @seq = [1,2,3,4,5,6,7,9,10,11,13,14,17,18,19,22,23,25,26,
+          27,29,31,34,37,38,41,43,46,47,49,50,53,54,58,59,61,62,
+          67,71,73,74,79,81,82,83,86,89,94,97,98,101,103,106,107,
+          109,113,118,121,122,125,127,131,134,137,139]
+
+  @seq.sample(10).each do |n|
+    it "returns true for #{n} which has a primitive root" do
+      n.should be_primitive_root
+    end
+  end
+
+  @seq.to_seq.invert.sample(10).each do |n|
+    it "returns false for #{n} which doesn't have a primitive root" do
+      n.should_not be_primitive_root
+    end
+  end
+end
+
+describe Integer, "#primitive_root? (with argument)" do
+  # A046145
+  @seq = [0,0,1,2,3,2,5,3,0,2,3,2,0,2,3,0,0,3,5,2,0,0,7,5,
+          0,2,7,2,0,2,0,3,0,0,3,0,0,2,3,0,0,6,0,3,0,0,5,5,0,
+          3,3,0,0,2,5,0,0,0,3,2,0,2,3,0,0,0,0,2,0,0,0,7,0,5,
+          5,0,0,0,0,3,0,2,7,2,0,0,3,0,0,3,0,0,0,0,5,0,0,5,3,
+          0,0]
+
+  @seq.each_with_index.to_a.sample(5).each do |root,n|
+    next if root.zero?
+    (1...root).each do |non_root|
+      it "returns false for #{n} when given a root of #{non_root}" do
+        n.should_not be_primitive_root(non_root)
+      end
+    end
+
+    it "returns true for #{n} when given a root of #{root}" do
+      n.should be_primitive_root(root)
+    end
+  end
+
+  # A001122
+  [3,5,11,13,19,29,37,53,59,61,67,83,101,107,131,
+   139,149,163,173,179,181,197,211,227,269,293,317,
+   347,349,373,379,389,419,421,443,461,467,491,509,
+   523,541,547,557,563,587,613,619,653,659,661,677,
+   701,709,757,773,787,797].sample(5).each do |n|
+
+    it "returns true for #{n} when given a root of 2" do
+      n.should be_primitive_root(2)
+    end
+  end
+  
+  [71,239,241,359,431,499,599,601,919,997,1051,1181,
+   1249,1439,1609,1753,2039,2089,2111,2179,2251,2281,
+   2341,2591,2593,2671,2711,2879,3119,3121,3169,3181,
+   3457,3511,3541,3719,3739,3769,4271,4513,4799,4801,
+   4943,5197].first(10).sample(5).each do |n|
+    (1...7).to_a.sample(1).each do |root|
+      
+      it "returns false for #{n} when given a root of #{root}" do
+        n.should_not be_primitive_root(root)
+      end
+    end
+
+    it "returns true for #{n} when given a root of 7" do
+      n.should be_primitive_root(7)
+    end
+  end
+  
+  it "returns true when asked whether 0 is a primitive root of unity" do
+    1.should be_primitive_root(0)
+  end
+end

data/spec/numb/primitive_roots_spec.rb

@@ -0,0 +1,34 @@
+describe Integer, "#primitive_roots" do
+  # A046144
+  @seq = [1,1,1,1,2,1,2,0,2,2,4,0,4,2,0,0,8,2,6,0,0,4,10,0,
+          8,4,6,0,12,0,8,0,0,8,0,0,12,6,0,0,16,0,12,0,0,10,
+          22,0,12,8,0,0,24,6,0,0,0,12,28,0,16,8,0,0,0,0,20,
+          0,0,0,24,0,24,12,0,0,0,0,24,0,18,16,40,0,0,12,0,0,
+          40,0,0]
+
+  @seq.to_enum.with_index(1).each do |count,n|
+    pr = n.primitive_roots
+    it "returns #{count} primitive roots for #{n}" do
+      pr.size.should == count
+      pr.uniq.size.should == pr.size
+    end
+    
+    pr.sample(2).each do |root|
+      it "returns actual primitive roots, e.g. #{root} for #{n}" do
+        n.primitive_root?(root)
+      end
+    end
+  end
+  
+  # A046146 
+  @seq = [0,0,1,2,3,3,5,5,0,5,7,8,0,11,5,0,0,14,11,15,0,0,
+          19,21,0,23,19,23,0,27,0,24,0,0,31,0,0,35,33,0,0,
+          35,0,34,0,0,43,45,0,47,47,0,0,51,47,0,0,0,55,56,0,
+          59,55,0,0,0,0,63,0,0,0,69,0,68,69,0,0,0,0,77,0,77,
+          75,80,0,0].each_with_index.to_a.sample(15).each do |largest, n|
+    next if largest.zero?
+    it "returns #{largest} as the largest primitive root of #{n}" do
+      n.primitive_roots.max.should == largest
+    end
+  end
+end

data/spec/numb/repunit_spec.rb

@@ -23,3 +23,19 @@ describe Integer, "#repunit?" do
     end
   end
 end
+
+describe Integer, "#repunit" do
+  # A002275
+  @seq = [0,1,11,111,1111,11111,111111,1111111,11111111,
+          111111111,1111111111,11111111111,111111111111,
+          1111111111111,11111111111111,111111111111111,
+          1111111111111111,11111111111111111,
+          111111111111111111,1111111111111111111,
+          11111111111111111111]
+  
+  @seq.each_with_index do |repunit, n|
+    it "returns #{repunit} for #{n}" do
+      n.repunit.should == repunit
+    end
+  end
+end

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification 
 name: numb
 version: !ruby/object:Gem::Version 
-  version: 0.114.0
+  version: 0.125.0
 platform: ruby
 authors: 
 - Run Paint Run Run
@@ -9,7 +9,7 @@ autorequire:
 bindir: bin
 cert_chain: []
 
-date: 2010-03-14 00:00:00 +00:00
+date: 2010-03-15 00:00:00 +00:00
 default_executable: 
 dependencies: 
 - !ruby/object:Gem::Dependency 
@@ -68,6 +68,7 @@ files:
 - lib/numb/centered_cube.rb
 - lib/numb/centered_hexagonal.rb
 - lib/numb/centered_n_gonal.rb
+- lib/numb/centered_pentagonal.rb
 - lib/numb/centered_triangular.rb
 - lib/numb/composite.rb
 - lib/numb/congruum.rb
@@ -76,9 +77,13 @@ files:
 - lib/numb/core.rb
 - lib/numb/cototient.rb
 - lib/numb/cube.rb
+- lib/numb/cullen.rb
+- lib/numb/cyclic.rb
 - lib/numb/d.rb
 - lib/numb/decagonal.rb
 - lib/numb/deficient.rb
+- lib/numb/delannoy.rb
+- lib/numb/demlo.rb
 - lib/numb/dihedral_prime.rb
 - lib/numb/dodecagonal.rb
 - lib/numb/doubly_even.rb
@@ -96,6 +101,7 @@ files:
 - lib/numb/fibonacci.rb
 - lib/numb/friendly.rb
 - lib/numb/frugal.rb
+- lib/numb/full_reptend_prime.rb
 - lib/numb/giuga.rb
 - lib/numb/goldbach.rb
 - lib/numb/hamming.rb
@@ -127,6 +133,7 @@ files:
 - lib/numb/minimal.rb
 - lib/numb/mms_pair.rb
 - lib/numb/mobius.rb
+- lib/numb/modulo_order.rb
 - lib/numb/myriagonal.rb
 - lib/numb/n_gonal.rb
 - lib/numb/narcissistic.rb
@@ -155,6 +162,8 @@ files:
 - lib/numb/prime_count.rb
 - lib/numb/prime_signature.rb
 - lib/numb/primitive_pseudoperfect.rb
+- lib/numb/primitive_root.rb
+- lib/numb/primitive_roots.rb
 - lib/numb/primorial.rb
 - lib/numb/pronic.rb
 - lib/numb/properties.rb
@@ -237,15 +246,20 @@ files:
 - spec/numb/centered_cube_spec.rb
 - spec/numb/centered_hexagonal_spec.rb
 - spec/numb/centered_n_gonal_spec.rb
+- spec/numb/centered_pentagonal_spec.rb
 - spec/numb/centered_triangular_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/cullen_spec.rb
+- spec/numb/cyclic_spec.rb
 - spec/numb/d_spec.rb
 - spec/numb/decagonal_spec.rb
 - spec/numb/deficient_spec.rb
+- spec/numb/delannoy_spec.rb
+- spec/numb/demlo_spec.rb
 - spec/numb/digital_sum_spec.rb
 - spec/numb/dihedral_prime_spec.rb
 - spec/numb/divides_spec.rb
@@ -265,6 +279,7 @@ files:
 - spec/numb/fibonacci_spec.rb
 - spec/numb/friendly_spec.rb
 - spec/numb/frugal_spec.rb
+- spec/numb/full_reptend_prime_spec.rb
 - spec/numb/giuga_spec.rb
 - spec/numb/goldbach_spec.rb
 - spec/numb/hamming_spec.rb
@@ -280,6 +295,7 @@ files:
 - spec/numb/idoneal_spec.rb
 - spec/numb/integer_p_spec.rb
 - spec/numb/interprime_spec.rb
+- spec/numb/isqrt_spec.rb
 - spec/numb/jacobsthal_lucas_spec.rb
 - spec/numb/k_perfect_spec.rb
 - spec/numb/kaprekar_spec.rb
@@ -295,6 +311,7 @@ files:
 - spec/numb/mersenne_prime_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/narcissistic_spec.rb
 - spec/numb/nivenmorphic_spec.rb
@@ -323,6 +340,8 @@ files:
 - spec/numb/prime_count_spec.rb
 - spec/numb/prime_signature_spec.rb
 - spec/numb/primitive_pseudoperfect_spec.rb
+- spec/numb/primitive_root_spec.rb
+- spec/numb/primitive_roots_spec.rb
 - spec/numb/primorial_spec.rb
 - spec/numb/pronic_spec.rb
 - spec/numb/proth_spec.rb
@@ -416,10 +435,12 @@ test_files:
 - spec/numb/primitive_pseudoperfect_spec.rb
 - spec/numb/polydivisible_spec.rb
 - spec/numb/strictly_non_palindromic_spec.rb
+- spec/numb/cyclic_spec.rb
 - spec/numb/iban_spec.rb
 - spec/numb/equidigital_spec.rb
 - spec/numb/primorial_spec.rb
 - spec/numb/superabundant_spec.rb
+- spec/numb/modulo_order_spec.rb
 - spec/numb/sociable_spec.rb
 - spec/numb/unitary_perfect_spec.rb
 - spec/numb/nivenmorphic_spec.rb
@@ -447,6 +468,7 @@ test_files:
 - spec/numb/polite_spec.rb
 - spec/numb/unitary_amicable_spec.rb
 - spec/numb/squared_triangular_spec.rb
+- spec/numb/cullen_spec.rb
 - spec/numb/zerofree_spec.rb
 - spec/numb/eban_spec.rb
 - spec/numb/automorphic_spec.rb
@@ -456,6 +478,7 @@ test_files:
 - spec/numb/hyperperfect_spec.rb
 - spec/numb/uban_spec.rb
 - spec/numb/zeisel_spec.rb
+- spec/numb/primitive_roots_spec.rb
 - spec/numb/smooth_spec.rb
 - spec/numb/d_spec.rb
 - spec/numb/heptagonal_spec.rb
@@ -482,6 +505,7 @@ test_files:
 - spec/numb/unusual_spec.rb
 - spec/numb/octagonal_spec.rb
 - spec/numb/unitary_sociable_spec.rb
+- spec/numb/full_reptend_prime_spec.rb
 - spec/numb/vampire_spec.rb
 - spec/numb/dodecagonal_spec.rb
 - spec/numb/dihedral_prime_spec.rb
@@ -512,6 +536,7 @@ test_files:
 - spec/numb/euclid_spec.rb
 - spec/numb/semiprime_spec.rb
 - spec/numb/deficient_spec.rb
+- spec/numb/centered_pentagonal_spec.rb
 - spec/numb/almost_perfect_spec.rb
 - spec/numb/amicable_spec.rb
 - spec/numb/amenable_spec.rb
@@ -525,6 +550,7 @@ test_files:
 - spec/numb/semi_perfect_spec.rb
 - spec/numb/pentagonal_spec.rb
 - spec/numb/blum_spec.rb
+- spec/numb/demlo_spec.rb
 - spec/numb/smarandache_wellin_spec.rb
 - spec/numb/maris_mcgwire_sosa_pair_spec.rb
 - spec/numb/core_spec.rb
@@ -535,9 +561,11 @@ test_files:
 - spec/numb/harshad_spec.rb
 - spec/numb/cube_spec.rb
 - spec/numb/ore_spec.rb
+- spec/numb/delannoy_spec.rb
 - spec/numb/carol_spec.rb
 - spec/numb/powerful_spec.rb
 - spec/numb/prime_count_spec.rb
+- spec/numb/primitive_root_spec.rb
 - spec/numb/weird_spec.rb
 - spec/numb/interprime_spec.rb
 - spec/numb/number_of_distinct_prime_factors_spec.rb
@@ -557,6 +585,7 @@ test_files:
 - spec/numb/decagonal_spec.rb
 - spec/numb/apocalyptic_spec.rb
 - spec/numb/kaprekar_spec.rb
+- spec/numb/isqrt_spec.rb
 - spec/numb/hilbert_spec.rb
 - "spec/numb/st\xC3\xB8rmer_spec.rb"
 - spec/numb/keith_spec.rb