View Single Post
Old 2020-10-09, 10:11   #6
fivemack
(loop (#_fork))
 
fivemack's Avatar
 
Feb 2006
Cambridge, England

13·491 Posts
Default

So, the easiest outstanding Fibonacci quartic is L2995A; difficulty 250.37

http://factordb.com/index.php?showid...00000216955784

Code:
6647246946274833393456661338737441255614261080716309840406229789042569778456310323482125160454068850539445673923995827291479838370880449615345378166944942195594414495045570103808609316829203645670851879601136941
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

http://factordb.com/index.php?id=1100000000216955924

Code:
3584242181859180897028227800643356671652242043498330593404045120001651398447679822689230799275312050386811076406419865592578911649557946131137999151560109118895314557059384056761129147893233379009026747238392618096742921
25k curves at B1=260M would be nice for that one, I'll do another thorough trial-sieve which will take ~48 hours..
fivemack is offline   Reply With Quote