Suppose n>m>1 are integers such that p=2m(2nm+1)1,q= 2n(2nm+1)1, and r=2n+m(2nm+1)1 are all prime numbers. Then a=2npq and b=2nr are amicable numbers. B. Prove that Euler's formula for generating amicable pairs of integers works. Suppose n>m>1 are integers such that p=2m(2nm+1)1,q= 2n(2nm+1)1, and r=2n+m(2nm+1)1 are all prime numbers. Then a=2npq and b=2nr are amicable numbers. B. Prove that Euler's formula for generating amicable pairs of integers works