![]() |
|
|||||||
| View Poll Results: Need for a Fermat numbers factorization thread? | |||
| Yes, absolutely! |
|
14 | 66.67% |
| Not much, thanks |
|
4 | 19.05% |
| Too many factoring threads around... |
|
2 | 9.52% |
| Who is Fermat? |
|
1 | 4.76% |
| Voters: 21. You may not vote on this poll | |||
![]() |
|
|
Thread Tools |
|
|
#12 |
|
Oct 2004
Austria
46628 Posts |
@Luigi: Did you get my email yesterday? I want to reserve n=32 from k=30e12 to 35e12 (from the "most wanted" list).
|
|
|
|
|
|
#13 |
|
Banned
"Luigi"
Aug 2002
Team Italia
114018 Posts |
|
|
|
|
|
|
#14 |
|
Oct 2004
Austria
2×17×73 Posts |
|
|
|
|
|
|
#15 |
|
Mar 2003
New Zealand
48516 Posts |
I am interested in finding more factors for Generalised Fermat Numbers, particularly those of the form b^(2^n)+1 where b>2 is small and even.
http://www1.uni-hamburg.de/RRZ/W.Keller/GFNsmall.html A few questions I am trying to answer are: What trial factoring, P-1, ECM work has been done already? Is there any suitable trial factoring software for Linux, optimised for x86-64? |
|
|
|
|
|
#16 |
|
Mar 2003
New Zealand
13×89 Posts |
I ended up writing my own program (for x86-64 Linux) to find small factors of generalised Fermat numbers a^(2^m) + b^(2^m). http://www.geocities.com/g_w_reynolds/gfn/.
Current search limits are recorded at http://www1.uni-hamburg.de/RRZ/W.Keller/GFNsrch.txt. |
|
|
|
![]() |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| Issue with fermat factorization | 0palash0 | YAFU | 1 | 2017-09-14 16:55 |
| P-1/P+1 on Fermat numbers | ATH | Operazione Doppi Mersennes | 2 | 2015-01-25 06:27 |
| A new Fermat Factorization improvement? | siegert81 | Factoring | 5 | 2011-06-13 02:58 |
| Fermat factorization subforum poll | ET_ | Factoring | 14 | 2010-07-10 09:40 |
| LLT numbers, linkd with Mersenne and Fermat numbers | T.Rex | Math | 4 | 2005-05-07 08:25 |