Phi is the Euler phi function.

Let N-M be a product of two distinct primes. Show that if N and an integer d ? ?(N) such that 3-d 1 mod ?(N) are known, then it is possible to compute p and q in polynomial time. Hint: Obtain a small list of possibilities for ?(N) and then use the previous exercise