![]() |
|
|
#1 |
|
Aug 2010
Kansas
547 Posts |
Okay, so all factors of a Fermat number are of the form k*2^n+1, right? So, theoretically, P-1 would find factors as long as the k is b-smooth? Is the limitation of this the ~1e15 k value, the size of 2^2^n, or something else that I'm missing? Thanks, Johann.
|
|
|
|
|
|
#2 |
|
"Matthew Anderson"
Dec 2010
Oregon, USA
14418 Posts |
Hi,
Fermat numbers have the form 2^(2^m) + 1. Factors of Fermat numbers have the form k*2^n + 1, where n >= m+2. My reference is http://www.fermatsearch.org/ Using a trial division software downloaded from the above website, I have been searching n=36 and k>1.4e16 Luigi Morelli has a new software that runs about 50 times faster than this, and can find factors of Fermat and Double Mersenne numbers, but it requires a Graphics Processing Unit, and can be downloaded from - http://www.doublemersennes.org/ Regards, Matt |
|
|
|
|
|
#3 | |
|
Basketry That Evening!
"Bunslow the Bold"
Jun 2011
40<A<43 -89<O<-88
3·29·83 Posts |
Quote:
|
|
|
|
|
|
|
#4 | |
|
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2
2×47×101 Posts |
Captain Obvious adds that if "Luigi has a new software", then in that sense everyone has it. The author who had it (as a baby) was one Woltman.
But anyway, that had nothing to do with the OP's question. Quote:
In fact, P-1 had been run with high limits already, so one would not expect to succeed where others* failed. Sometimes, though, - as the Russian proverb goes, even a stick shoots. _______________ *to quote from "Almost Famous": " I'm about to boldly go where... ummm... many men have gone before" |
|
|
|
|
![]() |
| Thread Tools | |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| Stupid question reloaded | LaurV | Information & Answers | 14 | 2015-06-18 23:37 |
| There is -no- such thing as a stupid question? | Uncwilly | Lounge | 19 | 2013-03-07 04:44 |
| Possibly stupid question about PRP. | Biggles | Prime Sierpinski Project | 3 | 2006-02-07 22:50 |
| probably a stupid newbie question... | rpropper | GMP-ECM | 15 | 2005-11-14 14:43 |
| Stupid Question | fropones | Math | 2 | 2003-05-28 00:44 |