BedirYilmaz
/ Soru5.py
Last active
October 18, 2016 09:51
Find the smallest positive number that is evenly divisible by all of the numbers from 1 to 20
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 divisible (n): | |
| if(n % 7 != 0): | |
| return False | |
| if(n % 9 != 0): | |
| return False | |
| if(n % 11 != 0): | |
| return False | |
| if(n % 13 != 0): | |
| return False | |
| if(n % 16 != 0): |
BedirYilmaz
/ Soru4.py
Created
October 12, 2016 07:44
Finding the largest palindrome made from the product of two 3-digit numbers.
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 palindrome(str): | |
| return str == str[::-1] | |
| for i in range(100, 999): | |
| for j in range(100,999): | |
| if(palindrome(str(i*j))): | |
| print(i*j) |
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 | |
| for x in range(2 , n): | |
| for y in range (2, x): | |
| if x%y == 0: | |
| notprime = True | |
| break | |
| if notprime == False and n % x == 0: | |
| print(str(x) + " is prime and is a factor") | |
| notprime = False |
BedirYilmaz
/ Soru2.py
Last active
October 19, 2016 07:38
Sum of the even fibonacci numbers that are smaller than 4000000
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 fib (n) : | |
| if (n == 1 or n==2): | |
| return 1 | |
| return (fib(n-1) + fib(n-2)) | |
| limit = 4000000 | |
| x = 1 | |
| sum = 0 | |
| a = 0 | |
| while a < limit: |
BedirYilmaz
/ Soru1.py
Last active
October 11, 2016 08:02
Sum of all numbers that are smaller than 999 and can be divided by 5 or 3
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
| sum = 0 | |
| for x in range(999, 1, -1): | |
| if x % 5 == 0 or x % 3 == 0: | |
| print(x) | |
| sum += x | |
| print(sum) |
NewerOlder