BedirYilmaz
/ Soru12.py
Created
October 24, 2016 09:16
Find the value of the first triangle number to have over five hundred divisors?
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| def numberofdivisors(n): | |
| count = 0 | |
| for x in range(1,n+1): | |
| if n%x ==0: | |
| count+=1 | |
| return count; | |
| def summer(n): | |
| sum = 0 | |
| for x in range(1,n): |
BedirYilmaz
/ Soru11.py
Created
October 23, 2016 18:23
Find the greatest product of four adjacent numbers in the same direction (up, down, left, right, or diagonally) in the 20×20 grid.
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| thevalues = [[8, 2, 22, 97, 38, 15, 0, 40, 0, 75, 4, 5, 7, 78, 52, 12, 50, 77, 91, 8], | |
| [49, 49, 99, 40, 17, 81, 18, 57, 60, 87, 17, 40, 98, 43, 69, 48, 4, 56, 62, 0], | |
| [81, 49, 31, 73, 55, 79, 14, 29, 93, 71, 40, 67, 53, 88, 30, 3, 49, 13, 36, 65], | |
| [52, 70, 95, 23, 4, 60, 11, 42, 69, 24, 68, 56, 1, 32, 56, 71, 37, 2, 36, 91], | |
| [22, 31, 16, 71, 51, 67, 63, 89, 41, 92, 36, 54, 22, 40, 40, 28, 66, 33, 13, 80], | |
| [24, 47, 32, 60, 99, 3, 45, 2, 44, 75, 33, 53, 78, 36, 84, 20, 35, 17, 12, 50], | |
| [32, 98, 81, 28, 64, 23, 67, 10, 26, 38, 40, 67, 59, 54, 70, 66, 18, 38, 64, 70], | |
| [67, 26, 20, 68, 2, 62, 12, 20, 95, 63, 94, 39, 63, 8, 40, 91, 66, 49, 94, 21], | |
| [24, 55, 58, 5, 66, 73, 99, 26, 97, 17, 78, 78, 96, 83, 14, 88, 34, 89, 63, 72], | |
| [21, 36, 23, 9, 75, 0, 76, 44, 20, 45, 35, 14, 0, 61, 33, 97, 34, 31, 33, 95], |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| def sumPrimesErastothanesWay(n): | |
| notprime = False | |
| primemultiples = set() | |
| sum = 0 | |
| for x in range(2 , n): | |
| if x in primemultiples: | |
| notprime = True | |
| if(notprime != True): | |
| root = int(math.ceil(math.sqrt(x))) | |
| for i in range (3, root): |
BedirYilmaz
/ Soru9.py
Created
October 23, 2016 11:06
Find out the pythagorian triplet that has sides that has to 1000 as product
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| def issquarepyth(a,b,c): | |
| return (a*a + b*b) == c*c | |
| def issumok(a,b,c): | |
| return (a+b+c) == 1000 | |
| def findTriplet(): | |
| a=0 | |
| b=0 | |
| c=0 |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| def nthPrimeSqrt(n): | |
| number = 3 | |
| primemultiples = [] | |
| primes = [] | |
| primes.append(2) | |
| prime = True | |
| while (len(primes)<=n): | |
| prime = True | |
| if number in primemultiples: |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| # Special thanks to Ceyhan Yılmaz and cosinus | |
| def nthPrime(n): | |
| number = 3 | |
| primemultiples = [] | |
| primes = [] | |
| primes.append(2) | |
| prime = True | |
| while (len(primes)<=n): | |
| prime = True | |
| if number in primemultiples: |
BedirYilmaz
/ Soru5v2.py
Created
October 19, 2016 07:48
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| print(5*7*9*11*13*16*17*19) |
BedirYilmaz
/ Soru8.py
Created
October 18, 2016 11:34
Find the thirteen adjacent digits in the 1000-digit number that have the greatest product. What is the value of this product?
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| def mthndigits(number,m,n): | |
| a = str(number) | |
| return int(a[m:m+n]) | |
| def digitmultiply(number): | |
| stringfied = str(number) | |
| product = 1 | |
| for x in stringfied: | |
| product *= int(x) | |
| return product |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| def primer(n): | |
| notprime = False | |
| primecount = 0 | |
| x = 2 | |
| while True: | |
| for y in range (2, x): | |
| if x%y == 0: | |
| notprime = True | |
| break | |
| if notprime == False: |
BedirYilmaz
/ Soru6.py
Created
October 18, 2016 10:33
Find the difference between the sum of the squares of the first one hundred natural numbers and the square of the sum.
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| def sumofsquares (n): | |
| sum = 0 | |
| for x in range(1,n+1): | |
| sum += x*x | |
| return sum | |
| def squareofsum(n): | |
| sum = 0 | |
| for x in range(1,n+1): | |
| sum += x |