blob: 10966456a65ef3c2bb7127bea111533392e184fa (
plain)
1
2
3
4
5
6
7
8
9
10
11
|
import math
def divSum(n):
sum = 1;
i = 2;
while(i * i <= n):
if (n % i == 0):
sum = (sum + i +math.floor(n / i));
i += 1;
return sum;
def areEquivalent(num1,num2):
return divSum(num1) == divSum(num2);
|