Uploaded solutions that I had on my local drive

Author: sevyatar

1.py

@@ -0,0 +1,10 @@
+LIMIT = 1000
+MULTIPLE_1 = 3
+MULTIPLE_2 = 5
+
+sum = 0
+for i in range(LIMIT):
+	if (i % MULTIPLE_1 == 0 or i % MULTIPLE_2 == 0):
+		sum += i
+		
+print sum

10.py

@@ -0,0 +1,23 @@
+import math
+
+LIMIT = 2000000
+
+def IsPrime(number):
+	if (number == 2):
+		return True
+		
+	for i in range(2, int(math.ceil(math.sqrt(number))) + 1):
+		if (number % i == 0):
+			return False
+
+	return True
+	
+def CalculateSum():
+	sum = 0
+	for i in range(2, LIMIT):
+		if (IsPrime(i)):
+			sum += i
+			
+	return sum
+	
+print CalculateSum()

2.py

@@ -0,0 +1,15 @@
+LIMIT = 4000000
+
+sum = 0
+prev = 1
+current = 2
+
+while current < LIMIT:		
+	if (current % 2 == 0):
+		sum += current
+		
+	new_current = prev + current
+	prev = current	
+	current = new_current
+			
+print sum

20.py

@@ -0,0 +1,21 @@
+import math
+
+FACTORIAL = 100
+
+def GetDigitSum(number):
+	number_string = str(number)
+	sum = 0
+	for ch in number_string:
+		sum += int(ch)
+		
+	return sum
+	
+def CalcFactorial():
+	factorial = 1
+	for i in range(1, FACTORIAL):
+		factorial *= i
+		
+	return factorial
+	
+	
+print GetDigitSum(CalcFactorial())

3.py

@@ -0,0 +1,26 @@
+import math
+
+NUMBER = 600851475143
+#NUMBER = 13195
+#NUMBER = 10
+
+def FindBiggestDivider(number):
+	current_number = number
+	biggest_divider = 0
+	
+	while True:
+		i = 2 
+		while (i < int(math.ceil(current_number / 2)) + 1):
+			if (current_number % i == 0):
+				biggest_divider = max(biggest_divider, i)
+				current_number = current_number / i
+				break
+			i += 1
+			
+		if (i == int(math.ceil(current_number / 2)) + 1):
+			biggest_divider = max(biggest_divider, current_number)
+			break
+			
+	return biggest_divider
+	
+print "Biggest Divider: " + str(FindBiggestDivider(NUMBER))

30.py

@@ -0,0 +1,35 @@
+import math
+
+POWER = 5
+
+SEARCH_MIN = 2
+SEARCH_MAX = (9 ** POWER) * 10
+
+def GetDigitPowerSum(number):
+	number_string = str(number)
+	sum = 0
+	for ch in number_string:
+		sum += int(ch) ** POWER
+		
+	return sum
+	
+def CheckNumber(number):
+	power_sum = GetDigitPowerSum(number)
+	
+	if (number > power_sum):
+		return 1
+	elif (number < power_sum):
+		return -1
+	else:
+		return 0
+	
+def FindSum():
+	sum = 0
+
+	for i in range(SEARCH_MIN, SEARCH_MAX):
+		if (CheckNumber(i) == 0):
+			sum += i
+			
+	return sum
+		
+print FindSum()

4.py

@@ -0,0 +1,37 @@
+import math
+
+MIN_SEARCH_NUMBER = 900
+MAX_NUMBER = 1000
+
+#BASE_NUMBER = 99
+#MIN_SEARCH_NUMBER = 10
+#MAX_NUMBER = 100
+
+def IsPalindrome(number):
+	string_number = str(number)
+	length = len(string_number)
+	for i in range(length):
+		if (string_number[i] != string_number[length - i - 1]):
+			return False
+			
+	return True
+
+def Run():
+	max_palindrome = 0
+	number1 = MIN_SEARCH_NUMBER
+	while (number1 < MAX_NUMBER):
+		number2 = number1
+		while (number2 < MAX_NUMBER):
+			multiple = number1 * number2
+			#print multiple
+			if (IsPalindrome(multiple)):
+				max_palindrome = max(max_palindrome, multiple)
+			number2 += 1
+			
+		number1 += 1
+	
+	print max_palindrome
+
+	
+	
+Run()

40.py

@@ -0,0 +1,37 @@
+import math
+
+INDEXES_TO_MULTIPLY = [1, 10, 100, 1000, 10000, 100000, 1000000]
+#INDEXES_TO_MULTIPLY = [1, 10, 100, 1000, 10000, 100000]
+#INDEXES_TO_MULTIPLY = [1, 10, 100]
+
+def CreateDigitsString():
+	global digits_string
+	
+	string_list = list("0" * INDEXES_TO_MULTIPLY[len(INDEXES_TO_MULTIPLY) - 1])
+	current_index = 0
+	i = 1
+	while (current_index < len(string_list)):
+		new_string = str(i)
+		for ch in new_string:
+			if (current_index >= len(string_list)):
+				break
+				
+			string_list[current_index] = ch
+			current_index += 1
+			
+		i += 1
+		
+	digits_string = "".join(string_list)
+		
+
+def Calculate():
+	global digits_string
+	CreateDigitsString()
+	
+	product = 1
+	for i in INDEXES_TO_MULTIPLY:
+		product *= int(digits_string[i - 1])
+		
+	return product
+			
+print Calculate()

5.py

@@ -0,0 +1,21 @@
+import math
+
+DIVISORS = range(1,20)
+
+def CheckNumber(number):
+	for divisor in DIVISORS:
+		if (number % divisor != 0):
+			return False
+			
+	return True
+
+# must be even, must end with 0
+def FindNumber():
+	i = 20
+	while True:
+		if (CheckNumber(i)):
+			return i
+			
+		i += 20
+
+print FindNumber()

50.py

@@ -0,0 +1,52 @@
+import math
+from copy import copy
+
+LIMIT = 1000000
+
+def IsPrime(number):
+	if (number == 2):
+		return True
+		
+	for i in range(2, int(math.ceil(math.sqrt(number))) + 1):
+		if (number % i == 0):
+			return False
+
+	return True
+	
+def CreatePrimesList():
+	list = []
+	for i in range(2, LIMIT):
+		if (IsPrime(i)):
+			list.append(i)
+			
+	return list
+	
+def FindLongestSumPrime():
+	primes_list = CreatePrimesList()
+
+	longest_terms_list_length = 0
+	longest_sum = 0
+		
+	for i in primes_list:		
+		current_terms_list_length = 1
+		current_sum = i
+			
+		for j in primes_list:
+			if (j <= i):
+				continue
+
+			current_sum += j
+			current_terms_list_length += 1
+				
+			if (current_sum >= LIMIT):
+				break
+						
+			if (IsPrime(current_sum)):
+				if (current_terms_list_length > longest_terms_list_length):
+					longest_terms_list_length = current_terms_list_length
+					longest_sum = current_sum
+					
+	print longest_terms_list_length			
+	return longest_sum
+			
+print FindLongestSumPrime()

6.py

@@ -0,0 +1,13 @@
+import math
+
+LIMIT = 100
+
+def FindSquareDifference():
+	final_sum = 0
+	for i in range(1, LIMIT + 1):
+		for j in range(i+1, LIMIT + 1):
+			final_sum += 2*i*j
+			
+	return final_sum
+
+print FindSquareDifference()

7.py

@@ -0,0 +1,24 @@
+import math
+
+PRIME_INDEX = 10001
+
+def IsDividable(number, divisors):
+	for i in divisors:
+		if (number % i == 0):
+			return True
+			
+	return False
+
+def FindPrime(index):
+	primes_list = [2]
+	current_number = 3
+	
+	while (len(primes_list) < index):
+		if (not IsDividable(current_number, primes_list)):
+			primes_list.append(current_number)
+		
+		current_number += 2
+		
+	return primes_list[len(primes_list) - 1]
+	
+print FindPrime(PRIME_INDEX)

8.py

@@ -0,0 +1,18 @@
+import math
+
+LONG_NUMBER = "7316717653133062491922511967442657474235534919493496983520312774506326239578318016984801869478851843858615607891129494954595017379583319528532088055111254069874715852386305071569329096329522744304355766896648950445244523161731856403098711121722383113622298934233803081353362766142828064444866452387493035890729629049156044077239071381051585930796086670172427121883998797908792274921901699720888093776657273330010533678812202354218097512545405947522435258490771167055601360483958644670632441572215539753697817977846174064955149290862569321978468622482839722413756570560574902614079729686524145351004748216637048440319989000889524345065854122758866688116427171479924442928230863465674813919123162824586178664583591245665294765456828489128831426076900422421902267105562632111110937054421750694165896040807198403850962455444362981230987879927244284909188845801561660979191338754992005240636899125607176060588611646710940507754100225698315520005593572972571636269561882670428252483600823257530420752963450"
+CONSECUTIVE_DIGITS = 5
+
+def FindBiggestProduct():
+	biggest_product = 0
+	long_number_length = len(LONG_NUMBER)
+	for i in range(long_number_length - CONSECUTIVE_DIGITS):
+		product = 1
+		for j in range(CONSECUTIVE_DIGITS):
+			product *= int(LONG_NUMBER[i + j])
+			
+		biggest_product = max(biggest_product, product)
+	
+	return biggest_product
+	
+print FindBiggestProduct()

9.py

@@ -0,0 +1,24 @@
+import math
+
+REQUIRED_SUM = 1000
+LARGEST_A_VALUE = int(math.ceil(REQUIRED_SUM / 3))
+LARGEST_B_VALUE = int(math.ceil(REQUIRED_SUM / 2))
+
+def IsTripletLegal(a, b, c):
+	if (a + b + c != 1000):
+		return False
+		
+	if ((a*a) + (b*b) != (c*c)):
+		return False
+		
+	return True
+
+def FindTriplet():
+	for a in range(1, LARGEST_A_VALUE + 1):
+		for b in range(a + 1, LARGEST_B_VALUE + 1):
+			c = 1000 - a - b
+			if (IsTripletLegal(a, b, c)):
+				return ([a,b,c])
+	
+[a,b,c] = FindTriplet()
+print a * b * c