Skip to content

Instantly share code, notes, and snippets.

print('you can terminate the operation by entering 0')
while True:
number = int(input('Enter a number:'))
if number > 1:
for i in range(2, number):
if number % i == 0:
print(number, 'is not a prime number')
break
def sqrt(number):
return int(number ** 0.5)
def prime_number(number):
for i in range(2, sqrt(number)):
if number % i == 0:
print(number, 'is not a prime number')
break
else:
print(number, 'is a prime number')
def sum_of_multipliers(number):
sum_of_multipliers = 0
for i in range (1,number):
if number % i == 0:
sum_of_multipliers += i
return sum_of_multipliers
for i in range(1,10000):
if i == sum_of_multipliers(i):
print(i)
def fibonacci(num):
if num <= 1:
return 1
else:
return fibonacci(num-1) + fibonacci(num-2)
num = int(input('How many?:'))
if num <= 0:
print('Enter a positive number.')
numbers = [-2, 5, 16, 21, -21, 1]
def Find_max(list):
if len(list) == 1:
return list[0]
else:
max = Find_max(list[1:])
return max if max > list[0] else list[0]
def ekok(num1, num2):
x = num1
while True:
x += num1
if x % num2 == 0 and x > num2:
return x
print("**ekok**")
num1 = int(input("1.sayı:"))
def ebob(num1,num2):
lst = []
max = 0
for i in range(1,num1):
if num1 % i == 0 and num2 % i == 0:
lst.append(i)
for i in lst:
if i > max:
max = i
return max
def mukemmel_sayi(sayi):
lst = [i for i in range(1, sayi) if sayi % i == 0]
sum = 0
for i in lst:
sum += i
if sum == sayi:
print(sayi)
for i in range(1, 1001):
try:
num1 = int(input("1.Sayı:"))
num2 = int(input("2.Sayı:"))
print(num1 / num2)
except ZeroDivisionError:
print("Bir sayı sıfıra bölünemez.")
except ValueError:
print("Geçerli sayılar girmediniz")
def even_number(num):
if num % 2 != 0:
raise ValueError("this number is not even number.")
else:
return num
lst = [3,4,5,6,7,8,9,16]
for i in lst:
try: