Refactor diophantine_equation.py for clarity

Author: Benjamin-Ferrin

blockchain/diophantine_equation.py

@@ -1,8 +1,6 @@
 from __future__ import annotations
-
 from maths.greatest_common_divisor import greatest_common_divisor
 
-
 def diophantine(a: int, b: int, c: int) -> tuple[float, float]:
     """
     Diophantine Equation : Given integers a,b,c ( at least one of a and b != 0), the
@@ -99,6 +97,7 @@ def extended_gcd(a: int, b: int) -> tuple[int, int, int]:
 
     return (d, x, y)
 
+# This is very efficient
 
 if __name__ == "__main__":
     from doctest import testmod