[pre-commit.ci] auto fixes from pre-commit.com hooks

for more information, see https://pre-commit.ci

Author: pre-commit-ci[bot]

maths/fermat_little_theorem.py

@@ -4,6 +4,7 @@
 # Here we assume that p is a prime number, b divides a, and p doesn't divide b
 # Wikipedia reference: https://en.wikipedia.org/wiki/Fermat%27s_little_theorem
 
+
 def binary_exponentiation(a: int, n: float, mod: int) -> int:
     """
     Compute (a^n) % mod using binary exponentiation.