Dynata interview questions

Programming Assignment: Given two numbers, M and N, write a program to determine if M & N are amicable pairs. An amicable pair (m,n) consists of two integers m,n for which the sum of proper divisors (the divisors excluding the number itself) of one number equals the other. Amicable pairs are occasionally called friendly pairs (Hoffman 1998, p. 45), although this nomenclature is to be discouraged since the numbers more commonly known as friendly pairs are defined by a different, albeit related, criterion. Not, a number cannot be amicable with itself.