euler 1.0.5 → 1.0.7

data.tar.gz.sig

@@ -1 +1,2 @@
-v�����Y=��՛�A��d�E�9�f="�̶���ӓVg�Lz�Y�_����&ɔ�u���0�o��ì@��n�ߛ(W[z�D��D;��|�,��q�����Ҵ-�܏��%�Z�Ő�ZĭEC�tL6��8��C�HJ��+�n�3Z�Uw�[����t��Z�^n!:E&�j7ֹV��-y��d�	�eԃ�X��[3��.�2
…d���v�[�G�~�^����mu��|��5_?gER\�s�&�x1%�
j�2
+�fu]K~��z��
+�Ы�������6�ɖ��s
��	�<�1_�ΣB�y�י{M�B�ʉ^�O�FS)-�\�\B6���k{	���2�:�e�'8�w��o�
����
G)�Q��d6C�������/&��X7?k����B!��.��wNzM.j �/�K+���Q���D�Nw{�?�l}s�-�e�?��S�U�z�ߍ��

data/History.txt

@@ -1,3 +1,9 @@
+=== 1.0.7 /
+ * Fixed error in Integer#prime_factors
+
+=== 1.0.6 /
+ * Fixed an error in Integer#prime_factors
+
 === 1.0.5 /
  * Fixed another error in Integer#is_fibonacci?
 

data/lib/euler.rb

@@ -1,6 +1,6 @@
 # The module that contains all the methods.
 module Euler
-  VERSION = "1.0.5"
+  VERSION = "1.0.7"
   extend self
   attr_reader :primes, :sieve, :fibonaccis
   # Several methods for the Integer class.
@@ -18,22 +18,22 @@ module Euler
     def prime_factors
       return [self] if self.prime?
       current, to_factor, factors, max = 2, self, [], 0
-      # current is the value currently being tested to_factor is the value
-      # being factored (slowly moves to a prime value) factors is the array of
+      # current is the value currently being tested. to_factor is the value
+      # being factored (slowly moves to a prime value). factors is the array of
       # prime factors max is the maximum value of any factor set after the
       # next loop
       while to_factor % current == 0
-        factors << 2
+        factors << current
         to_factor /= current
       end
       current += 1
       max = Math.sqrt(to_factor).to_i + 1
-      while to_factor <= max
+      while to_factor >= max
         if to_factor % current == 0
           factors << current
           to_factor /= current
         else
-          i += 2
+          current += 2
         end
       end
       factors << to_factor if to_factor > 1
@@ -113,6 +113,7 @@ module Euler
     end
   end
 
+
   # A basic prime sieve. Sets Euler.sieve to an array of boolean values that
   # indicate if that index if prime or not.
   #   Euler.generate_sieve(50)

data/test/tc_integer_methods.rb

@@ -12,6 +12,7 @@ class TestIntegerMethods < Test::Unit::TestCase
   def test_prime_factors
     assert_equal([2, 5], 10.prime_factors, "10 factors into 2 and 5.")
     assert_equal([2, 2, 5], 20.prime_factors, "20 factors into 2, 2, and 5.")
+    assert_equal([2, 2, 7, 23], 644.prime_factors, "644 factors into 2, 2, 7, and 23.")
   end
   
   def test_primality

data/test/test_euler.rb

@@ -1,4 +1,4 @@
-#!/usr/bin/ruby
+#!/usr/bin/env ruby
 require 'test/unit/testsuite'
 require 'tc_integer_methods.rb'
-require 'tc_module.rb'
+require 'tc_module.rb'

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification 
 name: euler
 version: !ruby/object:Gem::Version 
-  version: 1.0.5
+  version: 1.0.7
 platform: ruby
 authors: 
 - Mike Skalnik
@@ -30,7 +30,7 @@ cert_chain:
   jjVX87g40jCN9NIGt+c=
   -----END CERTIFICATE-----
 
-date: 2008-10-12 00:00:00 -04:00
+date: 2008-12-16 00:00:00 -05:00
 default_executable: 
 dependencies: 
 - !ruby/object:Gem::Dependency 
@@ -41,7 +41,7 @@ dependencies:
     requirements: 
     - - ">="
       - !ruby/object:Gem::Version 
-        version: 1.7.0
+        version: 1.8.2
     version: 
 description: A gem that provides a small library to help in removing the repetativeness of solving Project Euler problems.
 email: 
@@ -86,7 +86,7 @@ required_rubygems_version: !ruby/object:Gem::Requirement
 requirements: []
 
 rubyforge_project: euler
-rubygems_version: 1.2.0
+rubygems_version: 1.3.1
 signing_key: 
 specification_version: 2
 summary: A small library to help solve Projet Euler problems.