diff --git a/Data/Numbers.hs b/Data/Numbers.hs
--- a/Data/Numbers.hs
+++ b/Data/Numbers.hs
@@ -1,16 +1,16 @@
 -- | This is an assortment of number theorectic functions. As of now it's not very large or fast, but that should improve over time.
-module Data.Numbers where
+module Data.Numbers 
+(
+    primes,
+    isPrime,
+    primeFactors,
+    numOfFactors,
+    factorSum,
+    factors) where
 
 import Data.List
+import Data.Numbers.Primes
 
--- | An infinite list of prime numbers
-primes :: [Integer]
-primes = 2:3:primes'
-  where
-    1:p:candidates = [6*k+r | k <- [0..], r <- [1,5]]
-    primes'        = p : filter isPrime candidates
-    divides n p    = n `mod` p == 0
-    
 
 -- | Checks whether a number is prime    
 isPrime :: Integer -> Bool
diff --git a/Numbers.cabal b/Numbers.cabal
--- a/Numbers.cabal
+++ b/Numbers.cabal
@@ -1,5 +1,5 @@
 Name:                Numbers
-Version:             0.0
+Version:             0.1
 Cabal-Version: >= 1.2
 Synopsis:            An assortment of number theoretic functions
 Description:         Functions for finding prime numbers, checking whether a number is prime, finding the factors of a number etc.
diff --git a/test.hs b/test.hs
--- a/test.hs
+++ b/test.hs
@@ -1,5 +1,4 @@
 import Data.Numbers
-
 import Data.List
 
 test_primes = take 1000 primes == take 1000 check where