Merge pull request #3 from Sondren1288/Sondren1288-patch-1

Added new functions

Author: Sondren1288

functions.py

@@ -51,6 +51,32 @@ def find_primes(upper_bound):
 	return primes
 
 
+def prime_factors(num):
+	"""
+	Finds the smallest primes that divide a number.
+	For unique primes, turn the list into a set.
+	Example: 	120 / 2 = 60
+				60 / 2 = 30
+				30 / 2 = 15
+				15 / 3 = 5
+				5 is prime.
+				returns [2, 2, 2, 3, 5]
+	"""
+	primes = find_primes(int(math.sqrt(num + 1))) # Finds all primes that might be a factor
+	factors = []
+
+	for prime in primes:
+
+		if prime >= num + 1: 	# If prime is bigger than the number, it is no longer divisible
+			break				# So for long lists, quitting earlier is faster
+
+		while num % prime == 0:
+			num = num // prime 	# Divides the number by the prime, so that we can see how many times
+			factors.append(prime) # a number is divisible by a prime
+
+	return factors
+
+
 def factorial(num):
 	"""
 	The factorial of a number.
@@ -67,6 +93,29 @@ def factorial(num):
 	return product
 
 
+def zeros(dimensions):
+	"""
+	Attempted clone of numpy zeros.
+	Not as quick, but might be useful if long lists are desired
+	and numpy not available.
+	"""
+	x = y = None
+	try:
+		y, x = dimensions 	# If it cannot unpack it as tuple, it will fail
+	except TypeError:
+		x = dimensions		# If it fails, it will standard to 1 row
+		y = 1
+	
+	zeros = []
+	if y == 1:
+		zeros += [0]*x
+	else:
+		for row in range(y): 	# Makes rows with columns of 0
+			zeros.append([0]*x)
+	
+	return zeros
+
+
 def louville_distance(precision):
 	"""
 	Finds the distance between in zeroes between 2 '1's in the