numb 0.72.1 → 0.77.0

data/.gitignore

@@ -3,3 +3,4 @@
 coverage
 doc
 pkg
+.yardoc

data/VERSION

@@ -1 +1 @@
-0.72.1
+0.77.0

data/lib/numb/abundant.rb

@@ -12,7 +12,7 @@ class Integer
   #     345.abundant?  #=> false
   #
   def abundant?
-    return false unless self > 0
+    return false unless positive?
     σ > (2 * self)
   end
 

data/lib/numb/aspiring.rb

@@ -1,8 +1,7 @@
 class Integer
-  def aliquot_sequence
+  def aliquot_sequence(max_iterations=(self > 100 ? 10 : Math.sqrt(self)))
     sequence = [self]
-    max_iterations = Math.sqrt(self).floor
-    max_iterations.times do |limit|
+    max_iterations.floor.times do |limit|
       divisors = sequence.last.proper_divisors
       break if divisors.empty?
       sequence << divisors.reduce(:+)
@@ -12,8 +11,10 @@ class Integer
     sequence
   end
 
-  def aspiring?
+  def aspiring?(max_iterations=10)
     return false if perfect? 
-    (last = aliquot_sequence.last).to_f.finite? ? last.perfect? : false
+    (last = aliquot_sequence(max_iterations).last).to_f.finite? ? 
+      last.perfect? : 
+      false
   end
 end

data/lib/numb/base.rb

@@ -0,0 +1,37 @@
+class Integer
+  BASE = {
+          binary:          2, ternary:       3, quaternary:     4,
+          quinary:         5, senary:        6, septenary:      7, 
+          octal:           8, nonary:        9, decimal:       10, 
+          undecimal:      11, duodecimal:   12, tridecimal:    13,
+          tetradecimal:   14, pentadecimal: 15, hexadecimal:   16,
+          septendecimal:  17, decennoctal:  18, decennoval:    19,
+          vigesimal:      20, trigesimal:   30, quadragesimal: 40,
+          quinquagesimal: 50, sexagesimal:  60, septuagesimal: 70,
+          octagesimal:    80, nonagesimal:  90, centesimal:   100,
+          millesimal:  1_000
+  }
+
+  def base(base=nil)
+    return Hash[BASE.values.map{|b| [b, base(b)]}] unless base
+    return '0' if zero?
+    base = case base
+             when Numeric        then base.to_int
+             when String, Symbol then BASE[base.downcase.to_sym]
+             else                     nil
+           end
+    raise ArgumentError unless base and base > 1
+    begin
+      to_s(base)
+    rescue ArgumentError
+      chars = [*(0..9)] + [*('a'..'z')]
+      (base - chars.size).times { chars.push(chars.last.succ) }
+      n, digits = self, []
+      until n.zero?
+        n, remainder = n.divmod(base)
+        digits << chars[remainder]
+      end
+      digits.reverse.join
+    end
+  end
+end

data/lib/numb/deficient.rb

@@ -11,7 +11,7 @@ class Integer
   #     6.deficient?  #=> false
   #
   def deficient?
-    return false unless self > 0
+    return false unless positive?
     σ < (2 * self)
   end
 

data/lib/numb/happy.rb

@@ -1,7 +1,7 @@
 # coding: utf-8
 class Integer
   def happy?
-    return false unless self > 0
+    return false unless positive?
     n = self
     sad = '4 16 37 58 89 145 42 20'
     seq = ""

data/lib/numb/hilbert.rb

@@ -1,7 +1,7 @@
 # coding: utf-8
 class Integer
   def hilbert?
-    return false unless self > 0
+    return false unless positive?
     ((self - 1) % 4) == 0
   end
 end

data/lib/numb/nivenmorphic.rb

@@ -2,7 +2,7 @@
 class Integer
   def nivenmorphic?
     return true if self == 0
-    return false unless self > 0
+    return false unless positive?
     niven? && self.to_s.end_with?(digital_sum.to_s)
   end
   alias :harshadmorphic? :nivenmorphic?

data/lib/numb/parasitic.rb

@@ -4,7 +4,7 @@ class Integer
     return (1..9).any?{|x| parasitic?(x)} if n.nil?
     return true if (n == 1 && self == 1)
     return false unless self > 9
-    raise ArgumentError unless (n > 0 && n < 10)
+    raise ArgumentError unless (n.positive? && n < 10)
     (n*self) == [digits.last, digits[0..-2]].join.to_i
   end
 end

data/lib/numb/perfect_power.rb

@@ -1,7 +1,7 @@
 # coding: utf-8
 class Integer
   def perfect_power?
-    return false unless self > 0
+    return false unless positive?
     return true if self == 1
     divisors = self.divisors
     (2..Math.log2(self)).any? { |pow| divisors.any? {|div| (div ** pow) == self} } 

data/lib/numb/polite.rb

@@ -2,6 +2,6 @@
 class Integer
   def polite? 
     return true if self == 1
-    politeness > 0
+    politeness.positive?
   end
 end

data/lib/numb/positive.rb

@@ -0,0 +1,5 @@
+class Integer
+  def positive?
+    self > 0
+  end
+end

data/lib/numb/powerful.rb

@@ -1,7 +1,7 @@
 # coding: utf-8
 class Integer
   def powerful?
-    return false unless self > 0
+    return false unless positive?
     divisors = self.divisors
     divisors.select {|d| d.prime? }.all?{|prime| divisors.include? (prime ** 2)}
   end

data/lib/numb/pronic.rb

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

data/lib/numb/weird.rb

@@ -1,7 +1,7 @@
 # coding: utf-8
 class Integer
   def weird?
-    return false unless self > 0
+    return false unless positive?
     return false if odd? && self < (10 ** 17)
     not semiperfect? and abundant?
   end

data/lib/numb/wieferich.rb

@@ -0,0 +1,6 @@
+class Integer
+  def wieferich_prime?
+    return false unless prime?
+    (2**(self - 1)).modulo(self ** 2) == 1
+  end
+end

data/lib/numb/woodall.rb

@@ -0,0 +1,7 @@
+class Integer
+  def woodall?
+    x = succ
+    divisors = x.square? ? x.divisors[0..-2] : x.divisors
+    divisors.each_slice(2).any?{|a, b| a == Math.log2(b)}
+  end
+end

data/lib/numb/zerofree.rb

@@ -0,0 +1,5 @@
+class Integer
+  def zerofree?
+    not to_s.include?('0')
+  end
+end

data/lib/numb.rb

@@ -2,10 +2,10 @@
 
 libs = %w{abundancy abundant achilles almost_perfect almost_prime amicable
           apocalyptic aspiring augmented_amicable automorphic balanced_prime 
-          binomial biquadratic breeder brown carmichael carol centered_n_gonal 
-          centered_triangular congruum composite coprime core cototient 
-          cube d decagonal deficient dodecagonal dihedral_prime dudeney 
-          economical emrip equidigital extravagant factorial factorion 
+          base binomial biquadratic breeder brown carmichael carol 
+          centered_n_gonal centered_triangular congruum composite coprime 
+          core cototient cube d decagonal deficient dodecagonal dihedral_prime
+          dudeney economical emrip equidigital extravagant factorial factorion 
           fermat_pseudoprime fibonacci friendly frugal happy harshad 
           heptagonal hexagonal highly_composite highly_abundant hilbert 
           hyperperfect idoneal impolite integer_p interprime 
@@ -14,14 +14,14 @@ libs = %w{abundancy abundant achilles almost_perfect almost_prime amicable
           mms_pair mobius myriagonal narcissistic next_prev_prime n_gonal 
           nivenmorphic noncototient nth_prime number_of_divisors octagonal 
           ordinal ore parasitic pentagonal perfect perfect_power polite 
-          polydivisible poulet powerful practical prime_count prime_signature 
-          primitive_pseudoperfect primorial pronic proth quarticfree 
-          refactorable repunit rhonda rough self self_descriptive 
+          polydivisible positive poulet powerful practical prime_count 
+          prime_signature primitive_pseudoperfect primorial pronic proth 
+          quarticfree refactorable repunit rhonda rough self self_descriptive 
           semiperfect semiprime smarandache_wellin smith smooth 
           sophie_germain_prime sphenic square square_free sublime 
           sum_of_squares superabundant superperfect totient triangular 
           trimorphic undulating unitary_perfect unitary_divisor untouchable
-          vampire weird zeisel
+          vampire weird wieferich woodall zeisel zerofree
 }
 
 class Integer
@@ -51,11 +51,10 @@ class Integer
   end
 
   def divisors
-    return @divisors if defined?(@divisors)
-    return [] unless self >= 0
+    return [] unless positive?
     return [1, self] if prime?
-    @divisors = (1..Math.sqrt(self).floor).select { |n| (self % n).zero? }.
-                                           map {|n| [n, self/n]}.flatten.uniq
+    (1..Math.sqrt(self).floor).select { |n| (self % n).zero? }.
+                               map {|n| [n, self/n]}.flatten.uniq
   end
 
   def sum_of_divisors

data/spec/base_spec.rb

@@ -0,0 +1,51 @@
+describe Integer, "#base" do
+  @base = {
+          binary:          2, ternary:       3, quaternary:     4,
+          quinary:         5, senary:        6, septenary:      7, 
+          octal:           8, nonary:        9, decimal:       10, 
+          undecimal:      11, duodecimal:   12, tridecimal:    13,
+          tetradecimal:   14, pentadecimal: 15, hexadecimal:   16,
+          septendecimal:  17, decennoctal:  18, decennoval:    19,
+          vigesimal:      20, trigesimal:   30, quadragesimal: 40,
+          quinquagesimal: 50, sexagesimal:  60, septuagesimal: 70,
+          octagesimal:    80, nonagesimal:  90, centesimal:   100,
+          millesimal:  1_000
+  }
+
+  @base.each do |base_name, base|
+    break if base > 36
+    (0..100).to_a.sample(10).each do |n|
+      converted = n.to_s(base)
+      it "should return #{converted} for #{n} in base #{base}" do
+        n.base(base).should == converted
+      end
+
+      it "should return #{converted} for #{n} in #{base_name}" do
+        n.base(base_name).should == converted
+      end
+    end
+  end
+
+  it "should raise ArgumentError for base 1" do
+    ->{ 2.base(1) }.should raise_error(ArgumentError)
+  end
+
+  [
+    [3, 100, '3'], [0, 77, '0'], [20, 60, 'k'], [1234, 100, 'cy']
+  ].each do |n, base, r|
+    it "should return #{r} for #{n} in base #{base}" do
+      n.base(base).should == r
+    end
+  end
+
+  it "should return a Hash of bases to values when given no argument" do
+    19.base.should == {
+      2  => "10011",    3 => "201",     4 => "103",  5 => "34",  6 => "31", 
+      7  =>    "25",    8 =>  "23",     9 =>  "21", 10 => "19", 11 => "18", 
+      12 =>    "17",   13 =>  "16",    14 =>  "15", 15 => "14", 16 => "13",
+      17 =>    "12",   18 =>  "11",    19 =>  "10", 20 =>  "j", 30 =>  "j", 
+      40 =>     "j",   50 =>   "j",    60 =>    "j",70 =>  "j", 80 =>  "j", 
+      90 =>     "j",  100 =>   "j",  1000 =>    "j"
+    }
+  end
+end

data/spec/positive_spec.rb

@@ -0,0 +1,17 @@
+describe Integer, "#positive?" do
+  [1, 2897, 4728, 10].each do |n|
+    it "returns true for positive number #{n}" do
+      n.should be_positive
+    end
+  end
+
+  it "returns false for 0" do
+    0.should_not be_positive
+  end
+
+  [-1, -338, -38302, -10].each do |n|
+    it "returns false for negative number #{n}" do
+      n.should_not be_positive
+    end
+  end
+end

data/spec/semi_perfect_spec.rb

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

data/spec/wieferich_prime_spec.rb

@@ -0,0 +1,17 @@
+describe Integer, "#wieferich_prime?" do
+  # A001220
+  @seq = [1093, 3511]
+
+  @seq.each do |n|
+    it "should return true for Wieferich-prime #{n}" do
+      n.should be_wieferich_prime
+    end
+  end
+
+  @seq.to_seq.invert.sample(10).each do |n|
+    it "should return false for non-Wieferich-prime #{n}" do
+      n.should_not be_wieferich_prime
+    end
+  end
+end
+

data/spec/woodall_spec.rb

@@ -0,0 +1,20 @@
+describe Integer, "#woodall?" do
+  # A003261
+  @seq = [1,7,23,63,159,383,895,2047,4607,10239,22527,
+          49151,106495,229375,491519,1048575,2228223,
+          4718591,9961471,20971519,44040191,92274687,
+          192937983,402653183,838860799,1744830463,
+          3623878655,7516192767].to_seq
+
+  @seq.sample(5).each do |n|
+    it "should return true for Woodall number #{n}" do
+      n.should be_woodall
+    end
+  end
+
+  @seq.invert.sample(5).each do |n|
+    it "should return false for non-Woodall number #{n}" do
+      n.should_not be_woodall
+    end
+  end
+end

data/spec/zerofree_spec.rb

@@ -0,0 +1,28 @@
+describe Integer, "#zerofree?" do
+  @seq = {
+    # A052382
+    A052382: [1,2,3,4,5,6,7,8,9,11,12,13,14,15,16,17,18,19,21,
+               22,23,24,25,26,27,28,29,31,32,33,34,35,36,37,38,
+               39,41,42,43,44,45,46,47,48,49,51,52,53,54,55,56,
+               57,58,59,61,62,63,64,65,66,67,68,69,71,72,73,74,
+               75,76,77,78,79,81,82,83,84,85,86,87,88,89,91,92,
+               93,94,95,96,97,98,99,111,112,113,114],
+    A038618: [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,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,277,
+               281,283,293]
+  }
+
+  @seq.values.flatten.uniq.each do |n|
+    it "should return true for zerofree number #{n}" do
+      n.should be_zerofree
+    end
+  end
+
+  (@seq[:A052382].to_seq.invert.to_a << 0).each do |n|
+    it "should return false for non-zerofree number #{n}" do
+      n.should_not be_zerofree
+    end
+  end
+end

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification 
 name: numb
 version: !ruby/object:Gem::Version 
-  version: 0.72.1
+  version: 0.77.0
 platform: ruby
 authors: 
 - Run Paint Run Run
@@ -9,7 +9,7 @@ autorequire:
 bindir: bin
 cert_chain: []
 
-date: 2010-01-17 00:00:00 +00:00
+date: 2010-01-21 00:00:00 +00:00
 default_executable: 
 dependencies: 
 - !ruby/object:Gem::Dependency 
@@ -50,6 +50,7 @@ files:
 - lib/numb/augmented_amicable.rb
 - lib/numb/automorphic.rb
 - lib/numb/balanced_prime.rb
+- lib/numb/base.rb
 - lib/numb/binomial.rb
 - lib/numb/biquadratic.rb
 - lib/numb/breeder.rb
@@ -123,6 +124,7 @@ files:
 - lib/numb/perfect_power.rb
 - lib/numb/polite.rb
 - lib/numb/polydivisible.rb
+- lib/numb/positive.rb
 - lib/numb/poulet.rb
 - lib/numb/powerful.rb
 - lib/numb/practical.rb
@@ -161,7 +163,10 @@ files:
 - lib/numb/untouchable.rb
 - lib/numb/vampire.rb
 - lib/numb/weird.rb
+- lib/numb/wieferich.rb
+- lib/numb/woodall.rb
 - lib/numb/zeisel.rb
+- lib/numb/zerofree.rb
 - spec/01_spec.rb
 - spec/abundancy_spec.rb
 - spec/abundant_spec.rb
@@ -174,6 +179,7 @@ files:
 - spec/augmented_amicable_spec.rb
 - spec/automorphic_spec.rb
 - spec/balanced_prime_spec.rb
+- spec/base_spec.rb
 - spec/binomial_spec.rb
 - spec/biquadratic_spec.rb
 - spec/breeder_spec.rb
@@ -247,6 +253,7 @@ files:
 - spec/polite_spec.rb
 - spec/politeness_spec.rb
 - spec/polydivisible_spec.rb
+- spec/positive_spec.rb
 - spec/poulet_spec.rb
 - spec/powerful_spec.rb
 - spec/practical_spec.rb
@@ -286,7 +293,10 @@ files:
 - spec/untouchable_spec.rb
 - spec/vampire_spec.rb
 - spec/weird_spec.rb
+- spec/wieferich_prime_spec.rb
+- spec/woodall_spec.rb
 - spec/zeisel_spec.rb
+- spec/zerofree_spec.rb
 has_rdoc: yard
 homepage: http://github.com/runpaint/numb
 licenses: []
@@ -319,6 +329,7 @@ test_files:
 - spec/01_spec.rb
 - spec/leonardo_spec.rb
 - spec/economical_spec.rb
+- spec/base_spec.rb
 - spec/unitary_perfect.rb
 - spec/proth_spec.rb
 - spec/prime_signature_spec.rb
@@ -347,8 +358,10 @@ test_files:
 - spec/perfect_power_spec.rb
 - spec/factorial_spec.rb
 - spec/carmichael_spec.rb
+- spec/woodall_spec.rb
 - spec/abundancy_spec.rb
 - spec/polite_spec.rb
+- spec/zerofree_spec.rb
 - spec/automorphic_spec.rb
 - spec/minimal_spec.rb
 - spec/jacobsthal_lucas_spec.rb
@@ -399,6 +412,7 @@ test_files:
 - spec/amicable_spec.rb
 - spec/happy_spec.rb
 - spec/hexagonal_spec.rb
+- spec/wieferich_prime_spec.rb
 - spec/fibonacci_spec.rb
 - spec/triangular_spec.rb
 - spec/integer_p_spec.rb
@@ -441,3 +455,4 @@ test_files:
 - spec/noncototient_spec.rb
 - spec/aspiring_spec.rb
 - spec/mobius_spec.rb
+- spec/positive_spec.rb