numb 0.152.0 → 0.170.0

data/lib/numb/square.rb

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

data/lib/numb/square_free.rb

@@ -1,6 +0,0 @@
-# coding: utf-8
-class Integer
-  def square_free?
-     not μ.zero?
-  end
-end

data/lib/numb/square_triangular.rb

@@ -1,5 +0,0 @@
-class Integer
-  def square_triangular?
-    square? and triangular?
-  end
-end

data/lib/numb/squared_triangular.rb

@@ -1,5 +0,0 @@
-class Integer
-  def squared_triangular?
-    square? and sqrt.to_i.triangular?
-  end
-end

data/lib/numb/sublime.rb

@@ -1,6 +0,0 @@
-# coding: utf-8
-class Integer
-  def sublime?
-    number_of_divisors.perfect? and σ.perfect?
-  end
-end

data/lib/numb/sum_of_e_divisors.rb

@@ -1,10 +0,0 @@
-# coding: utf-8
-class Integer
-  def σe
-    # TODO: If squarefree, the sum of a number’s e-divisors is the number
-    # itself. Do we gain anything significant by special-casing this?
-    e_divisors.reduce(:+)
-  end
-
-  alias :sum_of_e_divisors :σe
-end

data/lib/numb/sum_of_infinitary_divisors.rb

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

data/lib/numb/sum_of_unitary_divisors.rb

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

data/lib/numb/super_poulet.rb

@@ -1,5 +0,0 @@
-class Integer
-  def super_poulet?
-    poulet? and divisors.all?{|d|  ((2**d) - 2).divides?(d)}
-  end
-end

data/lib/numb/superabundant.rb

@@ -1,18 +0,0 @@
-# coding: utf-8
-class Integer
-  def superabundant?
-    return true if self == 1
-    # 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/superperfect.rb

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

data/lib/numb/triangular.rb

@@ -1,6 +0,0 @@
-# coding: utf-8
-class Integer
-  def triangular?
-    n_gonal?(3)
-  end
-end

data/lib/numb/twin_prime.rb

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

data/lib/numb/unitary_amicable.rb

@@ -1,7 +0,0 @@
-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_divisor.rb

@@ -1,5 +0,0 @@
-class Integer
-  def unitary_divisor?(x)
-    x.coprime?(self/x)
-  end
-end

data/lib/numb/unitary_perfect.rb

@@ -1,7 +0,0 @@
-class Integer
-  def unitary_perfect?
-    proper_divisors.select do |divisor|
-      unitary_divisor?(divisor)
-    end.reduce(:+) == self
-  end
-end

data/lib/numb/unitary_sociable.rb

@@ -1,7 +0,0 @@
-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/untouchable.rb

@@ -1,14 +0,0 @@
-# coding: utf-8
-class Integer
-  def untouchable?
-    # * The first untouchable integer is 2
-    # * Perfect numbers are never untouchable because they can be expressed
-    #   as the sum of their own proper divisors
-    # * If p is prime, the sum of the proper divisors of p**2 is p + 1;
-    #   therefore, no untouchable number is one more than a prime.
-    return false if self < 2 or perfect? or (self - 1).prime?
-    (1..((self - 1)**2)).none? do |m|
-      m.σ - m == self
-    end
-  end
-end

data/lib/numb/unusual.rb

@@ -1,5 +0,0 @@
-class Integer
-  def unusual?
-    prime_factors.max > sqrt
-  end
-end

data/lib/numb/weird.rb

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

data/lib/numb/wieferich.rb

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