Task 6:
Find the program, if the number is divisible by 4.
n = 124
lastTwoDigits = n % 100
if lastTwoDigits % 4 == 0:
print(f'{n} is divisible by 4')
else:
print(f'{n} is not divisible by 4')
n = 124
if n % 4 == 0:
print(f'{n} is divisible by 4')
else:
print(f'{n} is not divisible by 4')
Output:
124 is divisible by 4
Task 7:
Find the program, if the number is divisible by 5.
n = 100
value = n % 10
if value == 0 or value == 5:
print(f'{n} is divisible by 5')
else:
print(f'{n} is not divisible by 5')
n = 100
value = n % 10
if value in (0,5):
print(f'{n} is divisible by 5')
else:
print(f'{n} is not divisible by 5')
n = 100
if n % 5 == 0:
print(f'{n} is divisible by 5')
else:
print(f'{n} is not divisible by 5')
Output:
100 is divisible by 5
Task 8:
Find the program, if the number is divisible by 6.
n = 60
if n % 2 == 0 and n % 3 == 0:
print(f'{n} is divisible by 6')
else:
print(f'{n} is not divisible by 6')
n = 60
if n % 6 == 0:
print(f'{n} is divisible by 6')
else:
print(f'{n} is not divisible by 6')
Output:
60 is divisible by 6
Task 9:
Find the program, if the number is divisible by 8.
n = 8000
value = n % 1000
if value % 8 == 0:
print(f'{n} is divisible by 8')
else:
print(f'{n} is not divisible by 8')
n = 8000
if n % 8 == 0:
print(f'{n} is divisible by 8')
else:
print(f'{n} is not divisible by 8')
Output:
8000 is divisible by 8
Task 10:
Find the program, if the number is divisible by 9.
n = 9567
original = n
total = 0
while n > 0:
m = n % 10
total = total + m
n = n // 10
print(total)
if total % 9 == 0:
print(f'{original} is divisible by 9')
else:
print(f'{original} is not divisible by 9')
Output:
27
9567 is divisible by 9
Task 11:
Find the program, if the number is divisible by 10.
n = 100
value = n % 10
if value == 0:
print(f'{n} is divisible by 10')
else:
print(f'{n} is not divisible by 10')
Output:
100 is divisible by 10
Top comments (0)