Can You Find the Prime Factors of m Using Euler's Totient Function?

[squire636]

I understand that for m = pq where p and q are prime numbers, \Phi(m) = (p-1)(q-1). Is there any way that, knowing the numerical value of m and \Phi(m), we could deduce p and q, the prime factors of m?

Thanks!

 

[squire636]

Specifically, I know that a huge number m is the product of two primes and I know \Phi(m)...but I can't figure out which primes those are and I don't want to figure it out by brute force.

 

[I like Serena]

If you know m=pq and Φ=(p-1)(q-1), then define S=m-Φ+1=p+q.

So you have the product m and the sum S.
That means p and q are the solutions of the quadratic x² - Sx + m = 0.