RSA public encryption: Finding p and q given $\phi(pq)$

572 Views Asked by At

I have a quick question: My book asks me to show that if someone were to find that value of $\phi(pq)$ then they would be able to find out p and q.

Is this possible? I've seen many examples of finding p and q given $\phi(pq)$ and the value of pq. Is it possible to do this without knowing the value of pq?

edit: p and q are also prime