Dear All,
Firstly, apologies to anyone receiving multiple copies of this message.
The following are the only six 30+ digit factors found by Pollard's p-1
of which I am aware:
(1) p34=8222057557067636644603420882415653
p-1=2^2.3.17.23.43.11657.506797.1632809.1692107.2496721
N=917^43-1
to around 1300
digits input. Good luck anyway!
Andy Steward
_
Unsubscribe list info -- http://www.scruz.net/~luke/signup.htm
Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
imise it, then run an "A"
priority task running in an active window. That way, I ensure that the
machine won't be idle if the "A" task completes before my return. The
downside is the reduction in resources available to the "A" task while
both are running.
HTH,
Andy St
) then no data
It's all a bit thin and arm-waving, but I would be interested to see if
a continuation of the series confirms or denies either of these
conjectures.
Regards,
Andy Steward
Factorisations of generalised repunits at:
http://www.users.globalnet.co.uk/~aads/index.html
20 U
19937 18 U 2 U
21701 1 U 30 U
23209 11 U 19 U
44497 22 U 10 U
86243 1 U 30 U
110503 10 - 17 -
132049 26 U 18 U
216091 11 U 19 U
756839 3 + 3 +
859433 26 U 18 U
1257787 28 - 22 -
1398269 23 - 12 -
2976221 18 U 2 U
3021377 28 - 22 -
6972593 6 U 9 U
Regards,
Andy
