Amicable numbers are two different numbers so related that the sum of the proper divisors of each is equal to the other number. (A proper divisor of a number is a positive factor of that number other than the number itself. For example, the proper divisors of 6 are 1, 2, and 3.) 
For example, the smallest pair of amicable numbers is (220, 284); for the proper divisors of 220 are 1, 2, 4, 5, 10, 11, 20, 22, 44, 55 and 110, of which the sum is 284; and the proper divisors of 284 are 1, 2, 4, 71 and 142, of which the sum is 220.
Derive function ```amicableNumbers(num1, num2)``` which returns ```true/True``` if pair ```num1 num2``` are amicable, ```false/False``` if not.
See more at https://en.wikipedia.org/wiki/Amicable_numbers
def amicable_numbers(n1,n2):
    divisors1 = [i for i in range(1,n1) if n1%i==0]
    divisors2 = [i for i in range(1,n2) if n2%i==0]
    return bool(sum(divisors1)==n2 and sum(divisors2)==n1)
def amicable_numbers(n1,n2):
    divisors1 = [i for i in range(1,n1) if n1%i==0]
    divisors2 = [i for i in range(1,n2) if n2%i==0]
    return bool(sum(divisors1)==n2 and sum(divisors2)==n1)