View Single Post
Old 2020-10-10, 14:49   #7
swellman's Avatar
Jun 2012

17×179 Posts

Originally Posted by fivemack View Post
So, the easiest outstanding Fibonacci quartic is L2995A; difficulty 250.37

Would it be possible to queue up 20k curves at B1=260M on that one?

An alternative would be to binary-search the limits of _fs feasibility, with L4605A difficulty 256.64

25k curves at B1=260M would be nice for that one, I'll do another thorough trial-sieve which will take ~48 hours..
Yoyo has agreed to run these jobs but he asked me to manage the process. Keep in mind that work is limited to 20,000 curves per job for B1 =< 260M, 12,000 curves for B1 = 850M.

I will enqueue both jobs with yoyo in the next day or two.

Last fiddled with by swellman on 2020-10-10 at 15:46
swellman is online now   Reply With Quote