From 61865bdaa487ad6a360a12cea0baf656dbd494a6 Mon Sep 17 00:00:00 2001
From: matt chisholm <matt@theory.org>
Date: Thu, 19 Jan 2012 00:42:07 +0100
Subject: [PATCH] preserve prime^2 for use in factoring

---
 sieve.py | 6 +++---
 1 file changed, 3 insertions(+), 3 deletions(-)

diff --git a/sieve.py b/sieve.py
index 376d2f8..dc107c0 100644
--- a/sieve.py
+++ b/sieve.py
@@ -18,14 +18,14 @@ def relatively_prime(n):
     while True:
         n += 1
         if relatively_prime(n):
-            yield n
             primes.append((n, n**2))
+            yield primes[-1]
 
 
 def factor(n):
     """Factor an integer into its unique prime factorization."""
-    for p in primes():
-        if p > n: 
+    for p, p2 in primes():
+        if n < p2:
             break
         while n % p == 0:
             yield p