| import math | |
| def div_sum(n): | |
| total = 1 | |
| i = 2 | |
| while i * i <= n: | |
| if (n % i == 0): | |
| total = (total + i + math.floor(n / i)) | |
| i += 1 | |
| return total | |
| def are_equivalent(num1, num2): | |
| return div_sum(num1) == div_sum(num2); |
| import math | |
| def div_sum(n): | |
| total = 1 | |
| i = 2 | |
| while i * i <= n: | |
| if (n % i == 0): | |
| total = (total + i + math.floor(n / i)) | |
| i += 1 | |
| return total | |
| def are_equivalent(num1, num2): | |
| return div_sum(num1) == div_sum(num2); |