diff --git a/exercises/code/3_1_d_2_sol.py b/exercises/code/3_1_d_2_sol.py
index a414723..e7031ee 100644
--- a/exercises/code/3_1_d_2_sol.py
+++ b/exercises/code/3_1_d_2_sol.py
@@ -1,6 +1,6 @@
-prime : int = int(input("Gebe eine Zahl ein: "))
+prime: int = int(input("Gebe eine Zahl ein: "))
 
-isPrime : bool = True
+isPrime: bool = True
 if prime <= 1:
     isPrime = False
 else:
diff --git a/exercises/code/fib_down.py b/exercises/code/fib_down.py
index 2f600b1..d3e4c33 100644
--- a/exercises/code/fib_down.py
+++ b/exercises/code/fib_down.py
@@ -1,11 +1,10 @@
 def fib_normal(n: int):
     elements = [0, 1]
     for i in range(n):
-        elements.append(elements[i] + elements[i+1])
+        elements.append(elements[i] + elements[i + 1])
 
     for i in range(n):
         # Man beachte hier das Element an der Stelle 0 wird hier nicht ausgegeben da n-i minimal 1 werden kann
-        print(elements[n-i])
+        print(elements[n - i])
 
 fib_normal(10)
-
diff --git a/exercises/code/fib_up.py b/exercises/code/fib_up.py
index c20c40b..ce98caa 100644
--- a/exercises/code/fib_up.py
+++ b/exercises/code/fib_up.py
@@ -16,7 +16,7 @@ def fib_normal(n: int):
 x: str = input()
 y: str = input()
 
-def mod(a: int, b:int):
+def mod(a: int, b: int):
     return a % b
 
 
@@ -28,5 +28,3 @@ def mod(a: int, b:int):
 
 elif x % 4 == 0:
     ...
-
-