numb 0.138.0 → 0.152.0

data/VERSION

@@ -1 +1 @@
-0.138.0
+0.152.0

data/lib/numb/abundancy.rb

@@ -3,4 +3,6 @@ class Integer
   def abundancy
     Rational(σ, self)
   end
+
+  memoize :abundancy
 end

data/lib/numb/achain.rb

@@ -0,0 +1,99 @@
+# coding: utf-8
+module AChain
+  def self.sequence(*terms)
+    chain, perms = ([1] + terms), {}
+    possible =->(term) do
+      return true if perms.values.include?(term)
+      options = chain.uniq.select{|perm| perm < term}
+      (options * 2).permutation(2).to_a.uniq.any? do |perm|
+        (perms[perm] ||= perm.reduce(:+)) == term
+      end
+    end
+    loop do
+      catch(:restart) do
+        (chain = chain.sort.reverse).each_with_index do |term, i|
+          return chain.sort.uniq if term == 1
+          next if possible[term]
+          chain << if term >= (chain[i.succ] * 3)
+            term.even? ? term / 2 : term - 1
+          else
+            term - chain[i.succ]
+          end
+          throw :restart
+        end
+      end
+    end
+  end
+
+  def self.factor(n)
+    build_tree = ->(n) do
+      return if n == 1
+      p = n.prime_factors.first
+      q = n/p
+      q, p = p - 1, 1 if p == n
+      {left: q, value: n, right: p}.tap do |node|
+        node[:right] = build_tree[p] if p > 1
+        node[:left] = build_tree[q] if q > 1
+      end
+    end
+
+    current, chain = (t = build_tree[root = n]), [x = 1]
+
+    make_chain =->(node) do
+      [:right, :left].each do |dir|
+        if node[dir] == 2 then chain << x *= 2
+        elsif node[dir] and node[dir] != 1
+          x = make_chain[node[dir]]
+        end
+        node[:x] = x if dir == :right
+      end
+
+      if node[:value] == root and node[:right] == 1
+        if r = node[:right]
+          x += r.respond_to?(:fetch) ? r[:x] || 0 : r
+        end
+        chain << x
+      elsif node[:value] != root and node[:right] == 1
+        x += node[:x] if node.respond_to?(:fetch) and node[:x]
+        node.delete(:x)
+        chain << x
+      end
+      x
+    end
+    make_chain[t]
+    chain
+  end
+
+  def self.window_brute(n)
+    (1..n.to_s(2).count('1')).map {|w| window(n,w)}.min_by(&:size)
+  end
+
+  def self.window(n,w=3)
+    n = [*n.base(2).chars].map(&:to_i)
+    windows, zeroes = [[]], []
+    n.each do |bit|
+      if bit.zero? then zeroes << bit
+      elsif (zeroes.size + 1 + windows.last.size) > w
+        windows << zeroes.pop(zeroes.size) << [1]
+      else windows[-1] += zeroes.pop(zeroes.size) << 1
+      end
+    end
+    windows << zeroes unless zeroes.empty?
+    windows.map!{|w| [w, w.join.to_i(2).to_i]}
+
+    x = windows.first.last
+    self.sequence(*windows.map(&:last).reject(&:zero?).uniq).tap do |chain|
+      windows[1..-1].each do |bits, value|
+        bits.each {|bit| chain << x *= 2}
+        chain << x += value
+      end
+    end.sort.uniq
+  end
+end
+
+class Integer
+  def achain
+    self == 1 ? [1] 
+              : [AChain.factor(self), AChain.window_brute(self)].min_by(&:size)
+  end
+end

data/lib/numb/almost_perfect.rb

@@ -3,4 +3,6 @@ class Integer
     return true if self == 1
     proper_divisors.reduce(:+) == self - 1
   end
+
+  alias :least_deficient? :almost_perfect?
 end

data/lib/numb/amicable.rb

@@ -1,8 +1,6 @@
 class Integer
   def amicable?(other)
-    return false if other == self 
-    [self, other].map do |n| 
-      n.proper_divisors.reduce(:+)
-    end == [other, self]
+    n, m = [self, other].minmax
+    m.multiamicable?(n, 1, 1)
   end
 end

data/lib/numb/delannoy.rb

@@ -22,4 +22,5 @@ class Integer
     return 1 if b.zero? or a.zero?
     [(a - 1).delannoy(b), a.delannoy(b - 1), (a - 1).delannoy(b - 1)].reduce(:+)
   end
+  memoize :delannoy
 end

data/lib/numb/fibonacci.rb

@@ -3,6 +3,6 @@ class Integer
     return true if self == 1
     # Posamentier, Alfred; Lehmann, Ingmar (2007). The (Fabulous) FIBONACCI
     # Numbers. Prometheus Books. pp. 305
-    [4, -4].map{|x| (5 * (self**2)) + x}.one? &:square?
+    [4, -4].map{|x| (5 * (self**2)) + x}.any? &:square?
   end
 end

data/lib/numb/goldbach.rb

@@ -1,6 +1,11 @@
 class Integer
   def goldbach?
     return false unless even? and self > 2
-    downto(2).any?{|n| n.prime? and (self - n).prime?}
+    #downto(2).any?{|n| n.prime? and (self - n).prime?}
+    Prime.each do |prime|
+      next if prime == 2
+      return true if (self - prime).prime?
+      return false if prime >= self
+    end
   end
 end

data/lib/numb/harshad.rb

@@ -1,8 +1,9 @@
 # coding: utf-8
 class Integer
   def harshad?
-    return false unless self >= 1
-    (self %  digital_sum) == 0
+    self >= 1 and (self % digital_sum).zero?
   end
+
   alias :niven? :harshad?
+  alias :multidigital? :harshad?
 end

data/lib/numb/highly_composite.rb

@@ -7,4 +7,6 @@ class Integer
       x.number_of_divisors >= n_divisors
     end
   end
+
+  alias :julian? :highly_composite?
 end

data/lib/numb/hoax.rb

@@ -0,0 +1,7 @@
+# coding: utf-8
+class Integer
+  def hoax?
+    return false unless composite?
+    sum_of_digits == prime_factors.uniq.map{|f| f.sum_of_digits}.reduce(:+)
+  end
+end

data/lib/numb/idempotent.rb

@@ -0,0 +1,6 @@
+# coding: utf-8
+class Integer
+  def idempotent(k)
+    (k.choose(self) * (self**(k - self))).to_i
+  end
+end

data/lib/numb/infinitary_divisors.rb

@@ -0,0 +1,15 @@
+# coding: utf-8
+class Integer
+  def infinitary_divisors
+    pf = Hash[prime_factors.uniq.map{|f| [f, 0]}]
+    bin = divisors.map do |d|
+      prime_divisors = pf.map(&:first)
+      [d, pf.merge(Hash[d.primaries]).
+        values.
+        map{|v| sprintf("%.#{to_s(2).size}b", v)}.join]
+    end
+    bin = Hash[bin]
+    target = bin[self].chars.map.with_index.to_a.select{|a,b| a == '0'}.map(&:last)
+    bin.select{|d,b| target.all?{|i| b[i] == '0'}}.keys.sort
+  end
+end

data/lib/numb/infinitary_perfect.rb

@@ -0,0 +1,6 @@
+# coding: utf-8
+class Integer
+  def infinitary_perfect?
+    σ∞ == 2*self
+  end
+end

data/lib/numb/integer_p.rb

@@ -6,6 +6,6 @@ end
 
 class Float
   def integer?
-    round(10) == to_i
+    !!(sprintf("%f", self) =~ /\.0+$/)
   end
 end

data/lib/numb/knuth.rb

@@ -0,0 +1,15 @@
+# coding: utf-8
+class Integer
+  def knuth
+    return 1 if zero?
+    n = self - 1
+    1 + [2 * (n/2).knuth, 3 * (n/3).knuth].min
+  end
+
+  def knuth?
+    downto(0) do |n|
+      next if (k = n.knuth) > self
+      return k == self ? true : false
+    end
+  end
+end

data/lib/numb/lah.rb

@@ -0,0 +1,6 @@
+# coding: utf-8
+class Integer
+  def lah(k)
+    ((self-1).choose(k-1) * Rational(factorial, k.factorial)).to_i
+  end
+end

data/lib/numb/motzkin.rb

@@ -0,0 +1,16 @@
+# coding: utf-8
+class Integer
+  def motzkin
+    n = self
+    return 1 if n <= 1
+    ((3 * (n - 1) * (n - 2).motzkin) + (2 * n).succ * (n - 1).motzkin) / (n + 2)
+  end
+
+  def motzkin?
+    (1..self).each do |n|
+      m = n.motzkin
+      next if m < self
+      return m == self ? true : false
+    end
+  end
+end

data/lib/numb/multiamicable.rb

@@ -0,0 +1,7 @@
+# coding: utf-8
+class Integer
+  def multiamicable?(m, a, b)
+    return false unless m != self and m < self and a.positive? and b.positive?
+    m.σ - m == a*self and σ - self == b*m
+  end
+end

data/lib/numb/m/303/251nage.rb

@@ -0,0 +1,23 @@
+# coding: utf-8
+class Integer
+  def ménage
+    return 1 if zero? # FIXME: Check this
+    return 0 unless self > 1
+    (0..self).map do |k|
+      Rational(2 * self, 2 * self - k) * 
+        ((2 * self) - k).choose(k) *
+        (self - k).factorial *
+        (-1)**k
+    end.reduce(:+).to_i
+  end
+
+  def ménage?
+    (1..self).each do |n|
+      next if (m = n.ménage) < self
+      return m == self ? true : false
+    end
+  end
+
+  alias :menage :ménage
+  alias :menage? :ménage?
+end

data/lib/numb/nexus.rb

@@ -0,0 +1,7 @@
+# coding: utf-8
+class Integer
+  def nexus(d)
+    (self + 1)**d.succ - self**d.succ
+  end
+end
+

data/lib/numb/nsw.rb

@@ -0,0 +1,16 @@
+# coding: utf-8
+class Integer
+  def nsw
+    case self
+      when 0 then 1
+      when 1 then 7
+      else        6 * (self - 1).nsw - (self - 2).nsw
+    end
+  end
+  memoize(:nsw)
+  
+  def nsw?
+    m = self
+    (rhs = (m**2).succ).divides?(2) and 2 * ((rhs/2).isqrt**2) == rhs
+  end
+end

data/lib/numb/pandigital.rb

@@ -0,0 +1,6 @@
+# coding: utf-8
+class Integer
+  def pandigital?
+    (0..9).all?{|d| digits.include? d}
+  end
+end

data/lib/numb/persistent.rb

@@ -0,0 +1,6 @@
+# coding: utf-8
+class Integer
+  def persistent?(n)
+    (1..n).all?{|x| (x * self).pandigital?}
+  end
+end

data/lib/numb/prime_power.rb

@@ -0,0 +1,6 @@
+# coding: utf-8
+class Integer
+  def prime_power?(k=nil)
+    self == 1 or (primaries.size == 1 and (not k or primaries.first.last == k))
+  end
+end

data/lib/numb/pronic.rb

@@ -5,4 +5,5 @@ class Integer
   end
 
   alias :heteromecic? :pronic?
+  alias :oblong? :pronic?
 end

data/lib/numb/square.rb

@@ -1,7 +1,7 @@
 # coding: utf-8
 class Integer
   def square?
-    return false if self < 0
-    sqrt.integer?
+    return false unless zero? or (positive? and to_s(16)[-1] =~ /[0149]/)
+    (sq = sqrt).finite? ? sq.integer? : nil
   end
 end

data/lib/numb/sum_of_infinitary_divisors.rb

@@ -0,0 +1,9 @@
+# coding: utf-8
+class Integer
+  def σ∞
+    infinitary_divisors.reduce :+
+  end
+
+  alias :sum_of_infinitary_divisors :σ∞
+  alias :isigma :σ∞
+end

data/lib/numb/superabundant.rb

@@ -2,7 +2,17 @@
 class Integer
   def superabundant?
     return true if self == 1
-    sod_over_self = Rational(σ, self)
-    (self - 1).downto(1).all?{|m| Rational(m.σ, m) < sod_over_self}
+    # Constraints due to "Abundant Numbers and the Riemann Hypothesis",
+    # Briggs, 2006, Experimental Mathematics, vol. 15, no. 2
+    ex = primaries.map(&:last)
+    return false unless [ex.last, ex.first] == ex.minmax
+    primaries[1..-1].all? do |b, e|
+      (e - (ex[0] * Math.log(b, primaries[0][0])).floor <= 1) and e < 2**(ex[0] + 2)
+    end or return false
+    return false unless [4, 36].include?(self) or ex.last == 1
+    1.upto(self - 1).all? do |m|
+      m.abundancy < abundancy
+    end
   end
+  memoize :superabundant?
 end

data/lib/numb/vampire.rb

@@ -1,11 +1,12 @@
 # coding: utf-8
 class Integer
   def vampire?
-    return false unless !prime? and digits.size.even?
-    digits.permutation.map do |perm|
-      [:first,:last].map {|pos| perm.send(pos,(digits.size/2)).join.to_i }.sort
-    end.uniq.any? do |fangs|
-      fangs.reduce(:*) == self
+    return false unless composite? and digits.size.even?
+    seen = {}
+    digits.permutation.any? do |perm|
+      fangs = [:first,:last].map {|pos| perm.send(pos,(digits.size/2)).join.to_i }.sort
+      next if seen.key?(fangs)
+      seen[fangs] = fangs.reduce(:*) == self
     end
   end
 end

data/lib/numb.rb

@@ -1,5 +1,21 @@
 # coding: utf-8
+module Memoize
+  def memoize(sym)
+    aka = "_#{sym}".to_sym
+    alias_method aka, sym
+    @@NUMB ||= {}
+    Integer.send(:define_method, sym) do |*args|
+      @@NUMB[[self, sym, args]] ||= send(aka, *args)
+    end
+  end
+end
 
+[Integer, Bignum].each do |klass|
+  class << klass
+    include Memoize
+  end
+end
+  
 class Integer
   def number_of_distinct_prime_factors
     prime_factors.uniq.size
@@ -40,6 +56,7 @@ class Integer
     (1..isqrt).select { |n| (self % n).zero? }.
                map {|n| [n, self/n]}.flatten.uniq
   end
+  memoize :divisors
 
   def sum_of_divisors
     @sod ||= divisors.reduce(:+)

data/spec/numb/achain_spec.rb

@@ -0,0 +1,39 @@
+# coding: utf-8
+describe Integer, "#achain" do
+  # A003313 
+  @seq = [0,1,2,2,3,3,4,3,4,4,5,4,5,5,5,4,5,5,6,5,6,6,6,5,6,6,6,6,7,6,7,5,6,
+          6,7,6,7,7,7,6,7,7,7,7,7,7,8,6,7,7,7,7,8,7,8,7,8,8,8,7,8,8,8,6,7,7,
+          8,7,8,8,9,7,8,8,8,8,8,8,9,7,8,8,8,8,8,8,9,8,9,8,9,8,9,9,9,7,8,8,8,8,]
+
+  @seq.to_enum.with_index(1) do |len, n|
+    achain = n.achain
+
+    it "returns an addition chain of #{len} terms for #{n}" do
+      (achain.size - 1).should == len
+    end
+
+    it "returns an addition chain for #{n} that ends with #{n}" do
+      achain.last.should == n
+    end
+
+    it "returns an addition chain for #{n} that begins with 1" do
+      achain.first.should == 1
+    end
+
+    it "returns an addition chain for #{n} without any duplicate terms" do
+      achain.uniq.should == achain
+    end
+
+    it "returns an addition chain for #{n} with terms ordered by smallest to largest" do
+      achain.sort.should == achain
+    end
+
+    it "returns an addition chain for #{n} whose terms are the sum of two preceeding terms" do
+      chain = achain.reverse
+      sums = (chain * 2).permutation(2).to_a.uniq.map{|perm| perm.reduce(:+)}
+      chain[0..-2].each do |t|
+        sums.should include(t)
+      end
+    end
+  end
+end

data/spec/numb/fibonacci_spec.rb

@@ -12,7 +12,7 @@ describe Integer, "#fibonacci?" do
     end
   end
 
-  @seq.invert.sample(10).each do |n|
+  @seq.invert.sample(100).each do |n|
     it "returns false for non-Fibonacci number #{n}" do
       n.should_not be_fibonacci
     end

data/spec/numb/hoax_spec.rb

@@ -0,0 +1,21 @@
+# coding: utf-8
+describe Integer, "#hoax?" do
+  # A019506 
+  @seq = [22,58,84,85,94,136,160,166,202,234,250,265,274,
+          308,319,336,346,355,361,364,382,391,424,438,454,
+          456,476,483,516,517,526,535,562,627,634,644,645,
+          650,654,660,663,690,702,706,732,735,762,778,855,
+          860]
+
+  @seq.each do |n|
+    it "returns true for hoax number #{n}" do
+      n.should be_hoax
+    end
+  end
+
+  @seq.to_seq.invert.each do |n|
+    it "returns false for non-hoax number #{n}" do
+      n.should_not be_hoax
+    end
+  end
+end

data/spec/numb/idempotent_spec.rb

@@ -0,0 +1,59 @@
+# coding: utf-8
+describe Integer, "#idempotent" do
+
+  @seq = {
+    # A000027
+    1 => [1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,
+          20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,
+          36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,
+          52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,
+          68,69,70,71,72,73,74,75,76,77],
+    # A001788      
+    2 => [0,1,6,24,80,240,672,1792,4608,11520,28160,67584,
+          159744,372736,860160,1966080,4456448,10027008,
+          22413312,49807360,110100480,242221056,530579456,
+          1157627904,2516582400,5452595200,11777605632].reject(&:zero?),
+    # A036216
+    3 => [1,12,90,540,2835,13608,61236,262440,1082565,
+          4330260,16888014,64481508,241805655,892820880,
+          3252418920,11708708112,41712272649,147219785820,
+          515269250370,1789882659180,6175095174171,
+          21171754882872],
+    # A040075
+    4 => [1,20,240,2240,17920,129024,860160,5406720,
+          32440320,187432960,1049624576,5725224960,
+          30534533120,159719096320,821412495360,
+          4161823309824,20809116549120,102821517066240,
+          502682972323840],
+    # A050982      
+    5 => [1,30,525,7000,78750,787500,7218750,61875000,
+          502734375,3910156250,29326171875,213281250000,
+          1510742187500,10458984375000,70971679687500,
+          473144531250000,3105010986328125,
+          20091247558593750],
+    # A050988
+    6 => [1,42,1008,18144,272160,3592512,43110144,
+          480370176,5043886848,50438868480,484213137408,
+          4489976365056,40409787285504,354362750042112,
+          3037395000360960,25514118003032064],
+    # A050989      
+    7 => [1,56,1764,41160,792330,13311144,201885684,
+          2826399576,37096494435,461645264080,5493578642552,
+          62926446269232,697434779483988,7510836086750640,
+          78863778910881720,809668130151718992],
+  }
+
+  @seq.each do |n, values|
+    (1...n).each do |k|
+      it "returns 0 when n=#{n} and k=#{k}" do
+        n.idempotent(k).should be_zero
+      end
+    end
+
+    values.to_enum.with_index(n).each do |idem, k|
+      it "returns #{idem} for n=#{n} and k=#{k}" do
+        n.idempotent(k).should == idem
+      end
+    end
+  end
+end

data/spec/numb/infinitary_divisors_spec.rb

@@ -0,0 +1,57 @@
+# coding: utf-8
+describe Integer, "#infinitary_divisors" do
+  # A077609
+  @seq = [
+    [1],
+    [1,2],
+    [1,3],
+    [1,4],
+    [1,5],
+    [1,2,3,6],
+    [1,7],
+    [1,2,4,8],
+    [1,9],
+    [1,2,5,10],
+    [1,11],
+    [1,3,4,12],
+    [1,13],
+    [1,2,7,14],
+    [1,3,5,15],
+    [1,16],
+    [1,17],
+    [1,2,9,18],
+    [1,19],
+    [1,4,5,20],
+    [1,3,7,21],
+    [1,2,11,22],
+    [1,23],
+    [1,2,3,4,6,8,12,24],
+    [1,25],
+    [1,2,13,26],
+    [1,3,9,27],
+    [1,4,7,28],
+    [1,29],
+    #[1]
+  ]
+
+  @seq.each do |id|
+    id.sort!
+    n = id.last
+    it "returns #{id} for #{n}" do
+      n.infinitary_divisors.should == id
+    end
+  end
+
+  # A037445
+  @counts = [1,2,2,2,2,4,2,4,2,4,2,4,2,4,4,2,2,4,2,4,4,4,2,8,
+             2,4,4,4,2,8,2,4,4,4,4,4,2,4,4,8,2,8,2,4,4,4,2,4,2,
+             4,4,4,2,8,4,8,4,4,2,8,2,4,4,4,4,8,2,4,4,8,2,8,2,4,
+             4,4,4,8,2,4,2,4,2,8,4,4,4,8,2,8,4,4,4,4,4,8,2,4,4,
+             4,2,8,2,8,8]
+
+  @counts.to_enum.with_index(1).each do |c, n|
+    it "returns #{c} infinitary divisors for #{n}" do
+      n.infinitary_divisors.uniq.count.should == c
+    end
+  end
+end

data/spec/numb/infinitary_perfect_spec.rb

@@ -0,0 +1,21 @@
+# coding: utf-8
+describe Integer, "#infinitary_perfect?" do
+  # A007357
+  @seq = [6,60,90,36720,12646368,22276800,126463680,
+          4201148160,28770487200,287704872000,1446875426304,
+          2548696550400,14468754263040,590325173932032,
+          3291641594841600,8854877608980480,
+          32916415948416000].first(7)
+
+  @seq.each do |n|
+    it "returns true for infinitary perfect number #{n}" do
+      n.should be_infinitary_perfect
+    end
+  end
+
+  @seq.to_seq.invert.sample(7).each do |n|
+    it "returns false for non-infinitary perfect number #{n}" do
+      n.should_not be_infinitary_perfect
+    end
+  end
+end