numb 0.152.0 → 0.170.0

data/lib/numb/centered_square.rb

@@ -1,5 +0,0 @@
-class Integer
-  def centered_square?
-    centered_n_gonal? 4
-  end
-end

data/lib/numb/centered_triangular.rb

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

data/lib/numb/composite.rb

@@ -1,5 +0,0 @@
-class Integer
-  def composite?
-    self > 1 and not prime?
-  end
-end

data/lib/numb/coprime.rb

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

data/lib/numb/cube.rb

@@ -1,5 +0,0 @@
-class Integer
-  def cube?
-    Math.cbrt(self).integer?
-  end
-end

data/lib/numb/d.rb

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

data/lib/numb/decagonal.rb

@@ -1,5 +0,0 @@
-class Integer
-  def decagonal?
-    n_gonal?(10)
-  end
-end

data/lib/numb/deficient.rb

@@ -1,19 +0,0 @@
-# coding: utf-8
-class Integer
-  # A deficient number is a number n for which σ(n) < 2n. That is, the sum of
-  # its divisors are less than the number. (To calculate the sum of divisors
-  # for an arbitrary integer see Integer#σ).
-  #
-  # Returns true if the number is deficient; false otherwise.
-  #
-  #     8.deficient?  #=> true
-  #     27.deficient? #=> true
-  #     6.deficient?  #=> false
-  #
-  def deficient?
-    return false unless positive?
-    σ < (2 * self)
-  end
-
-  alias :defective? :deficient?
-end

data/lib/numb/dihedral_prime.rb

@@ -1,26 +0,0 @@
-# coding: utf-8
-class Integer
-
-  # A dihedral prime is a prime number that appears as itself or another prime
-  # when rendered on a seven-segment display of a calculator and... 
-  #
-  # * Rotated 180°.  
-  # * Mirrored.  
-  # * Rotated 180° and mirrored.
-  #
-  # For example, 120121 is a dihedral prime. It is 121021 when rotated,
-  # 151051 (another prime) when mirrored, and 150151 when rotated and
-  # mirrored.
-  #
-  # Returns true if self is a dihedral prime; false otherwise.
-  #
-  #     101.dihedral_prime?  #=> true
-  #     181.dihedral_prime?  #=> true
-  #     7.dihedral_prime?    #=> false
-  #
-  def dihedral_prime?
-    return false unless prime? and to_s.match(/^[01825]+$/)
-    mirror = ->(n){ n.to_s.gsub(/([25])/){|orig| orig == '2' ? '5' : '2'}.to_i }
-    [reverse, mirror[self], mirror[reverse]].all?(&:prime?)
-  end
-end

data/lib/numb/dodecagonal.rb

@@ -1,5 +0,0 @@
-class Integer
-  def dodecagonal?
-    n_gonal?(12)
-  end
-end

data/lib/numb/e_divisors.rb

@@ -1,10 +0,0 @@
-class Integer
-  def e_divisors
-    return [1] if self == 1
-    pfacts = primaries
-    comb = pfacts.map{|p,a| (1..a).select{|b| a.divides?(b)}.map{|b| p**b}}
-    comb.flatten.permutation(pfacts.size).select do |perm|
-      perm.each_with_index.all?{|x,i| comb[i].include? x}
-    end.map{|perm| perm.reduce(:*)}
-  end
-end

data/lib/numb/e_perfect.rb

@@ -1,7 +0,0 @@
-# coding: utf-8
-class Integer
-  def e_perfect?
-    return false if odd?
-    σe == 2 * self
-  end
-end

data/lib/numb/economical.rb

@@ -1,16 +0,0 @@
-# coding: utf-8
-class Integer
-  # A number which is either frugal or equidigital.
-  #
-  # Returns true if self is economical; false otherwise.
-  #
-  # See also Integer#equidigital? and Integer#frugal?.
-  #
-  #     243.economical?  #=> true
-  #     7.economical?    #=> true
-  #     989.economical?  #=> false
-  #
-  def economical?
-    equidigital? or frugal?
-  end
-end

data/lib/numb/emrip.rb

@@ -1,15 +0,0 @@
-# coding: utf-8
-class Integer
-  # An emrip is a prime whose reversed digits give a different prime. For
-  # example, 17 is an emrip because 71 is also prime.
-  #
-  # Returns true if self is an emrip; false otherwise.
-  #
-  #     1009.emrip?  #=> true
-  #     1193.emrip?  #=> true
-  #     7.emrip?     #=> false
-  #
-  def emrip?
-    prime? and reverse != self and reverse.prime?
-  end
-end

data/lib/numb/equidigital.rb

@@ -1,18 +0,0 @@
-# coding: utf-8
-class Integer
-  # An equidigital number has the same number of digits as
-  # the number of digits in its prime factorization (including exponents). 
-  #
-  # For example, 35 is equidigital because it has two digits and two 1-digit
-  # prime factors (5 and 7).
-  #
-  # Returns true if self is equidigital; false otherwise.
-  #
-  #     81.equidigital?    #=> true
-  #     49.equidigital?    #=> true
-  #     1287.equidigital?  #=> false
-  #
-  def equidigital?
-    digits.size == prime_division.flatten.reject{|d|d==1}.join.to_i.digits.size
-  end
-end

data/lib/numb/extravagant.rb

@@ -1,18 +0,0 @@
-# coding: utf-8
-class Integer
-  # An extravagant number has fewer digits than the number of digits in its
-  # prime factorization (including exponents).
-  #
-  # Returns true if self is extravagant; false otherwise. Aliased to
-  # Integer#wasteful?.
-  #
-  #     234.extravagant?  #=> true
-  #     87.extravagant?   #=> true
-  #     81.extravagant?   #=> false
-  #
-  def extravagant?
-    digits.size < prime_division.flatten.reject{|d|d==1}.join.to_i.digits.size
-  end
-
-  alias :wasteful? :extravagant?
-end

data/lib/numb/fermat_pseudoprime.rb

@@ -1,9 +0,0 @@
-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

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

@@ -1,5 +0,0 @@
-class Integer
-  def full_reptend_prime?
-    prime? and primitive_root?(10)
-  end
-end

data/lib/numb/giuga.rb

@@ -1,7 +0,0 @@
-class Integer
-  def giuga?
-    composite? and prime_factors.uniq.all? do |p|
-      ((self / p) - 1).divides?(p)
-    end
-  end
-end

data/lib/numb/harshad.rb

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

data/lib/numb/heptagonal.rb

@@ -1,5 +0,0 @@
-class Integer
-  def heptagonal?
-    n_gonal?(7)
-  end
-end

data/lib/numb/hexagonal.rb

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

data/lib/numb/highly_abundant.rb

@@ -1,7 +0,0 @@
-# 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

@@ -1,12 +0,0 @@
-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
-
-  alias :julian? :highly_composite?
-end

data/lib/numb/hoax.rb

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

@@ -1,7 +0,0 @@
-# coding: utf-8
-class Integer
-  def hyperperfect?(k=1)
-    raise ArgumentError unless k >= 1
-    (1 + (k * (σ - self - 1))) == self
-  end
-end

data/lib/numb/impolite.rb

@@ -1,6 +0,0 @@
-# coding: utf-8
-class Integer
-  def impolite? 
-    not polite?
-  end
-end

data/lib/numb/infinitary_divisors.rb

@@ -1,15 +0,0 @@
-# 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

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

data/lib/numb/interprime.rb

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

data/lib/numb/k_perfect.rb

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

data/lib/numb/mersenne_prime.rb

@@ -1,5 +0,0 @@
-class Integer
-  def mersenne_prime?
-    mersenne? and prime?
-  end
-end

data/lib/numb/minimal.rb

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

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

@@ -1,5 +0,0 @@
-class Integer
-  def myriagonal?
-    n_gonal?(10_000)
-  end
-end

data/lib/numb/n_gonal.rb

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

data/lib/numb/next_prev_prime.rb

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

@@ -1,17 +0,0 @@
-# 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

@@ -1,22 +0,0 @@
-# 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 τ 
-    # TODO: Consider something simpler, and perhaps faster, like
-    # primaries.map(&:last).map(&:succ).reduce(:*)
-    n = self
-    return @nod if defined?(@nod)
-    @nod = (1..isqrt).
-      map {|i|  n.quo(i).to_i - (n - 1).quo(i).to_i }.
-      reduce(:+) * 2
-    @nod -= 1 if square?
-    @nod
-  end
-
-
-  alias :number_of_divisors :τ 
-  alias :d :τ 
-end

data/lib/numb/octagonal.rb

@@ -1,5 +0,0 @@
-class Integer
-  def octagonal?
-    n_gonal?(8)
-  end
-end

data/lib/numb/ore.rb

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

@@ -1,5 +0,0 @@
-class Integer
-  def pentagonal?
-    n_gonal?(5)
-  end
-end

data/lib/numb/perfect.rb

@@ -1,8 +0,0 @@
-# coding: utf-8
-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  
-    k_perfect?(2)
-  end
-end

data/lib/numb/perfect_power.rb

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

data/lib/numb/polite.rb

@@ -1,7 +0,0 @@
-# coding: utf-8
-class Integer
-  def polite? 
-    return true if self == 1
-    politeness.positive?
-  end
-end

data/lib/numb/powerful.rb

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

data/lib/numb/practical.rb

@@ -1,26 +0,0 @@
-# coding: utf-8
-class Integer
-  # Implementation of Stewart, B. M. (1954), "Sums of distinct divisors",
-  # American Journal of Mathematics 76: 779–785, doi:10.2307/2372651,
-  # MR0064800
-  def practical?
-    sum = 1
-    k = 2
-    n = self
-    while (n >= k)
-      s = 1
-      u = 0
-      while (n % k == 0)
-        n = n/k
-        s = s * k + 1
-        u += 1
-      end
-      unless (u == 0)
-        return false if (k > sum + 1)
-        sum *= s
-      end
-      k += (k == 2) ? 1 : 2
-    end
-    true
-  end
-end

data/lib/numb/prime_count.rb

@@ -1,16 +0,0 @@
-# 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

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

data/lib/numb/primitive_pseudoperfect.rb

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

data/lib/numb/rhonda.rb

@@ -1,6 +0,0 @@
-class Integer
-  def rhonda?(base=10)
-    d = base == 10 ? digits : to_s(base).split(//).map{|_| _.to_i(base)} 
-    d.reduce(:*) == base * (prime_factors.reduce(:+) || 0)
-  end
-end

data/lib/numb/rough.rb

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

data/lib/numb/safe_prime.rb

@@ -1,5 +0,0 @@
-class Integer
-  def safe_prime?
-    prime? and odd? and ((self - 1) / 2).prime?
-  end
-end

data/lib/numb/semiperfect.rb

@@ -1,20 +0,0 @@
-# coding: utf-8
-class Integer
-   def semiperfect?
-     return false if deficient?
-     return true if perfect?
-     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
-         return true if x == self or x == proper_sod 
-         possibles[x] = true if x < self        
-       end
-       sod -= divisor
-     end
-     false
-   end
-  alias :pseudoperfect? :semiperfect?
-end

data/lib/numb/semiprime.rb

@@ -1,6 +0,0 @@
-# coding: utf-8
-class Integer
-  def semiprime?
-    Ω == 2
-  end
-end

data/lib/numb/smith.rb

@@ -1,7 +0,0 @@
-# coding: utf-8
-class Integer
-  def smith?
-    return false if prime?
-    digital_sum == prime_division.map{|d,e| d.digital_sum * e}.reduce(:+)
-  end
-end

data/lib/numb/smooth.rb

@@ -1,5 +0,0 @@
-class Integer
-  def smooth?(b)
-    prime_factors.none?{|f| f > b}
-  end
-end

data/lib/numb/sociable.rb

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

data/lib/numb/sophie_germain_prime.rb

@@ -1,5 +0,0 @@
-class Integer
-  def sophie_germain_prime?
-    prime? and (2*self).succ.prime?
-  end
-end