View Single Post
Old 2005-05-23, 20:20   #2
xilman's Avatar
May 2003
Down not across

22·5·72·11 Posts

Originally Posted by jchein1
Currently, I am attempting to prove that an Odd Perfect Number must have at least 9 distinct prime factors (I did 8 in 1979). I need to get just one factor out of a c163 from the L Aurifeillian of 17^289-1 or alternatively prove that c163 has at most 4

Any advice would be welcome. Thank you in advance.

Joseph E.Z. Chein
A c163 is feasible, though non-trivial, by GNFS these days. That would settle the question of its factorization.

I think I'd want to see ECM work done to around the p50 level before recommending it be done by GNFS.

xilman is offline   Reply With Quote