r_math_plus 0.0.1 → 0.0.2

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: 3a7bdad3ee832e67e60f81b058983001b616a6c9
-  data.tar.gz: 4c7b07dc511d2281bd3abe4109b86b570533d4e1
+  metadata.gz: e135a6e685d9c1924db601d4b2120bc09063f5e1
+  data.tar.gz: ab25aa59e62189c58102e1f30ec924f29731af3e
 SHA512:
-  metadata.gz: 91ee88368dd92c311b6beec7ebc9036dc76b711b229f8296c2c6d1b9ede210cf5d55767566787b49a5a550c0a1020437d381f95bac6cd851bac2b02d9c01ef21
-  data.tar.gz: 16150e3d61bdaa74a17cab523972d4bb67e29aa6dc0f0507afb8d75088e7dc78e566929a005b827089225a3c4b435864eb5d4b5305db68db7edd10b911bebaab
+  metadata.gz: 7b37745cdd3d90342f551862fb83d1ec010bbd476741c73b75069e729314b9768e63d52248ed26f8509e56cb1b0aca06b9053396880d07f06cb253582ec82767
+  data.tar.gz: f77f7ef336ca69e30e6514be34fcaf97246c27e5b826d721d342af3ecbe70885005d85841cb39d60806d9dcb217134a0712e0ae80caeee4f0f0113292e4e4b4d

data/README.md

@@ -43,6 +43,11 @@ The '.prime_array' method takes an integer as a parameter and returns an array w
 RMathPlus.prime_array(10) # => [2,3,5,7]
 ```
 
+'.nth_prime' returns the first 'n' primes passed as a parameter to the method:
+```ruby
+RMathPlus.nth_prime(3) # => [2,3,5]
+```
+
 '.prime_factors' returns an array of the prime factors of a given number n. If n is a prime, it will return n.
 Ex:
 ```ruby

data/lib/r_math_plus.rb

@@ -35,6 +35,29 @@ module RMathPlus
     return prime_array
   end
 
+  def self.nth_prime(n) #returns an array with all primes less than number n.
+    if n <= 1
+      if n == 1
+        return [2]
+      end
+      if n < 1
+        raise "Wops, there's no 0th prime!"
+      end
+    end
+    prime_array = [2]
+    i = 2
+    array_size = 1 # compares faster than running prime_array.size on each loop
+    while true
+      i += 1
+      if RMathPlus.is_prime?(i,prime_array) # the own prime_array built so far is passed as an argument in order to improve processing speed.
+        prime_array.push(i)
+        array_size += 1
+        break if array_size == n
+      end
+    end
+    return prime_array
+  end
+
   def self.prime_factors(number, biggest_number_prime_array=false) #returns the prime factors of a given number. if n is prime, returns n. second parameter to improve speed if method would be utilized in a range of numbers.
     factors = []
     if biggest_number_prime_array

data/lib/r_math_plus/version.rb

@@ -1,3 +1,3 @@
 module RMathPlus
-  VERSION = "0.0.1"
+  VERSION = "0.0.2"
 end

data/r_math_plus.gemspec

@@ -9,7 +9,7 @@ Gem::Specification.new do |spec|
   spec.authors       = ["Otávio Monteagudo"]
   spec.email         = ["oivatom@gmail.com"]
   spec.summary       = %q{ Math operations to use in puzzles. }
-  spec.description   = %q{ Some extra math ops to the standard library which include prime number operations and the least common multiple of an array of numbers. }
+  spec.description   = %q{ Some extra math ops to the standard library which include prime number operations and the least common multiple of an array of numbers. See the Documentation link below for further details.}
   spec.homepage      = "https://github.com/otamm/RMathPlus"
   spec.license       = "MIT"
 

data/spec/r_math_plus_spec.rb

@@ -42,6 +42,17 @@ describe RMathPlus do
 
   end
 
+  describe ".nth_prime" do
+
+    it "returns an array with the first n primes" do
+      expect(RMathPlus.nth_prime(3)).to eq [2,3,5]
+    end
+
+    it "returns first prime if n == 1" do
+      expect(RMathPlus.nth_prime(1)).to eq [2]
+    end
+  end
+
   describe ".prime_factors" do
 
     it "returns repeated prime factors of a given number" do

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: r_math_plus
 version: !ruby/object:Gem::Version
-  version: 0.0.1
+  version: 0.0.2
 platform: ruby
 authors:
 - Otávio Monteagudo
 autorequire: 
 bindir: bin
 cert_chain: []
-date: 2015-03-05 00:00:00.000000000 Z
+date: 2015-03-10 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: bundler
@@ -53,7 +53,8 @@ dependencies:
       - !ruby/object:Gem::Version
         version: 3.0.0
 description: " Some extra math ops to the standard library which include prime number
-  operations and the least common multiple of an array of numbers. "
+  operations and the least common multiple of an array of numbers. See the Documentation
+  link below for further details."
 email:
 - oivatom@gmail.com
 executables: []
@@ -91,7 +92,7 @@ required_rubygems_version: !ruby/object:Gem::Requirement
       version: '0'
 requirements: []
 rubyforge_project: 
-rubygems_version: 2.2.2
+rubygems_version: 2.4.6
 signing_key: 
 specification_version: 4
 summary: Math operations to use in puzzles.