Add more docstrings to solutions

10.py

@@ -1,6 +1,9 @@
 from math import sqrt
 
 def prime(n):
+  """
+  Naive prime checker
+  """
 	for i in range(2, int(sqrt(n) + 1)):
 		if n % i == 0:
 			return False
@@ -15,4 +18,4 @@ while primes[-1] < 2000000:
 		primes.append(i)
 
 primes.pop()
-print(sum(primes))
+print(sum(primes))

12.py

@@ -1,6 +1,9 @@
 from math import sqrt
 
 def FindAllDivisors(x):
+  """
+  Returns number of divisors for given number
+  """
 	divList = []
 	y = 1
 	while y <= sqrt(x):
@@ -17,4 +20,4 @@ while True:
 		print(trianglenumber)
 		break
 	else:
-		numgen += 1
+		numgen += 1

2.py

@@ -15,4 +15,4 @@ for i in range(33):
 	if fiblist[i] % 2 == 0:
 		summation += fiblist[i]
 
-print(summation)
+print(summation)