numb 0.21.0 → 0.63.0

data/Rakefile

@@ -10,8 +10,9 @@ begin
     gem.email = "runrun@runpaint.org"
     gem.homepage = "http://github.com/runpaint/numb"
     gem.authors = ["Run Paint Run Run"]
-    gem.rdoc_options = ['-x', 'lib/numb/ruby1.9.rb']
+    gem.rdoc_options = ['-x']
     gem.add_dependency "gemcutter", ">= 0.1.0"
+    gem.required_ruby_version = '1.9'
     # gem is a Gem::Specification... see http://www.rubygems.org/read/chapter/20 for additional settings
   end
   Jeweler::GemcutterTasks.new
@@ -22,7 +23,7 @@ end
 require 'spec/rake/spectask'
 Spec::Rake::SpecTask.new(:spec) do |spec|
   spec.libs << 'lib' << 'spec'
-  spec.spec_files = FileList['spec/**/*_spec.rb']
+  spec.spec_files = FileList['spec/spec_helper.rb', 'spec/**/*_spec.rb']
 end
 
 Spec::Rake::SpecTask.new(:rcov) do |spec|

data/VERSION

@@ -1 +1 @@
-0.21.0
+0.63.0

data/lib/numb/abundancy.rb

@@ -0,0 +1,6 @@
+# coding: utf-8
+class Integer
+  def abundancy
+    Rational(σ, self)
+  end
+end

data/lib/numb/abundant.rb

@@ -13,7 +13,7 @@ class Integer
   #
   def abundant?
     return false unless self > 0
-    sum_of_divisors > (2 * self)
+    σ > (2 * self)
   end
 
   alias :excessive? :abundant?

data/lib/numb/almost_perfect.rb

@@ -0,0 +1,6 @@
+class Integer
+  def almost_perfect?
+    return true if self == 1
+    proper_divisors.reduce(:+) == self - 1
+  end
+end

data/lib/numb/amicable.rb

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

data/lib/numb/aspiring.rb

@@ -0,0 +1,19 @@
+class Integer
+  def aliquot_sequence
+    sequence = [self]
+    max_iterations = Math.sqrt(self).floor
+    max_iterations.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?
+    return false if perfect? 
+    (last = aliquot_sequence.last).to_f.finite? ? last.perfect? : false
+  end
+end

data/lib/numb/centered_n_gonal.rb

@@ -0,0 +1,9 @@
+class Integer
+  def centered_n_gonal?(n)
+    raise ArgumentError unless n > 2
+    Rational(
+      -n + Math.sqrt( n**2 - 8 * (n - n * self) ), 
+                  2 * n
+    ).denominator == 1
+  end
+end

data/lib/numb/centered_triangular.rb

@@ -0,0 +1,5 @@
+class Integer
+  def centered_triangular?
+    centered_n_gonal?(3)
+  end
+end

data/lib/numb/congruum.rb

@@ -0,0 +1,13 @@
+class Integer
+  def congruum?
+    # Fibonacci proved that h|24
+    # Fermat’s right triangle theorem shows h is not square
+    return false unless divides?(24) and not square?
+    h = self
+    (1..Math.sqrt(h)).any? do |n|
+      (n.succ..Math.sqrt(h)).any? do |m|
+        h == (4 * m * n) * (m**2 - n**2)
+      end
+    end
+  end
+end

data/lib/numb/coprime.rb

@@ -0,0 +1,9 @@
+# coding: utf-8
+class Integer
+  def coprime?(x)
+    gcd(x) == 1
+  end
+  alias :⊥ :coprime?
+  alias :stranger? :coprime?
+end
+

data/lib/numb/core.rb

@@ -0,0 +1,7 @@
+# coding: utf-8
+class Integer
+  def core
+    raise ArgumentError if self <= 0
+    divisors.sort.select{|m| (self/m).square?}.first
+  end
+end

data/lib/numb/cototient.rb

@@ -0,0 +1,7 @@
+# coding: utf-8
+class Integer
+  def cototient
+    self - φ
+  end
+end
+

data/lib/numb/d.rb

@@ -0,0 +1,6 @@
+# coding:utf-8
+class Integer
+  def d?
+    knödel?(3)
+  end
+end

data/lib/numb/deficient.rb

@@ -12,7 +12,7 @@ class Integer
   #
   def deficient?
     return false unless self > 0
-    sum_of_divisors < (2 * self)
+    σ < (2 * self)
   end
 
   alias :defective? :deficient?

data/lib/numb/fermat_pseudoprime.rb

@@ -0,0 +1,9 @@
+class Integer
+  def fermat_pseudoprime?(a=10)
+    return false unless composite?
+    q = self
+    raise ArgumentError unless a >= 2
+    raise ArgumentError unless (q - 2) >= a
+    (a**(q-1)).modulo(q) == 1
+  end
+end

data/lib/numb/friendly.rb

@@ -0,0 +1,9 @@
+class Integer
+  def friendly?(*others)
+    raise ArgumentError unless others.size >= 1 && others.uniq.size == others.size
+    abundancy = self.abundancy
+    others.all? {|o| o.abundancy == abundancy}
+  end
+end
+
+    

data/lib/numb/hexagonal.rb

@@ -1,7 +1,6 @@
 class Integer
   def hexagonal?
     return true if zero?
-    n = ((Math.sqrt((8*self) + 1) + 1)/4)
-    n == n.to_i
+    ((Math.sqrt((8*self) + 1) + 1)/4).integer?
   end
 end

data/lib/numb/highly_abundant.rb

@@ -0,0 +1,7 @@
+# coding: utf-8
+class Integer
+  def highly_abundant?
+    return true if self == 1
+    (self - 1).downto(1).all?{|m| σ > m.σ }
+  end
+end

data/lib/numb/highly_composite.rb

@@ -0,0 +1,10 @@
+class Integer
+  def highly_composite?
+    return false if self > 6 and not (abundant? or primorial_product?)
+    return true if [1,4,36].include?(self)
+    n_divisors = number_of_divisors
+    (self-1).downto(1).none? do |x|
+      x.number_of_divisors >= n_divisors
+    end
+  end
+end

data/lib/numb/hyperperfect.rb

@@ -2,6 +2,6 @@
 class Integer
   def hyperperfect?(k=1)
     raise ArgumentError unless k >= 1
-    (1 + (k * (sum_of_divisors - self - 1))) == self
+    (1 + (k * (σ - self - 1))) == self
   end
 end

data/lib/numb/idoneal.rb

@@ -0,0 +1,65 @@
+class Integer
+  def idoneal?
+    n = self
+    # Conjecture 2 (Euler) The largest idoneal number is n = 1848
+    # Conjecture 5 (Gauss) If c(−4n) = 1, then n ≤ 1848.
+    return false if n > 1848
+
+    # Theorem 3 (Euler) 
+    # 1. If n is an idoneal number which is a square, then n =  1, 4, 9, 16, or 25.
+    return false if n.square? and ![1, 4, 9, 16, 25].include?(n)
+    if n.divides?(4)
+      n_over_4 = n/4
+
+      # Theorem 12 (Grube)
+      # (c) If n is idoneal and 4||n, then n = 4, 12, 28, 60
+      return false if n_over_4.odd? and ![4,12,28,60].include?(n)
+      
+      # Theorem 12 (Grube)
+      # If n is idoneal and 16|n, then n = 16, 48, 112, 240.
+      if n.divides?(16)
+        return [16, 48, 112, 240].include?(n)
+      end
+
+      # Theorem 3 (Euler) 
+      # 6. If n ≡ 1 (mod 4) is idoneal and n != 1, then 4n is not idoneal.
+      # 8. If n ≡ 8 (mod 16) is idoneal, then 4n is not idoneal.
+      # 9. If n ≡ 16 (mod 32) is idoneal, then 4n is not idoneal.
+
+      # Corollary 10 (Euler)
+      # Thus, if n ≡ 0 (mod 32) or if n ≡ 4 (mod 16) and n > 4, then n is not idoneal.
+      if n.modulo(32).zero? or n.modulo(16) == 4 and n > 4
+        return false
+      end
+    end
+
+    # Theorem 12 (Grube)
+    # (a) If n is idoneal and 9|n, then n = 9, 18, 45, 72.
+    return [9, 18, 45, 72].include?(n) if n.divides?(9)
+    
+    # Theorem 12 (Grube)
+    # (b) If n is idoneal and 25|n, then n = 25.
+    return n == 25 if n.divides?(25)
+    
+    # Corollary 8 
+    # If n ≡ 3 (mod 4) is idoneal, then n = 3, 7 or 15.
+    return [3, 7, 15].include?(n) if n.modulo(4) == 3
+     
+    # Perform a brute force test of whether n == ab + bc + ca; if it does, for
+    # some distinct integer a, b, and c, n is not idoneal
+    max = Math.sqrt(n/3)
+    (1..max).each do |a|
+      b_max = n - (a**2) - (a+1)**2 - (a+1)**2
+      ((a+1)..b_max).each do |b|
+        ab = a*b
+        c_max = n - ab - b*(b+1)
+        ((b+1)..c_max).each do |c|
+          sum = ab + b*c + c*a
+          return false if sum == n
+          break if sum > n
+        end
+      end
+    end
+    true
+  end
+end

data/lib/numb/integer_p.rb

@@ -0,0 +1,11 @@
+class Integer
+  def integer?
+    true
+  end
+end
+
+class Float
+  def integer?
+    self == to_i
+  end
+end

data/lib/numb/interprime.rb

@@ -0,0 +1,6 @@
+class Integer
+  def interprime?
+    return false if prime?
+    self == (next_prime + prev_prime)/2
+  end
+end

data/lib/numb/jacobsthal_lucas.rb

@@ -0,0 +1,10 @@
+class Integer
+  def jacobsthal_lucas?
+    [self + 1, self - 1].any? do |n|
+      exp = Math.log2(n)
+      if exp.integer?
+        self == 2**exp + (-1)**exp
+      end
+    end
+  end
+end

data/lib/numb/k_perfect.rb

@@ -0,0 +1,8 @@
+# coding: utf-8
+class Integer
+  def k_perfect?(k)
+    σ == k * self
+  end
+
+  alias :multiply_perfect? :k_perfect?
+end

data/lib/numb/knodel.rb

@@ -0,0 +1,12 @@
+# coding: utf-8
+class Integer
+  def knödel?(k)
+    n = self
+    return false unless n > k and composite?
+    exp = n - k + 1
+    (1...n).select{|j| j.coprime?(n)}.all? do |j|
+      (j**exp - j).remainder(n).zero?
+    end
+  end
+  alias :knodel? :knödel?
+end

data/lib/numb/leonardo.rb

@@ -0,0 +1,13 @@
+class Integer
+  def leonardo?
+    n = self
+    return 1 if n <= 1
+    phi = Hash[[:+, :-].map{|sign| [sign, (1.send(sign, Math.sqrt(5)) / 2) ]}]
+    divisor = phi[:+] - phi[:-]
+    (1..n).any? do |m|
+      sum = ((2 * ( ( phi[:+]**(m+1) - phi[:-]**(m+1) ).fdiv( divisor ) )) - 1)
+      return false unless sum.finite?
+      sum.floor == self
+    end
+  end
+end

data/lib/numb/leyland.rb

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

data/lib/numb/lucas_carmichael.rb

@@ -2,7 +2,7 @@ class Integer
   def lucas_carmichael?
     return false unless composite? and odd? and square_free? 
     prime_factors.all? do |prime_factor|
-      succ.factor?(prime_factor + 1)
+      succ.divides?(prime_factor + 1)
     end
   end
 end

data/lib/numb/mersenne_prime.rb

@@ -0,0 +1,5 @@
+class Integer
+  def mersenne_prime?
+    prime? and repunit?(2)
+  end
+end

data/lib/numb/minimal.rb

@@ -0,0 +1,8 @@
+class Integer
+  def minimal?
+    div_n = number_of_divisors
+    (self-1).downto(1).all? do |n|
+      n.number_of_divisors != div_n
+    end
+  end
+end

data/lib/numb/mobius.rb

@@ -1,11 +1,10 @@
 # coding: utf-8
 class Integer
   def mobius
-    case
-      when (self < 1)                 then nil
-      when (square_free? and number_of_distinct_prime_factors.even?) then 1
-      when (square_free? and number_of_distinct_prime_factors.odd?)  then -1
-      when (not square_free?)         then 0
-    end
+   return if self < 1
+   ω < Ω  ? 0 : (-1)**(Ω)
   end
+
+  alias :möbius :mobius
+  alias :μ :mobius
 end

data/lib/numb/n_gonal.rb

@@ -2,7 +2,6 @@ class Integer
   def n_gonal?(n)
     raise ArgumentError unless n.is_a?(Integer) and n >= 3
     return true if zero?
-    x = (Math.sqrt((8*n - 16)*self + (n-4)**2) + n - 4) / (2*n - 4)
-    x == x.to_i
+    ((Math.sqrt((8*n - 16)*self + (n-4)**2) + n - 4) / (2*n - 4)).integer?
   end
 end

data/lib/numb/next_prev_prime.rb

@@ -0,0 +1,13 @@
+class Integer
+  def next_prime
+    p = succ
+    p += 1 until p.prime?
+    p
+  end
+  
+  def prev_prime
+    p = self - 1
+    p -= 1 until p.prime?
+    p
+  end
+end

data/lib/numb/noncototient.rb

@@ -0,0 +1,9 @@
+# coding: utf-8
+class Integer
+  def noncototient?
+    return false if self < 10 or odd?
+    (Math.sqrt(self).floor..(2 * self)).none? do |m|
+      m.cototient == self
+    end
+  end
+end

data/lib/numb/nth_prime.rb

@@ -0,0 +1,17 @@
+# coding: utf-8
+class Integer
+  # Algorithm derived from Formulas for pi(n) and the n-th prime by Sebastian
+  # Martin Ruiz and Jonathan Sondow [arXiv:math/0210312v2 [math.NT]]
+
+  # Returns, after many eons, the nth prime, where n = self
+  def nth_prime
+    n = self
+    return 2 if n == 1
+    raise ArgumentError if n < 1
+    (2..( 2*n * Math.log(n) + 2).floor).map do |k|
+      1 - (k.π.fdiv(n)).floor
+    end.reduce(:+) + 2
+  end
+
+  alias :prime :nth_prime
+end

data/lib/numb/number_of_divisors.rb

@@ -0,0 +1,21 @@
+# coding: utf-8
+class Integer
+  # Algorithm derived from Formulas for pi(n) and the n-th prime by Sebastian
+  # Martin Ruiz and Jonathan Sondow [arXiv:math/0210312v2 [math.NT]]
+
+  # Returns the number of divisors of self
+  def τ 
+    n = self
+    return @nod if defined?(@nod)
+    square_root = Math.sqrt(n)
+    @nod = (1..square_root.floor).
+      map {|i|  n.quo(i).to_i - (n - 1).quo(i).to_i }.
+      reduce(:+) * 2
+    @nod -= 1 if square_root.integer?
+    @nod
+  end
+
+
+  alias :number_of_divisors :τ 
+  alias :d :τ 
+end

data/lib/numb/octagonal.rb

@@ -1,8 +1,5 @@
 class Integer
   def octagonal?
     n_gonal?(8)
-    #return true if zero?
-    #x = (Math.sqrt(48*self + 16) + 4)/12
-    #x.to_i == x
   end
 end

data/lib/numb/ore.rb

@@ -0,0 +1,8 @@
+class Integer
+  def ore?
+    div = divisors
+    Rational(div.size, div.map{|d| Rational(1, d)}.reduce(:+)).denominator == 1
+  end
+
+  alias :harmonic_divisor? :ore?
+end

data/lib/numb/perfect.rb

@@ -3,8 +3,6 @@ class Integer
   def perfect?
     return false if self < 6 or self.odd? or self.to_s !~ /(6|8)$/
     return false if self != 6 and digital_root != 1  
-    divisors = proper_positive_divisors
-    return false unless (divisors.size + 1).even?
-    divisors.reduce(:+) == self
+    k_perfect?(2)
   end
 end

data/lib/numb/perfect_power.rb

@@ -3,7 +3,7 @@ class Integer
   def perfect_power?
     return false unless self > 0
     return true if self == 1
-    divisors = positive_divisors
+    divisors = self.divisors
     (2..Math.log2(self)).any? { |pow| divisors.any? {|div| (div ** pow) == self} } 
   end
 end

data/lib/numb/poulet.rb

@@ -0,0 +1,5 @@
+class Integer
+  def poulet?
+    fermat_pseudoprime? 2
+  end
+end

data/lib/numb/powerful.rb

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

data/lib/numb/prime_count.rb

@@ -0,0 +1,16 @@
+# coding: utf-8
+class Integer
+  # Algorithm derived from Formulas for pi(n) and the n-th prime by Sebastian
+  # Martin Ruiz and Jonathan Sondow [arXiv:math/0210312v2 [math.NT]]
+
+  # Returns the number of primes equal to or less than self
+  def π
+    x = self
+    return 0 if x == 1
+    @prime_count ||= ([2] + (3..x).select(&:odd?)).map do |j|
+      1 + ( ((2 - j.τ)/j).floor ).floor
+    end.reduce(:+)
+  end
+  alias :prime_pi :π
+  alias :prime_count :π
+end

data/lib/numb/prime_signature.rb

@@ -0,0 +1,5 @@
+class Integer
+  def prime_signature
+    prime_division.map{|base, exponent| exponent}.sort.reverse
+  end
+end

data/lib/numb/primitive_pseudoperfect.rb

@@ -1,5 +1,5 @@
 class Integer
   def primitive_pseudoperfect?
-    pseudoperfect? and proper_positive_divisors.sort.none?(&:pseudoperfect?)
+    pseudoperfect? and proper_divisors.sort.none?(&:pseudoperfect?)
   end
 end

data/lib/numb/primorial.rb

@@ -0,0 +1,26 @@
+require 'prime'
+class Integer
+  def primorial?
+    return true if self == 1
+    pd = prime_division
+    (pd.map{|b,e| e}.uniq == [1]) and (pd.map{|b,e| b} == Prime.first(pd.size))
+  end
+
+  def primorial_product?
+    return true if primorial?
+    return false if prime?
+    divisors.each_slice(2).
+             reject{|pair| pair == [1, self]}.
+             any?{|pair| pair.all?(&:primorial_product?)} 
+  end
+
+  def primorial
+    return nil if self < 1
+    return 1 if self == 1
+    if prime?
+      self * (self - 1).primorial
+    else
+      (self - 1).primorial
+    end
+  end
+end

data/lib/numb/proth.rb

@@ -0,0 +1,12 @@
+class Integer
+  def proth?
+    return false if self < 3
+    n_max = Math.log2(self-1).ceil
+    (1..(self / n_max)).select{|k| k.odd?}.any? do |k|
+      (1..n_max).select{|n| 2**n > k}.any? do |n|
+        break if (x = (k * (2**n)) + 1) > self 
+        x == self
+      end
+    end
+  end
+end

data/lib/numb/refactorable.rb

@@ -0,0 +1,7 @@
+# coding: utf-8
+class Integer
+  def refactorable?
+    divides?(τ)
+  end
+  alias :tau? :refactorable?
+end

data/lib/numb/repunit.rb

@@ -0,0 +1,5 @@
+class Integer
+  def repunit?(base)
+    !!to_s(base).match(/^1+$/)
+  end
+end

data/lib/numb/rough.rb

@@ -0,0 +1,5 @@
+class Integer
+  def rough?(k)
+    prime_factors.all?{|f| f >= k}
+  end
+end

data/lib/numb/semiperfect.rb

@@ -3,9 +3,9 @@ class Integer
    def semiperfect?
      return false if deficient?
      return true if perfect?
-     possibles, divisors = { 0 => true}, proper_positive_divisors
-     proper_sod = (sod = sum_of_divisors || 0) - self
-     divisors.reverse.each do |divisor|
+     possibles = { 0 => true}
+     proper_sod = (sod = σ || 0) - self
+     proper_divisors.reverse.each do |divisor|
        possibles.keys.each do |possible|
          possibles.delete(possible) if possible + sod < self 
          x = possible + divisor