View Single Post
Old 2020-11-06, 00:28   #13
bbb120
 
bbb120's Avatar
 
Feb 2019
China

59 Posts
Default

Quote:
Originally Posted by Batalov View Post
That's irrelevant. (If all you have is a hammer, everything looks like a nail.)

Peter Strasser searched really hard with software shown here and found this factor of F118, and that's the end of this story.

It says it right there - he found it with mmff. That means - using a GPU.

Now, how did I find this one?

...not just by running mmff. First, I was studying mmff's source for a week and then modified and experimented with it for a few weeks and when I was content with the new extended range (n in range high hundred-ish to low-200-ish) passing all tests, I ran it for several more months (and I paid a bunch for ~20 GPUs on AWS for several months) -- but I did get it. It was not easy, I will tell you that.
Fn=2^(2^n)+1 has factors in k*2^(n+2)+1 this form,
so we can test a primality on p=k*2^(n+2)+1 before we
calculate Fn Mod p, do you have any algorithm which can be more faster to get
factor?
bbb120 is offline   Reply With Quote