mersenneforum.org  

Go Back   mersenneforum.org > Great Internet Mersenne Prime Search > Math

Reply
 
Thread Tools
Old 2006-01-18, 03:51   #1
jocelynl
 
Sep 2002

2×131 Posts
Default another p-1 question

P-1 usually finds smooth factor with gcd of 3^n! and 2^P-1

ex: p=67 N=2^p-1
a factor of N is 193707721 which 2*2*2*3*3*3*5*67*2677+1
So the gcd of 3^(2*2*2*3*3*3*5*67*2677) and N is 193707721

but there is also 3^(2*2*17*17*41*61*67+(4*67))

Has any work been do to find an algorythm like P-1 capable of finding smoother factors?


Joss
jocelynl is offline   Reply With Quote
Reply

Thread Tools


All times are UTC. The time now is 23:23.

Wed Dec 2 23:23:53 UTC 2020 up 83 days, 20:34, 2 users, load averages: 2.34, 1.96, 1.76

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2020, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.