$N=p*q$ is a product of two distinct primes. Show that if $\phi(N)$ and 2N are known, then it is possible to compute p and q in polynomial time.
so, I know that $\phi(N)=(p-1)(q-1)$
Given this, if $\phi(N)=C$ where $C$ is a known constant,
$C=(p-1)(q-1)$
$\frac{C}{q-1}+1=p$
So, I know it is possible to compute p and q. How would I prove that it is possible to compute them in polynomial time?