Suppose n > m > 1 are integers such that p = 2m (Znm + 1) 1, q = 2\" (2\"'m + 1) 1, and r : 2n+m (2\"'m + 1) 1 are all prime numbers. Then a : 2\"\"pq and b : 2\"?\" are amicable numbers. ,6. Prove that Euler's formula for generating amicable pairs of integers works