1 files changed, 18 insertions, 18 deletions

diff --git a/AufgabeFFP2.hs b/AufgabeFFP2.hs
index 7ed19fc..aef3bfb 100644
--- a/AufgabeFFP2.hs
+++ b/AufgabeFFP2.hs
@@ -6,33 +6,33 @@ where
 -- primality check
 isPrime :: Integer -> Bool
 isPrime n = n > 1 &&
-        foldr (\p r -> 
-                p*p > n 
-                || (
-                        (n `mod` p) /= 0 
-                        && r
-                )
-        )
-        True primes
-        
+  foldr (\p r ->
+    p*p > n
+    || (
+      (n `mod` p) /= 0
+      && r
+    )
+  )
+  True primes
+
 -- series of primes
 primes :: [Integer]
 primes = 2:filter isPrime [3,5..]
 
--- pairs of (p,p+2) | p,p+2 <- primes 
+-- pairs of (p,p+2) | p,p+2 <- primes
 -- generate all pairs with map and then filter only the valid ones
 -- pair is valid if the second component n is a prime
 pps :: [(Integer, Integer)]
 pps = filter (\(_,x) -> isPrime x) $ map (\p -> (p,p+2)) primes
-                                
+
 -------------------------------------------------------------------------------
 
 -- 2
 
--- generates powers of 2        
+-- generates powers of 2
 pof2s :: [Integer]
 pof2s = [1] ++ map (2*) pof2s
-        
+
 -- calculates 2^n
 pow :: Int -> Integer
 pow 0 = 1
@@ -70,7 +70,7 @@ f z k = g z k h
 -- actual function g (converts Int to Integer for more precision)
 g :: Int -> Int -> (Integer -> Integer -> Float) -> Float
 g z k h = sum $ map (h $ fromIntegral z) [0..(fromIntegral k)]
-        
+
 -- helper function h using mem-table for the power-series (z^i) and for factorial (i!)
 hMT :: Integer -> Integer -> Float
 hMT z i = (fromInteger $ pofNs z !! (fromInteger i)) / (fromInteger $ facs !! (fromInteger i))
@@ -86,15 +86,15 @@ h z i =  (fromInteger $ z^i) / (fromInteger $ fac i)
 -- gets the digits of an integer as a list
 digits :: Integer -> [Integer]
 digits x
-        | x<=0 = []
-        | otherwise = (digits $ x `div` 10)++[x `mod` 10]
+  | x<=0 = []
+  | otherwise = (digits $ x `div` 10)++[x `mod` 10]
 
 -- calculates the goedel-number for the given integer
 -- returns 0 for non-positive numbers
 gz :: Integer -> Integer
 gz n
-        | n<=0 = 0
-        | otherwise = product $ zipWith (^) primes (digits n)
+  | n<=0 = 0
+  | otherwise = product $ zipWith (^) primes (digits n)
 
 -- goedel-number generator
 gzs :: [Integer]