numb 0.77.0 → 0.84.0

data/VERSION

@@ -1 +1 @@
-0.77.0
+0.84.0

data/lib/numb/aliquot_sequence.rb

@@ -0,0 +1,13 @@
+# coding: utf-8
+class Integer
+  def aliquot_sequence(max_iterations=(self > 100 ? 10 : Math.sqrt(self)),
+                       summatory_function=->(n){ n.aliquot_sum })
+    sequence = [self]
+    max_iterations.floor.times do |limit|
+      sequence << summatory_function[sequence.last]
+      break if sequence[0..-2].include?(sequence.last)
+      return sequence << (1/0.0) if limit.succ == max_iterations
+    end
+    sequence
+  end
+end

data/lib/numb/aspiring.rb

@@ -1,16 +1,4 @@
 class Integer
-  def aliquot_sequence(max_iterations=(self > 100 ? 10 : Math.sqrt(self)))
-    sequence = [self]
-    max_iterations.floor.times do |limit|
-      divisors = sequence.last.proper_divisors
-      break if divisors.empty?
-      sequence << divisors.reduce(:+)
-      break if sequence[0..-2].include?(sequence.last)
-      return sequence << (1/0.0) if limit.succ == max_iterations
-    end
-    sequence
-  end
-
   def aspiring?(max_iterations=10)
     return false if perfect? 
     (last = aliquot_sequence(max_iterations).last).to_f.finite? ? 

data/lib/numb/evil.rb

@@ -0,0 +1,5 @@
+class Integer
+  def evil?
+    not odious?
+  end
+end

data/lib/numb/factorial.rb

@@ -3,4 +3,15 @@ class Integer
     return 1 if zero?
     (1..self).reduce(:*)
   end
+
+  def factorial?
+    divisors = self.divisors.sort
+    divisors.each_with_index do |d, i|
+      if divisors[i.succ] == d.succ
+        return true if d.factorial == self
+      else
+        return d.factorial == self
+      end
+    end
+  end
 end

data/lib/numb/odious.rb

@@ -0,0 +1,7 @@
+class Integer
+  def odious?
+    return false unless positive?
+    to_s(2).count('1').odd?
+  end
+end
+

data/lib/numb/sociable.rb

@@ -0,0 +1,6 @@
+class Integer
+  def sociable?(t)
+    return false unless t >= 3
+    aliquot_sequence(t.succ).last == self
+  end
+end

data/lib/numb/sum_of_unitary_divisors.rb

@@ -0,0 +1,5 @@
+class Integer
+  def sum_of_unitary_divisors
+    divisors.select{|d| unitary_divisor?(d)}.reduce(:+) or 0
+  end
+end

data/lib/numb/twin_prime.rb

@@ -0,0 +1,5 @@
+class Integer
+  def twin_prime?(p)
+    [p, self].all?(&:prime?) and p == self + 2
+  end
+end

data/lib/numb/unhappy.rb

@@ -0,0 +1,5 @@
+class Integer
+  def unhappy?
+    not happy?
+  end
+end

data/lib/numb/unitary_amicable.rb

@@ -0,0 +1,7 @@
+class Integer
+  def unitary_amicable?(n)
+    [n + self, sum_of_unitary_divisors].all? do |other|
+      other == n.sum_of_unitary_divisors
+    end
+  end
+end

data/lib/numb/unitary_sociable.rb

@@ -0,0 +1,7 @@
+class Integer
+  def unitary_sociable?(t)
+    return false unless t >= 3
+    seq = aliquot_sequence(t.succ, ->(n){ n.sum_of_unitary_divisors - n})
+    seq.size - 1  == t and seq.last == self
+  end
+end

data/lib/numb.rb

@@ -1,29 +1,5 @@
 # coding: utf-8
 
-libs = %w{abundancy abundant achilles almost_perfect almost_prime amicable
-          apocalyptic aspiring augmented_amicable automorphic balanced_prime 
-          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 
-          jacobsthal_lucas kaprekar keith knodel k_perfect kynea 
-          leonardo leyland lucas lucas_carmichael mersenne_prime minimal 
-          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 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 wieferich woodall zeisel zerofree
-}
-
 class Integer
   def number_of_distinct_prime_factors
     prime_factors.uniq.size
@@ -62,6 +38,11 @@ class Integer
   end
   alias :σ :sum_of_divisors
 
+  def aliquot_sum
+    return 0 if zero?
+    σ - self
+  end
+
   def digital_root
     self == 0 ? 0 : 1 + ((self - 1) % 9)
   end
@@ -83,6 +64,4 @@ end
 
 require 'prime'
 
-libs.each do |predicate|
-  require File.join(File.dirname(__FILE__), "numb/#{predicate}")
-end
+Dir.glob(File.dirname(__FILE__) + '/numb/*.rb').each {|file| require file}

data/spec/evil_spec.rb

@@ -0,0 +1,20 @@
+describe Integer, "#evil?" do
+  # A001969
+  @seq = [0,3,5,6,9,10,12,15,17,18,20,23,24,27,29,30,33,34,
+          36,39,40,43,45,46,48,51,53,54,57,58,60,63,65,66,
+          68,71,72,75,77,78,80,83,85,86,89,90,92,95,96,99,
+          101,102,105,106,108,111,113,114,116,119,120,123,
+          125,126,129].to_seq
+
+  @seq.each do |n|
+    it "should return true for evil number #{n}" do
+      n.should be_evil
+    end
+  end
+
+  @seq.invert.each do |n|
+    it "should return false for non-evil number #{n}" do
+      n.should_not be_evil
+    end
+  end
+end

data/spec/factorial_spec.rb

@@ -12,3 +12,24 @@ describe Integer, "#factorial" do
     end
   end
 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|
+    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|
+    it "should return false for non-factorial #{n}" do
+      n.should_not be_factorial
+    end
+  end
+end

data/spec/odious_spec.rb

@@ -0,0 +1,19 @@
+describe Integer, "#odious?" do
+  @seq = [1,2,4,7,8,11,13,14,16,19,21,22,25,26,28,31,32,35,
+          37,38,41,42,44,47,49,50,52,55,56,59,61,62,64,67,
+          69,70,73,74,76,79,81,82,84,87,88,91,93,94,97,98,
+          100,103,104,107,109,110,112,115,117,118,121,122,
+          124,127,128].to_seq
+
+  @seq.each do |n|
+    it "returns true for odious number #{n}" do
+      n.should be_odious
+    end
+  end
+
+  @seq.invert.each do |n|
+    it "returns false for non-odious number #{n}" do
+      n.should_not be_odious
+    end
+  end
+end

data/spec/sociable_spec.rb

@@ -0,0 +1,57 @@
+describe Integer, "#sociable?" do
+  # A090615
+  @seq = {
+    4 => [1264460,2115324,2784580,4938136,7169104,18048976,
+          18656380,28158165,46722700,81128632,174277820,
+          209524210,330003580,498215416,1236402232,
+          1799281330,2387776550,2717495235,2879697304,
+          3705771825,4424606020],
+    5 => [12496],
+    # A119478
+    6 => [21548919483,90632826380,1771417411016,
+          3524434872392,4773123705616],
+    8 => [1095447416, 1276254780],
+    9 => [805984760],
+    28 =>[14316],
+  }
+
+  # A000396
+  @perfect = [6,28,496,8128,33550336,8589869056,137438691328,
+              2305843008139952128,
+              2658455991569831744654692615953842176,
+              191561942608236107294793378084303638130997321548169216].first(4)
+  
+  @perfect.sample(2).each do |n|
+    it "should return false for 1-sociable (perfect) number #{n}" do
+      n.sociable?(1).should be_false
+    end
+  end
+
+  # A063990
+  @amicable = [220,284,1184,1210,2620,2924,5020,5564,6232,6368,
+               10744,10856,12285,14595,17296,18416,63020,66928,
+               66992,67095,69615,71145,76084,79750,87633,88730,
+               100485,122265,122368,123152,124155,139815,141664,
+               142310]
+
+  @amicable.sample(2).each do |n|
+    it "should return false for 2-sociable (amicable) number #{n}" do
+      n.sociable?(2).should be_false
+    end
+  end
+
+  @seq.each do |t, members|
+    next if t >= 6 # Too slow :-(
+    members.sample(2).each do |n|
+      it "should return true for #{t}-sociable number #{n}" do
+        n.sociable?(t).should be_true
+      end
+    end
+
+    members.to_seq.invert.sample(2).each do |n|
+      it "should return false for non-#{t}-sociable number #{n}" do
+        n.sociable?(t).should be_false
+      end
+    end
+  end
+end

data/spec/spec_helper.rb

@@ -10,7 +10,10 @@ class Seq
   include Enumerable
   attr_accessor :exclude, :include
   def initialize(*args)
-    @include = args.first?
+    @include = args
+    if @include.size == 1 and @include.first.is_a?(Enumerable)
+      @include = @include.first
+    end
     @exclude = []
   end
 
@@ -22,6 +25,7 @@ class Seq
   end
 
   def invert
+    return [] if @include.size < 2
     Seq.new(self.begin..self.end).tap{|s| s.exclude = @include }
   end
 

data/spec/sum_of_unitary_divisors_spec.rb

@@ -0,0 +1,14 @@
+describe Integer, "#sum_of_unitary_divisors" do
+  # A034448
+  @seq = [1,3,4,5,6,12,8,9,10,18,12,20,14,24,24,17,18,30,
+          20,30,32,36,24,36,26,42,28,40,30,72,32,33,48,54,
+          48,50,38,60,56,54,42,96,44,60,60,72,48,68,50,78,
+          72,70,54,84,72,72,80,90,60,120,62,96,80,65,84,144,
+          68,90,96,144]
+
+  @seq.to_enum.with_index(1).each do |sum, n|
+    it "should return #{sum} for #{n}" do
+      n.sum_of_unitary_divisors.should == sum
+    end
+  end
+end

data/spec/twin_prime_spec.rb

@@ -0,0 +1,31 @@
+describe Integer, "#twin_prime?" do
+  # A001359, A006512
+  @seq = [3,5,11,17,29,41,59,71,101,107,137,149,179,191,
+          197,227,239,269,281,311,347,419,431,461,521,569,
+          599,617,641,659,809,821,827,857,881,1019,1031,
+          1049,1061,1091,1151,1229,1277,1289,1301,1319,1427,
+          1451,1481,1487,1607].zip(
+         [5,7,13,19,31,43,61,73,103,109,139,151,181,193,
+          199,229,241,271,283,313,349,421,433,463,523,571,
+          601,619,643,661,811,823,829,859,883,1021,1033,
+          1051,1063,1093,1153,1231,1279,1291,1303,1321,1429,
+          1453,1483,1489,1609])
+
+  @seq.each do |p, q|
+    it "should return true for twin-primes #{p} and #{q}" do
+      p.twin_prime?(q).should be_true
+    end
+  end
+
+  it "returns false for two primes which are not twin" do
+    2.twin_prime?(29).should be_false
+  end
+
+  it "returns false for a prime and a composite" do
+    17.twin_prime?(20).should be_false
+  end
+
+  it "returns false for two composites with a difference of two" do
+    20.twin_prime?(22).should be_false
+  end
+end

data/spec/unhappy_spec.rb

@@ -0,0 +1,20 @@
+describe Integer, "#unhappy?" do
+  # A031177
+  @seq = [2,3,4,5,6,8,9,11,12,14,15,16,17,18,20,21,22,24,
+          25,26,27,29,30,33,34,35,36,37,38,39,40,41,42,43,
+          45,46,47,48,50,51,52,53,54,55,56,57,58,59,60,61,
+          62,63,64,65,66,67,69,71,72,73,74,75,76,77,78,80,
+          81,83].to_seq
+
+  @seq.each do |n|
+    it "should return true for unhappy number #{n}" do
+      n.should be_unhappy
+    end
+  end
+
+  @seq.invert.each do |n|
+    it "should return false for happy number #{n}" do
+      n.should_not be_unhappy
+    end
+  end
+end

data/spec/unitary_amicable_spec.rb

@@ -0,0 +1,28 @@
+describe Integer, "#unitary_amicable?" do
+  # A002952, A002953
+  @seq = [114,1140,18018,32130,44772,56430,67158,142310,
+          180180,197340,241110,296010,308220,462330,591030,
+          669900,671580,785148,815100,1004850,1077890,
+          1080150,1156870,1177722,1222650,1281540,1475810,
+          1511930,1571388].zip(
+         [126,1260,22302,40446,49308,64530,73962,168730,
+          223020,286500,242730,429750,365700,548550,618570,
+          827700,739620,827652,932100,1241550,1099390,
+          1291050,1292570,1241478,1398150,1621500,1669150,
+          1598470,1654212])
+
+  @seq.each do |m, n|
+    it "should return true for unitary amicable pair (#{m},#{n})" do
+      m.unitary_amicable?(n).should be_true
+    end
+
+    it "should return true for unitary amicable pair (#{n},#{m})" do
+      n.unitary_amicable?(m).should be_true
+    end
+  
+    o, p = n+m, @seq.reject{|pair| pair == [n, m]}.sample.last
+    it "should return false for non-unitary amicable pair (#{o},#{p})" do
+      o.unitary_amicable?(p).should_not be_true
+    end
+  end
+end

data/spec/unitary_sociable.rb

@@ -0,0 +1,30 @@
+describe Integer, "#unitary_sociable?" do
+  # A000173
+  @seq = {
+    3  => [30],
+    4  => [263820, 395730, 172459210, 209524210, 384121920, 1799281330, 
+           2069510520, 2514290520],
+    5  => [1482],
+    6  => [698130, 341354790, 530946330, 582129630],
+    14 => [2418, 24180, 35238],
+    65 => [473298],
+    25 => [763620],
+    39 => [2212026],
+    26 => [2233554],
+    10 => [525150234, 5251502340],
+    12 => [3344596854]
+  }
+
+  (3..5).map{|_| [_, @seq[_]]}.each do |t, members|
+    members.sample(1).each do |n|
+      it "should return true for #{t}-unitary-sociable number #{n}" do
+        n.unitary_sociable?(t).should be_true
+      end
+
+      m = n - 2
+      it "should return false for non-#{t}-unitary-sociable number #{m}" do
+        m.unitary_sociable?(t).should be_false
+      end
+    end
+  end
+end

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification 
 name: numb
 version: !ruby/object:Gem::Version 
-  version: 0.77.0
+  version: 0.84.0
 platform: ruby
 authors: 
 - Run Paint Run Run
@@ -9,7 +9,7 @@ autorequire:
 bindir: bin
 cert_chain: []
 
-date: 2010-01-21 00:00:00 +00:00
+date: 2010-02-13 00:00:00 +00:00
 default_executable: 
 dependencies: 
 - !ruby/object:Gem::Dependency 
@@ -42,6 +42,7 @@ files:
 - lib/numb/abundancy.rb
 - lib/numb/abundant.rb
 - lib/numb/achilles.rb
+- lib/numb/aliquot_sequence.rb
 - lib/numb/almost_perfect.rb
 - lib/numb/almost_prime.rb
 - lib/numb/amicable.rb
@@ -74,6 +75,7 @@ files:
 - lib/numb/economical.rb
 - lib/numb/emrip.rb
 - lib/numb/equidigital.rb
+- lib/numb/evil.rb
 - lib/numb/extravagant.rb
 - lib/numb/factorial.rb
 - lib/numb/factorion.rb
@@ -116,6 +118,7 @@ files:
 - lib/numb/nth_prime.rb
 - lib/numb/number_of_divisors.rb
 - lib/numb/octagonal.rb
+- lib/numb/odious.rb
 - lib/numb/ordinal.rb
 - lib/numb/ore.rb
 - lib/numb/parasitic.rb
@@ -146,20 +149,26 @@ files:
 - lib/numb/smarandache_wellin.rb
 - lib/numb/smith.rb
 - lib/numb/smooth.rb
+- lib/numb/sociable.rb
 - lib/numb/sophie_germain_prime.rb
 - lib/numb/sphenic.rb
 - lib/numb/square.rb
 - lib/numb/square_free.rb
 - lib/numb/sublime.rb
 - lib/numb/sum_of_squares.rb
+- lib/numb/sum_of_unitary_divisors.rb
 - lib/numb/superabundant.rb
 - lib/numb/superperfect.rb
 - lib/numb/totient.rb
 - lib/numb/triangular.rb
 - lib/numb/trimorphic.rb
+- lib/numb/twin_prime.rb
 - lib/numb/undulating.rb
+- lib/numb/unhappy.rb
+- lib/numb/unitary_amicable.rb
 - lib/numb/unitary_divisor.rb
 - lib/numb/unitary_perfect.rb
+- lib/numb/unitary_sociable.rb
 - lib/numb/untouchable.rb
 - lib/numb/vampire.rb
 - lib/numb/weird.rb
@@ -204,6 +213,7 @@ files:
 - spec/economical_spec.rb
 - spec/emrip_spec.rb
 - spec/equidigital_spec.rb
+- spec/evil_spec.rb
 - spec/extravagant_spec.rb
 - spec/factorial_spec.rb
 - spec/factorion_spec.rb
@@ -244,6 +254,7 @@ files:
 - spec/number_of_distinct_prime_factors_spec.rb
 - spec/number_of_prime_factors_spec.rb
 - spec/octagonal_spec.rb
+- spec/odious_spec.rb
 - spec/ordinal_spec.rb
 - spec/ore_spec.rb
 - spec/parasitic_spec.rb
@@ -275,6 +286,7 @@ files:
 - spec/smarandache_wellin_spec.rb
 - spec/smith_spec.rb
 - spec/smooth_spec.rb
+- spec/sociable_spec.rb
 - spec/sophie_germain_prime_spec.rb
 - spec/spec_helper.rb
 - spec/sphenic_spec.rb
@@ -282,14 +294,19 @@ files:
 - spec/square_spec.rb
 - spec/sublime_spec.rb
 - spec/sum_of_squares.rb
+- spec/sum_of_unitary_divisors_spec.rb
 - spec/superabundant_spec.rb
 - spec/superperfect_spec.rb
 - spec/totient_spec.rb
 - spec/triangular_spec.rb
 - spec/trimorphic_spec.rb
+- spec/twin_prime_spec.rb
 - spec/undulating_spec.rb
+- spec/unhappy_spec.rb
+- spec/unitary_amicable_spec.rb
 - spec/unitary_divisor_spec.rb
 - spec/unitary_perfect.rb
+- spec/unitary_sociable.rb
 - spec/untouchable_spec.rb
 - spec/vampire_spec.rb
 - spec/weird_spec.rb
@@ -340,6 +357,7 @@ test_files:
 - spec/equidigital_spec.rb
 - spec/primorial_spec.rb
 - spec/superabundant_spec.rb
+- spec/sociable_spec.rb
 - spec/nivenmorphic_spec.rb
 - spec/dudeney_spec.rb
 - spec/centered_triangular_spec.rb
@@ -361,6 +379,7 @@ test_files:
 - spec/woodall_spec.rb
 - spec/abundancy_spec.rb
 - spec/polite_spec.rb
+- spec/unitary_amicable_spec.rb
 - spec/zerofree_spec.rb
 - spec/automorphic_spec.rb
 - spec/minimal_spec.rb
@@ -370,6 +389,7 @@ test_files:
 - spec/zeisel_spec.rb
 - spec/smooth_spec.rb
 - spec/d_spec.rb
+- spec/unitary_sociable.rb
 - spec/spec_helper.rb
 - spec/heptagonal_spec.rb
 - spec/kynea_spec.rb
@@ -391,6 +411,7 @@ test_files:
 - spec/breeder_spec.rb
 - spec/sphenic_spec.rb
 - spec/idoneal_spec.rb
+- spec/sum_of_unitary_divisors_spec.rb
 - spec/lucas_carmichael_spec.rb
 - spec/rhonda_spec.rb
 - spec/totient_spec.rb
@@ -406,11 +427,13 @@ test_files:
 - spec/highly_composite_spec.rb
 - spec/frugal_spec.rb
 - spec/divides_spec.rb
+- spec/odious_spec.rb
 - spec/semiprime_spec.rb
 - spec/deficient_spec.rb
 - spec/almost_perfect_spec.rb
 - spec/amicable_spec.rb
 - spec/happy_spec.rb
+- spec/twin_prime_spec.rb
 - spec/hexagonal_spec.rb
 - spec/wieferich_prime_spec.rb
 - spec/fibonacci_spec.rb
@@ -423,6 +446,7 @@ test_files:
 - spec/core_spec.rb
 - spec/lucas_spec.rb
 - spec/trimorphic_spec.rb
+- spec/evil_spec.rb
 - spec/harshad_spec.rb
 - spec/cube_spec.rb
 - spec/ore_spec.rb
@@ -456,3 +480,4 @@ test_files:
 - spec/aspiring_spec.rb
 - spec/mobius_spec.rb
 - spec/positive_spec.rb
+- spec/unhappy_spec.rb