open_integer 0.4.0.pre.46

checksums.yaml

@@ -0,0 +1,15 @@
+---
+!binary "U0hBMQ==":
+  metadata.gz: !binary |-
+    NzcxM2RkMWZkNzA5YmNhZGVhNDI2ZDI5ZmZjOWY1YTc4OTY5YTVkOA==
+  data.tar.gz: !binary |-
+    ZTI5NTBhMzJiYWU3ODZhNDY1NzQwOTlhYmVhYjkzMTYyYzVhNmYwNw==
+SHA512:
+  metadata.gz: !binary |-
+    ZjM1MGRlMzAwOTc4N2U0ZGQyMzY1NWU3Njg4YmNmZTY0ZGUxN2ExYzg0YWEw
+    MWZiN2IwY2Y3YjFmZTc4NTA2NDgxYzc2N2EzYTU2MTViMGY0MmMwMGRkZGUx
+    YTBkM2RmYTYzNDBhNzkwMzljZTUzMmNjMjc2MGI1MDEwMTBhN2M=
+  data.tar.gz: !binary |-
+    YzBmMDZlYmNhN2Q1MDNhZDdhZDE4ZDk5ZmE4NDg4MGM4NzY4ODBjMWNlN2Fh
+    MTk4YzA1YzdhNmQ0MmE3YjQ4YzEwN2E4MDk5YjMwMWJlMmU0ZmEzNTQwNmI5
+    Njc2MDNiMDE5NmNiZWU5MDVlNWFjNjc3MWZjMzA4MjQ0OTVhN2M=

data/lib/open_integer.rb

@@ -0,0 +1,232 @@
+require 'prime'
+
+# Public: Provides extensions to the built-in Integer class.
+module OpenInteger
+  # Public: Determines if the receiver is an abundant number. A number is
+  # abundant iff the sum of its proper divisors is greater than the number
+  # itself.
+  #
+  # Returns true iff the sum of the proper divisors of the receiver is greater
+  # than the receiver.
+  def abundant?
+    divisors.reduce(:+) > self
+  end
+
+  # Public: Determines if the receiver and other are an amicable pair. Numbers a
+  # and b are amicable if the sum of the factors of a equals b, the sum of the
+  # factors of b equals a, and a is not equal to b.
+  #
+  # other - The value which may be amicable with the receiver.
+  #
+  # Returns true iff the receiver is amicable with other.
+  def amicable_with?(other)
+    factors.reduce(:+) == other &&
+      other.factors.reduce(:+) == self &&
+      self != other
+  end
+
+  # Public: An implementation of n choose k using factorials. This
+  # implementation works for all n >= k >= 0
+  #
+  # k - The k parameter of the n choose k formula.
+  #
+  # Returns the result of n choose k where n is the receiver and k is the
+  # Integer argument
+  def choose(k)
+    fail 'This implementation of n choose k only works for n >= k >= 0.' unless
+      0 <= k && k <= self
+    choose_factorial k
+  end
+
+  # Protected: An implementation of n choose k using factorials which works for
+  # values of n >= k >= 0.
+  #
+  # k - The k parameter of the n choose k formula.
+  #
+  # Returns the result of n choose k using the multiplicative impelementation.
+  def choose_factorial(k)
+    return 1 if 0 == k && k <= self
+    n_factorial = factorial
+    k_factorial = k.factorial
+    n_minus_k_factorial = (self - k).factorial
+    n_factorial / (k_factorial * n_minus_k_factorial)
+  end
+
+  # Public: Generates the Collatz sequence beginning with the receiver.
+  #
+  # Returns an enumerator if no block is given.
+  #
+  # Yields each value in the sequence as it is calculated.
+  def collatz_sequence
+    return to_enum(:collatz_sequence) unless block_given?
+    yield val = self
+    yield val = val.next_in_collatz_sequence until val == 1
+  end
+
+  # Deprecated: Determines the number of factors for the receiver.
+  #
+  # This is deprecated in favor of calling n.factors.count.
+  #
+  # Returns the number of factors the receiver has.
+  def count_factors
+    factors.count
+  end
+
+  # Public: Determines if the receiver is a deficient number. A number is
+  # deficient iff the sum of its proper divisors is less than the number itself.
+  #
+  # Returns true iff the sum of the proper divisors of the receiver is less than
+  # the receiver.
+  def deficient?
+    divisors.reduce(:+) < self
+  end
+
+  # Public: Finds all proper divisors of the receiver. Proper divisors of a
+  # number n are positive divisors of n excluding n itself.
+  #
+  # See the definition at Wolfram MathWorld for more details.
+  # http://mathworld.wolfram.com/ProperDivisor.html
+  #
+  # Returns the proper divisors of the receiver.
+  # Raises RuntimeError if called on an Integer less than 1.
+  #
+  # Yields each proper divisors as it is identified.
+  def divisors
+    fail 'Integers less than 1 do not have proper divisors.' if self < 1
+    return to_enum(:divisors) unless block_given?
+    top = self == 1 ? 1 : (self / 2).to_i
+
+    (1..top).each do |num|
+      yield num if num.factor_of? self
+    end
+  end
+
+  # Public: Determines if the receiver is a factor of other (i.e. if other is
+  # evenly divisible by the receiver).
+  #
+  # other - The Integer which may be a factor of the receiver.
+  #
+  # Returns true iff the receiver is a factor of other.
+  # Raises RuntimeError if called on 0.
+  def factor_of?(other)
+    fail 'Zero is not a factor of anything.' if self == 0
+    !other.nil? && other % self == 0
+  end
+
+  # Public: Finds factor pairs of the receiver.
+  #
+  # Returns the factor pairs of the receiver.
+  #
+  # Yields each factor pair as it is identified.
+  def factor_pairs
+    return to_enum(:factor_pairs) unless block_given?
+
+    factors.each do |factor|
+      yield [factor, self / factor]
+    end
+  end
+
+  # Public: Calculates the factorial of the receiver.
+  #
+  # Returns the factorial of the receiver.
+  def factorial
+    return 1 if self == 0
+    (1..self).inject(:*)
+  end
+
+  # Public: Finds all proper factors of the receiver. A proper factor of a
+  # positive integer n is a factor of n other than 1 or n.
+  #
+  # See the definition at Wolfram MathWorld for more details.
+  # http://mathworld.wolfram.com/ProperFactor.html
+  #
+  # Returns the proper factors of the receiver.
+  # Raises a RuntimeError if called on an Integer less than 2.
+  #
+  # Yields each proper factor as it is identified.
+  def factors
+    fail 'Integers less than 2 do not have proper factors.' if self < 2
+    return to_enum(:factors) unless block_given?
+    top = (self / 2).to_i
+
+    (2..top).each do |num|
+      yield num if num.factor_of? self
+    end
+  end
+
+  # Public: Finds the lowest prime factor of the receiver.
+  #
+  # Returns the lowest prime factor of the receiver or nil if the receiver has
+  # no prime factors.
+  def lowest_prime_factor
+    top = (Math.sqrt self).to_i
+
+    Prime.each top do |prime|
+      return prime if prime.factor_of? self
+    end
+  end
+
+  # Public: Finds the next number in the Collatz sequence using the receiver as
+  # the initial value. The Collatz sequence can be generated for successive
+  # values n by applying n / 2 if n is even or n * 3 + 1 if n is odd.
+  #
+  # Returns the next value in the Collatz sequence.
+  def next_in_collatz_sequence
+    coll = self / 2 if even?
+    coll = (self * 3) + 1 if odd?
+    coll
+  end
+
+  # Public: Finds the nth triangular number. The nth triangular number is
+  # generated by adding natural numbers up to n. For n = 7, the triangular
+  # number is 1 + 2 + 3 + 4 + 5 + 6 + 7 = 28.
+  #
+  # Returns the nth triangular number.
+  def self.nth_triangular_number(n)
+    (1..n).reduce(:+)
+  end
+
+  # Public: Determines if the receiver is a perfect number. A number is perfect
+  # iff the sum of its proper divisors is exactly equal to the number itself.
+  #
+  # Returns true iff the receiver is equal to the sum of its proper divisors.
+  def perfect?
+    divisors.reduce(:+) == self
+  end
+
+  # Public: Determines the prime factors of the receiver.
+  #
+  # Returns an Enumerator over the collection of the receiver's prime factors.
+  #
+  # Yields each prime factor as it is discovered.
+  def prime_factors
+    return to_enum(:prime_factors) unless block_given?
+    top = (Math.sqrt self).to_i
+
+    Prime.each top do |prime|
+      yield prime if prime.factor_of? self
+    end
+  end
+
+  # Public: Asks the receiver if it has any prime factors.
+  #
+  # Returns true iff the receiver has any prime factors else returns false.
+  def prime_factors?
+    !lowest_prime_factor.nil?
+  end
+
+  # Public: Determines if the three Integer arguments are a Pythagorean triplet
+  # of the form a^2 + b^2 = c^2.
+  #
+  # Returns true iff the arguments follow the form a^2 + b^2 = c^2.
+  def self.pythagorean_triplet?(a, b, c)
+    (a * a) + (b * b) == (c * c)
+  end
+
+  private :choose_factorial
+end
+
+# Public: Mixing OpenInteger extensions into Integer.
+class Integer
+  include OpenInteger
+end

metadata

@@ -0,0 +1,100 @@
+--- !ruby/object:Gem::Specification
+name: open_integer
+version: !ruby/object:Gem::Version
+  version: 0.4.0.pre.46
+platform: ruby
+authors:
+- Jason Conner
+autorequire: 
+bindir: bin
+cert_chain: []
+date: 2015-06-08 00:00:00.000000000 Z
+dependencies:
+- !ruby/object:Gem::Dependency
+  name: simplecov
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - ~>
+      - !ruby/object:Gem::Version
+        version: '0.9'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - ~>
+      - !ruby/object:Gem::Version
+        version: '0.9'
+- !ruby/object:Gem::Dependency
+  name: coveralls
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - ~>
+      - !ruby/object:Gem::Version
+        version: '0.8'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - ~>
+      - !ruby/object:Gem::Version
+        version: '0.8'
+- !ruby/object:Gem::Dependency
+  name: minitest
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - ~>
+      - !ruby/object:Gem::Version
+        version: '5'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - ~>
+      - !ruby/object:Gem::Version
+        version: '5'
+- !ruby/object:Gem::Dependency
+  name: fivemat
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - ~>
+      - !ruby/object:Gem::Version
+        version: '1.3'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - ~>
+      - !ruby/object:Gem::Version
+        version: '1.3'
+description: Various extensions for the Integer class
+email: jason.r.conner@gmail.com
+executables: []
+extensions: []
+extra_rdoc_files: []
+files:
+- lib/open_integer.rb
+homepage: https://github.com/jrconner384/open_integer
+licenses:
+- MIT
+metadata: {}
+post_install_message: 
+rdoc_options: []
+require_paths:
+- lib
+required_ruby_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - ! '>='
+    - !ruby/object:Gem::Version
+      version: 1.9.2
+required_rubygems_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - ! '>'
+    - !ruby/object:Gem::Version
+      version: 1.3.1
+requirements: []
+rubyforge_project: 
+rubygems_version: 2.4.5
+signing_key: 
+specification_version: 4
+summary: open_integer
+test_files: []