Euler's Totient Function
I understand that for m = pq where p and q are prime numbers, [itex]\Phi[/itex](m) = (p1)(q1). Is there any way that, knowing the numerical value of m and [itex]\Phi[/itex](m), we could deduce p and q, the prime factors of m?
Thanks! 
Re: Euler's Totient Function
Specifically, I know that a huge number m is the product of two primes and I know [itex]\Phi[/itex](m)...but I can't figure out which primes those are and I don't want to figure it out by brute force.

Re: Euler's Totient Function
If you know m=pq and Φ=(p1)(q1), 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^{2}  Sx + m = 0. 
All times are GMT 5. The time now is 06:55 AM. 
Powered by vBulletin Copyright ©2000  2014, Jelsoft Enterprises Ltd.
© 2014 Physics Forums