Re: Factoring integers on a classical computer

From: Craig Feinstein (cafeinst_at_msn.com)
Date: 03/17/05 

Date: 16 Mar 2005 18:05:29 -0800

Yes, I realized my mistake when I saw Tim's post and addressed a
response to him. But note the formula for phi(p^k)=[p^(k-1)]*(p-1), for
prime p, and phi is a multiplicative function. From this observation,
it seems that it shouldn't be so difficult to find a factor of n from
the factors of phi(n).

I don't think I was lucky in finding a cycle out of my calculations. I
did it for a few other numbers and came up with similar cycles. My
guess is that this procedure always leads to some factors of phi(n).

Craig

Loading