mersenneforum.org  

Go Back   mersenneforum.org > Factoring Projects > NFS@Home

Reply
 
Thread Tools
Old 2020-01-08, 14:50   #1
fivemack
(loop (#_fork))
 
fivemack's Avatar
 
Feb 2006
Cambridge, England

13·491 Posts
Default Next plausible Lucas/Fibonacci/similar milestones

By Easter we should have finished the Fibonacci/Lucas numbers to 200 digits, and the Fibonacci/Lucas numbers with quartic polynomials to difficulty 250; the ones with sextic polynomials to difficulty 275 are already done.

This feels as if maybe I should move away from Q[sqrt(5)]; any ideas of a good direction to go in? Spending a year of my own compute time on a GNFS(210) isn't immediately appealing.

Last fiddled with by fivemack on 2020-01-08 at 15:11
fivemack is offline   Reply With Quote
Old 2020-01-08, 16:09   #2
Batalov
 
Batalov's Avatar
 
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2

939810 Posts
Default

Perhaps, a factorization catalog of Lehmer numbers?
Batalov is offline   Reply With Quote
Old 2020-01-08, 16:40   #3
R.D. Silverman
 
R.D. Silverman's Avatar
 
Nov 2003

1D2416 Posts
Default

Quote:
Originally Posted by fivemack View Post
By Easter we should have finished the Fibonacci/Lucas numbers to 200 digits, and the Fibonacci/Lucas numbers with quartic polynomials to difficulty 250; the ones with sextic polynomials to difficulty 275 are already done.

This feels as if maybe I should move away from Q[sqrt(5)]; any ideas of a good direction to go in? Spending a year of my own compute time on a GNFS(210) isn't immediately appealing.
The Fibonacci's are complete to index 1400. Perhaps do the same for Lucas?
R.D. Silverman is offline   Reply With Quote
Old 2020-01-08, 16:51   #4
xilman
Bamboozled!
 
xilman's Avatar
 
"π’‰Ίπ’ŒŒπ’‡·π’†·π’€­"
May 2003
Down not across

22×2,663 Posts
Default

Quote:
Originally Posted by fivemack View Post
By Easter we should have finished the Fibonacci/Lucas numbers to 200 digits, and the Fibonacci/Lucas numbers with quartic polynomials to difficulty 250; the ones with sextic polynomials to difficulty 275 are already done.

This feels as if maybe I should move away from Q[sqrt(5)]; any ideas of a good direction to go in? Spending a year of my own compute time on a GNFS(210) isn't immediately appealing.
The GCW tables have had all the low-hanging fruit removed but there are still many which are much easier than GNFS(210).

An update to https://www.brnikat.com/nums/cullen_...utor_info.html is long overdue, given that both SSW and Rob Hooft have sent in factors recently, but a few G18x and S25x are still available. Note that the latter do not have particularly good polynomials but your rather impressive resources should be able to breeze through either class at a frequency approaching a microHertz.

IΒ΄m running CADO-NFS on 11,244-_C218 with a naive difficulty of S256.5 but that is one of the bad polynomials and it will take me several more months, not least because only two machines are running part time on it. I can provide CADO server details on request if anyone wishes to contribute.

Last fiddled with by xilman on 2020-01-08 at 16:53
xilman is online now   Reply With Quote
Old 2020-01-08, 17:50   #5
xilman
Bamboozled!
 
xilman's Avatar
 
"π’‰Ίπ’ŒŒπ’‡·π’†·π’€­"
May 2003
Down not across

22·2,663 Posts
Default

Quote:
Originally Posted by xilman View Post
The GCW tables have had all the low-hanging fruit removed but there are still many which are much easier than GNFS(210).
Update now completed.
Quote:
The smallest composite remaining to be factored has 184 digits. There are 13 composites with fewer than 190 digits and 88 with at least 1000 digits.

For those wishing to factor with the SNFS algorithm, this table contains the a and n values sorted by SNFS-difficulty (defined here as log10 (n.an) ) for those unfactored numbers which have SNFS-difficulty under 265. There are 68 entries in this table, some of which may have been reserved.
xilman is online now   Reply With Quote
Old 2020-01-08, 18:44   #6
R.D. Silverman
 
R.D. Silverman's Avatar
 
Nov 2003

22·5·373 Posts
Default

Quote:
Originally Posted by xilman View Post
Update now completed.
And there are a lot of numbers from the Homogeneous Cunninghams that
are too big for lasieved. Many GNFS in the 175+ digit range, A lot of quartics
in the C220-250 range, etc. etc. Plus a bunch of SNFS in the (say) 255-280 digit
range...
R.D. Silverman is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
Is a plausible conjecture? enzocreti enzocreti 0 2019-11-06 15:02
Lucas and Fibonacci SNFS polynomials. chris2be8 Factoring 26 2019-01-03 16:49
Lucas and Fibonacci primes Batalov And now for something completely different 9 2017-06-28 16:56
Fibonacci and Lucas factors Raman Math 40 2010-07-19 03:30
Factoring Fibonacci/Lucas numbers geoff Factoring 13 2005-12-23 01:59

All times are UTC. The time now is 18:19.

Thu Apr 22 18:19:34 UTC 2021 up 14 days, 13 hrs, 0 users, load averages: 3.87, 3.42, 3.28

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, 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.