contestada

4. fill in the empty function so that it returns the sum of all the divisors of a number, without includi
a number that divides into another without a remainder.
def sum_divisors (n):
sum = 0
# return the sum of all divisors of n, not including
return sum
print (sum_divisors (0))
# 0
8
print (sum_divisors (3)) # should sum of 1
# 1
i
10
print (sum_divisors (36)) # should sum of 1+2+3+4+6+9+12+18
11
# 55
12
print (sum_divisors (102)) # should be sum of 2+3+6+17+34+51
# 114
13
14
12345678

Respuesta :

lhmarianateixeira

Using the python language we have that it will be possible to write a code that sums all possible divisors of a number.

Writing the code we have;

def sum_ divisors(n):

  s = 0

  for i in range(1, n):

       if n%i == 0:

           s += i

  return i

See more about python at brainly.com/question/18502436

#SPJ1

Ver imagen lhmarianateixeira

Otras preguntas